Two-Level Phonology/Morphology: Recognition

Summary of Recognition Algorithm

• For each input surface character, the recognizer selects a feasible pair, consulting the rules.
• For each new lexical character, the recognizer also consults the lexicon, which has the structure of a letter tree.
• The recognizer backtracks
  • if it reaches the end of a word in the lexicon (with no continuation possible) but the automata are not all in final states or there are additional surface characters or
  • if there are no more surface characters but the end of a word has not been reached or the automata are not all in final states.

Example

input pair	o:o	y:y	o:o	g:0	+:0	0:i	t:d	a:a
output form	o	oy	oyo	oyog	oyog+	oyog+	oyog+t	oyog+ta
lexical output	--	--	--	--	{SWIM}	{SWIM}	{SWIM}	{SWIM,PAST}
VOICING	1	1	1	2	2	2	1	1
EPENTHESIS	1	1	1	2	2	3	1	1
VELAR DELETION	1	1	1	4	4	5	1	1

[L645 Syllabus]