Squeezing the infinite into the finite: Handling the OT candidate set with Finite State technology
| Autor: | Biro, Tamas, YliJyra, A, Karttunen, L, Karhumaki, J |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2006 |
| Předmět: | |
| Zdroj: | Finite-State Methods and Natural Language Processing, 21-31 STARTPAGE=21;ENDPAGE=31;TITLE=Finite-State Methods and Natural Language Processing |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|