LINGUIST List 14.500

Thu Feb 20 2003

Qs: Taxemes, Pronunciation Index

Editor for this issue: Renee Galvis <reneelinguistlist.org>

We'd like to remind readers that the responses to queries are usually best posted to the individual asking the question. That individual is then strongly encouraged to post a summary to the list. This policy was instituted to help control the huge volume of mail on LINGUIST; so we would appreciate your cooperating with it whenever it seems appropriate. In addition to posting a summary, we'd like to remind people that it is usually a good idea to personally thank those individuals who have taken the trouble to respond to the query. To post to LINGUIST, use our convenient web form at http://linguistlist.org/LL/posttolinguist.html.

Directory

  1. Dan Everett, Taxemes and Readjustment Rules
  2. Eric Persson, pronounciation index from a string

Message 1: Taxemes and Readjustment Rules

 Date: Wed, 19 Feb 2003 09:33:18 +0000
From: Dan Everett <dan.everettman.ac.uk>
Subject: Taxemes and Readjustment Rules

Can readers of this list direct me to any explicit comparisons between
'readjustment rules' in Distributed Morphology and Sound Pattern of
English with Bloomfield's 'taxemes'?

For example, in Bloomfield (1935, 167ff) alternations e.g. duke + ess
- > duchess are discussed. After combing these two forms, Bloomfield
states that a phonetic modification is necessary to get duchess and
that this modification is a further feature of grammatical
arrangement. This feature he calls a 'taxeme'. Moreover, he claims
that taxemes cannot contribute to meaning. (Taxemes are also discussed
in PH Matthews' Grammatical theory in the United States from
Bloomfield to Chomsky (CUP), 1993.)

- Dan Everett
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue

Message 2: pronounciation index from a string

 Date: Wed, 19 Feb 2003 16:32:11 +0100
From: Eric Persson <ericpersson.tm>
Subject: pronounciation index from a string

Hi everyone,

I'm looking for a algoritm to generate some sort of pronounciation
index from a string. I've been looking at things like the levensthein
and the metaphone options, but they are more for comparing strings.

What I want is really to get an index of the pronounciation, and then
define an interval in where the index should be to be accepted.

It might be far fetched, but the goal is to determine wheather a
string is "easy or not" to pronounce.

Does anyone know of such an algoritm, or maybe you know where I should
look for one?

Thanks in advance,
	Eric
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue