@inproceedings{2c588a4795534feb9cd762c67fb0b6ac,
title = "Squeezing the infinite into the finite: Handling the OT candidate set with Finite State technology",
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.",
keywords = "OPTIMALITY THEORY",
author = "Tamas Biro",
year = "2006",
language = "English",
isbn = "978-3-540-35467-3",
series = "LECTURE NOTES IN COMPUTER SCIENCE",
publisher = "Springer",
pages = "21--31",
editor = "A YliJyra and L Karttunen and J Karhumaki",
booktitle = "Finite-State Methods and Natural Language Processing",
note = "Meeting on Finite State Methods and Natural Language Processing (FSMNLP05) ; Conference date: 01-09-2005 Through 02-09-2005",
}