Skip to main content Accessibility help
×
Home

Formal and computational verification of phonological analyses*

  • Mans Hulden (a1)

Abstract

This article presents a selection of methods to analyse, compare, verify and formally prove properties about phonological generalisations. Drawing from both well-known and recent results in the domains of model checking and automata theory, a useful methodology for automating the task of comparing analyses and inventing counterexamples is explored. The methods are illustrated by practical case studies that are intended to both resolve concrete issues and be representative of typical techniques and results.

Copyright

Corresponding author

Footnotes

Hide All
*

Thanks to Dale Gerdemann, Mike Hammond and Lauri Karttunen for useful insights and discussion around various versions of this work. Thanks also to the editors and anonymous reviewers for many helpful comments and pointers. All errors are my own.

Footnotes

References

Hide All
Albro, Daniel M. (2005). Studies in computational Optimality Theory, with special reference to the phonological system of Malagasy. PhD dissertation, University of California, Los Angeles.
Anttila, Arto (1997). Deriving variation from grammar. In Hinskens, Frans, van Hout, Roeland & Wetzels, W. Leo (eds.) Variation, change and phonological theory. Amsterdam & Philadelphia: Benjamins. 3568.
Baier, Christel & Katoen, Joost-Pieter (2008). Principles of model checking. Cambridge, Mass.: MIT Press.
Beesley, Kenneth R. (2012). Kleene, a free and open-source language for finite-state programming. In Proceedings of the 10th International Workshop on Finite State Methods and Natural Language Processing. Association for Computational Linguistics. 50–54.
Beesley, Kenneth R. & Karttunen, Lauri (2003). Finite state morphology. Stanford: CSLI.
Bermúdez-Otero, Ricardo (2007). Diachronic phonology. In de Lacy, Paul (ed.) The Cambridge handbook of phonology. Cambridge: Cambridge University Press. 497517.
Bird, Steven (1995). Computational phonology: a constraint-based approach. Cambridge: Cambridge University Press.
Blattner, Meera & Head, Tom (1977). Single-valued a-transducers. Journal of Computer and System Sciences 15. 310327.
Boersma, Paul (1999). Optimality-Theoretic learning in the Praat program. Proceedings of the Institute of Phonetic Sciences of the University of Amsterdam 23. 1735.
Chandlee, Jane, Eyraud, Rémi & Heinz, Jeffrey (2014). Learning Strictly Local subsequential functions. Transactions of the Association for Computational Linguistics 2. 491503.
Culik II, K. (1978). Some decidability results about regular and push down translations. Research Report CS-78-09, University of Waterloo, Ontario. Available (May 2017) at https://cs.uwaterloo.ca/research/tr/1978/CS-78-09.pdf.
Eisner, Jason (2002). Comprehension and compilation in optimality theory. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics. 56–63.
Elenbaas, Nine (1999). A unified account of binary and ternary stress: considerations from Sentani and Finnish. PhD dissertation, Utrecht University.
Elenbaas, Nine & Kager, René (1999). Ternary rhythm and the lapse constraint. Phonology 16. 273329.
Ellison, T. Mark (1994). Phonological derivation in Optimality Theory. In Proceedings of the 15th International Conference on Computational Linguistics (COLING) . Association for Computational Linguistics. 1007–1013.
Frank, Robert & Satta, Giorgio (1998). Optimality Theory and the generative complexity of constraint violability. Computational Linguistics 24. 307315.
Gerdemann, Dale & Hulden, Mans (2012). Practical finite state Optimality Theory. In Proceedings of the 10th International Workshop on Finite State Methods and Natural Language Processing. Association for Computational Linguistics. 10–19.
Gerdemann, Dale & van Noord, Gertjan (2000). Approximation and exactness in finite state optimality theory. In Jason Eisner, Lauri Karttunen & Alain Thériault (eds.) Finite-state phonology: proceedings of the 5th Workshop of the ACL Special Interest Group in Computational Phonology (SIGPHON). Luxemburg. 34–45.
Griffiths, T. V. (1968). The unsolvability of the equivalence problem for Λ-free nondeterministic generalized machines. Journal of the ACM 15. 409413.
Hakulinen, Auli, Korhonen, Riitta, Vilkuna, Maria & Koivisto, Vesa (2004). Iso suomen kielioppi. [Comprehensive Finnish grammar.] Helsinki: Suomalaisen kirjallisuuden seura.
Halle, Morris & Idsardi, William J. (2000). Stress and length in Hixkaryana. The Linguistic Review 17. 199218.
Halle, Morris & Nevins, Andrew (2009). Rule application in phonology. In Raimy, Eric & Cairns, Charles E. (eds.) Contemporary views on architecture and representations in phonology. Cambridge, Mass.: MIT Press. 355382.
Hammond, Michael (1997). Parsing syllables: modeling OT computationally. Ms, University of Arizona. Available as ROA-222 from the Rutgers Optimality Archive.
Hayes, Bruce, Tesar, Bruce & Zuraw, Kie (2013). OTSoft 2.3.2. Software package. http://www.linguistics.ucla.edu/people/hayes/otsoft/.
Heinz, Jeffrey (2009). On the role of locality in learning stress patterns. Phonology 26. 303351.
Heinz, Jeffrey & Idsardi, William J. (2011). Sentence and word complexity. Science 333. 295297.
Hopcroft, John (1971). An n log n algorithm for minimizing states in a finite automaton. Technical Report STAN-CS-71-190, Computer Science Department, Stanford University.
Hopcroft, John E. & Ullman, Jeffrey D. (1979). Introduction to automata theory, languages, and computation. Boston: Addison-Wesley.
Hulden, Mans (2006). Finite-state syllabification. In Yli-Jyrä, Anssi, Karttunen, Lauri & Karhumäki, Juhani (eds.) Finite-state methods and natural language processing. Berlin & Heidelberg: Springer. 8696.
Hulden, Mans (2009a). Finite-state machine construction methods and algorithms for phonology and morphology. PhD dissertation, University of Arizona.
Hulden, Mans (2009b). Foma: a finite-state compiler and library. In Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: demonstrations session. Association for Computational Linguistics. 2932.
Hulden, Mans (2009c). Regular expressions and predicate logic in finite-state language processing. In Piskorski, Jakub, Watson, Bruce & Yli-Jyrä, Anssi (eds.) Finite-state methods and natural language processing: post-proceedings of the 7th international workshop FSMNLP 2008. Amsterdam: IOS. 8297.
Hulden, Mans (2015). Grammar design with multi-tape automata and composition. In Proceedings of the 12th International Conference on Finite State Methods and Natural Language Processing. Association for Computational Linguistics.
Idsardi, William J. (2000). Clarifying opacity. The Linguistic Review 17. 337350.
Johnson, C. Douglas (1972). Formal aspects of phonological description. The Hague: Mouton.
Kager, René (1999). Optimality Theory. Cambridge: Cambridge University Press.
Kaplan, Ronald & Kay, Martin (1994). Regular models of phonological rule systems. Computational Linguistics 20. 331378.
Karttunen, Lauri (1995). The replace operator. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics. 16–23.
Karttunen, Lauri (1996). Directed replacement. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics. 108–115.
Karttunen, Lauri (1998). The proper treatment of optimality in computational phonology. In Karttunen, Lauri & Oflazer, Kemal (eds.) Proceedings of the International Workshop on Finite State Methods in Natural Language Processing. Ankara: Bilkent University. 112.
Karttunen, Lauri (2006a). A finite-state approximation of optimality theory: the case of Finnish prosody. In Salakoski, Tapio, Ginter, Filip, Pyysalo, Sampo & Pahikkala, Tapio (eds.) Advances in natural language processing. Berlin & Heidelberg: Springer. 415.
Karttunen, Lauri (2006b). The insufficiency of paper-and-pencil linguistics: the case of Finnish prosody. Available as ROA-818 from the Rutgers Optimality Archive.
Karvonen, Daniel Howard (2005). Word prosody in Finnish. PhD dissertation, University of California, Santa Cruz.
Kiparsky, Paul (2003). Finnish noun inflection. In Nelson, Diane & Manninen, Satu (eds.) Generative approaches to Finnic and Saami linguistics. Stanford: CSLI. 109161.
Kisseberth, Charles W. (1970). On the functional unity of phonological rules. LI 1. 291306.
Koskenniemi, Kimmo (1983). Two-level morphology: a general computational model for word-form recognition and production. Helsinki: Department of General Linguistics, University of Helsinki.
Langendoen, D. Terence (1981). The generative capacity of word-formation components. LI 12. 320322.
McCarthy, John J. (2003). Comparative markedness. Theoretical Linguistics 29. 151.
McCarthy, John J. & Prince, Alan (1993). Generalized alignment. Yearbook of Morphology 1993. 79153.
Mohri, Mehryar & Sproat, Richard (1996). An efficient compiler for weighted rewrite rules. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics. 231–238.
Moore, Edward F. (1956). Gedanken-experiments on sequential machines. In Shannon, C. E. & McCarthy, J. (eds.) Automata studies. Vol. 2. Princeton: Princeton University Press. 129153.
Myhill, John (1957). Finite automata and the representation of events. Technical Report 57-624, Wright Airport Development Command. 112–137.
Prince, Alan & Smolensky, Paul (1993). Optimality Theory: constraint interaction in generative grammar. Ms, Rutgers University & University of Colorado, Boulder. Published 2004, Malden, Mass. & Oxford: Blackwell.
Rabin, M. O. & Scott, D. (1959). Finite automata and their decision problems. IBM Journal of Research and Development 3. 114125.
Riggle, Jason (2004). Generation, recognition, and learning in finite-state Optimality Theory. PhD dissertation, University of California, Los Angeles.
Rogers, James & Pullum, Geoffrey K. (2011). Aural pattern recognition experiments and the subregular hierarchy. Journal of Logic, Language and Information 20. 329342.
Rubach, Jerzy (1984). Cyclic and Lexical Phonology: the structure of Polish. Dordrecht: Foris.
Rubach, Jerzy (2000). Glide and glottal stop insertion in Slavic languages: a DOT analysis. LI 31. 271317.
Salomaa, Arto (1993). Decidability in finite automata. In Rozenberg, G. & Salomaa, A. (eds.) Current trends in theoretical computer science: essays and tutorials. Singapore: World Scientific. 572578.
Vaillette, Nathan (2004). Logical specification of finite-state transductions for natural language processing. PhD dissertation, Ohio State University.
Yli-Jyrä, Anssi (2013). On finite-state tonology with autosegmental representations. In Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing. Stroudsburg, PA: Association for Computational Linguistics. 90–98.
Yli-Jyrä, Anssi & Koskenniemi, Kimmo (2007). A new method for compiling parallel replace rules. In Holub, Jan & Jan Žd’árek (eds.) Implementation and application of automata. Berlin & Heidelberg: Springer. 320321.
Type Description Title
PDF
Supplementary materials

Hulden supplementary material
Hulden supplementary material 1

 PDF (29 KB)
29 KB
UNKNOWN
Supplementary materials

Hulden supplementary material
Hulden supplementary material 2

 Unknown (8 KB)
8 KB

Formal and computational verification of phonological analyses*

  • Mans Hulden (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed