<OT> New Posting: ROA-1032

[roa at ruccs.rutgers.edu]

ROA 1032-0609

Squeezing the Infinite into the Finite: Handling the OT Candidate Set with Finite State Technology

Tamas Biro <birot at nytud.hu>

Direct link: http://roa.rutgers.edu/view.php3?roa=1032


Abstract:
Finite State approaches to Optimality Theory have had two
goals. The earlier and less ambitious one was to compute
the optimal output by compiling a finite state automaton
for each underlying representation. Newer approaches aimed
at realizing the OT-systems as FS transducers mapping any
underlying representation to the corresponding surface form.
After reviewing why the second one fails for most linguistically
interesting cases, we use its ideas to accomplish the first
goal. Finally, we present how this approach could be used
in the future as a — hopefully cognitively adequate — model
of the mental lexicon.

Comments: In: A. Yli-Jyrä, L. Karttunen, J. Karhumäki (eds.): Finite-State Methods and Natural Language Processing, 5th FSMNLP workshop, Helsinki, Finland, September 2005, Revised Papers, LNAI 4002, Springer, 2006, pp. 21-31. (c) Springer Verlag
Keywords: Finite-State OT, lexicon
Areas: Computation
Type: Book Chapter

Direct link: http://roa.rutgers.edu/view.php3?roa=1032