Skip to main content
SpringerLink
Log in

Squeezing the Infinite into the Finite

  • Conference paper
Finite-State Methods and Natural Language Processing (FSMNLP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4002))

  • 669 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albro, D.M.: Taking primitive Optimality Theory beyond the finite state. In: Eisner, Karttunen, J.L., Thériault, A. (eds.) Finite-State Phonology: Proc. of the 5th Workshop of SIGPHON, Luxembourg, pp. 57–67 (2000)

    Google Scholar 

  2. Anttila, A., Cho, Y.: Variation and change in optimality theory. Lingua 104(1-2), 31–56 (1998)

    Article  Google Scholar 

  3. Bíró, T.: Quadratic alignment constraints and finite state Optimality Theory. In: Proc. of the Workshop on FSMNLP, at EACL 2003, Budapest, pp. 119–126 (2003), ROA stands for Rutgers Optimality Archiver at http://roa.rutgers.edu/

  4. Bíró, T.: When the hothead speaks: Simulated Annealing Optimality Theory for Dutch fast speech. In: CLIN 2004, Leiden (2004)

    Google Scholar 

  5. Bíró, T.: How to define simulated annealing for optimality theory? In: Proc. of the 10th Conference on Formal Grammar and the 9th Meeting on Mathematics of Language, Edinburgh (August 2005)

    Google Scholar 

  6. Burzio, L.: Missing players: Phonology and the past-tense debate. Lingua 112, 157–199 (2002)

    Article  Google Scholar 

  7. Eisner, J.: Efficient generation in primitive Optimality Theory. In: Proc. of ACL 1997 and EACL-8, Madrid, pp. 313–320 (1997)

    Google Scholar 

  8. Eisner, J.: Directional constraint evaluation in Optimality Theory. In: Proc. of COLING 2000, Saarbrücken (2000)

    Google Scholar 

  9. Eisner, J.: Comprehension and compilation in Optimality Theory. In: Proc. of ACL 2002, Philadelphia (2002)

    Google Scholar 

  10. Ellison, T.M.: Phonological derivation in Optimality Theory. In: COLING 1994, Kyoto, pp. 1007–1013, Also: ROA-75 (1994)

    Google Scholar 

  11. Frank, R., Satta, G.: Optimality Theory and the generative complexity of constraint violability. Computational Ling. 24(2), 307–315 (1998)

    MathSciNet  Google Scholar 

  12. Gerdemann, D., van Noord, G.: Approximation and exactness in finite state Optimality Theory. In: Eisner, J., Karttunen, L., Thériault, A. (eds.) SIGPHON 2000, Finite State Phonology (2000)

    Google Scholar 

  13. Jäger, G.: Gradient constraints in finite state OT: The unidirectional and the bidirectional case. ROA-479 (2002)

    Google Scholar 

  14. Johnson, D.C.: Formal Aspects of Phonological Description. Mouton, The Hague [etc.] (1972)

    Google Scholar 

  15. Karttunen, L.: The proper treatment of Optimality Theory in computational phonology. In: Finite-state Methods in NLP, Ankara, pp. 1–12 (1998)

    Google Scholar 

  16. Kuhn, J.: Processing optimality-theoretic syntax by interleaved chart parsing and generation. In: Proc. of ACL 2000, Hongkong, pp. 360–367 (2000)

    Google Scholar 

  17. Prince, A., Smolensky, P.: Optimality Theory, constraint interaction in generative grammar. RuCCS-TR-2, ROA Version: 8/2002 (1993)

    Google Scholar 

  18. Prince, A., Smolensky, P.: Optimality Theory: Constraint Interaction in Generative Grammar. Blackwell, Malden (2004)

    Book  Google Scholar 

  19. Tesar, B., Smolensky, P.: Learnability in Optimality Theory. The MIT Press, Cambridge, London, England (2000)

    Google Scholar 

  20. Turkel, B.: The acquisition of optimality theoretic systems. m.s., ROA-11 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Humanities Computing, University of Groningen, The Netherlands

    Tamás Bíró

Authors
  1. Tamás Bíró
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Language Research Service, CSC Scientific Computing Ltd., Finland

    Anssi Yli-Jyrä

  2. Palo Alto Research Center, Stanford University, P.O. Box, USA

    Lauri Karttunen

  3. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bíró, T. (2006). Squeezing the Infinite into the Finite. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds) Finite-State Methods and Natural Language Processing. FSMNLP 2005. Lecture Notes in Computer Science(), vol 4002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780885_4

Download citation

  • DOI: https://doi.org/10.1007/11780885_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35467-3

  • Online ISBN: 978-3-540-35469-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation