Abstract
Inspired by the model-theoretic approach to phonology deployed by Kracht [25] and Potts and Pullum [32], I develop an extendable modal logic for the investigation of phonological theories operating on (richly annotated) string structures. In contrast to previous research in this vein [17,31,37], I ultimately strive to study the entire class of such theories rather than merely one particular incarnation thereof. To this end, I first provide a formalization of classic Government Phonology in a restricted variant of temporal logic, whose generative capacity is then subsequently increased by the addition of further operators, thereby pushing it up the subregular hierarchy until one reaches the level of the regular stringsets. I identify several other axes along which Government Phonology might be generalized, moving us towards a parametric metatheory of phonology.
This paper has benefited tremendously from the comments and suggestions of Bruce Hayes, Ed Keenan, Marcus Kracht, Ed Stabler, Kie Zuraw, the members of the UCLA phonology seminar (winter quarter 2009), and two anonymous reviewers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)
Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6, 66–92 (1960)
Charette, M., Göksel, A.: Licensing constraints and vowel harmony in Turkic languages. SOAS Working Papers In Linguistics and Phonetics 6, 1–25 (1996)
Chomsky, N.: Lectures on Government and Binding: The Pisa Lectures. Foris, Dordrecht (1981)
Cohen, J.: On the expressive power of temporal logic for infinite words. Theoretical Computer Science 83, 301–312 (1991)
Cohen, J., Perrin, D., Pin, J.E.: On the expressive power of temporal logic. Journal of Computer and System Sciences 46, 271–294 (1993)
Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. In: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pp. 228–235 (1997)
Frank, R., Satta, G.: Optimality theory and the generative complexity of constraint violability. Computational Linguistics 24, 307–315 (1998)
Goldsmith, J.: Autosegmental Phonology. Ph.D. thesis, MIT (1976)
Graf, T.: Comparing incomparable frameworks: A model theoretic approach to phonology. In: University of Pennsylvania Working Papers in Linguistics, Article 10, vol. 16 (2010), http://repository.upenn.edu/pwpl/vol16/iss1/10
Graf, T.: Logics of Phonological Reasoning. Master’s thesis, University of California, Los Angeles (2010)
Haas, M.R.: Tonal accent in Creek. In: Hyman, L.M. (ed.) Southern California Occasional Papers in Linguistics, vol. 4, pp. 195–208. University of Southern California, Los Angeles (1977), reprinted in [39]
Harris, J., Lindsey, G.: The elements of phonological representation. In: Durand, J., Katamba, F. (eds.) Frontiers of Phonology, pp. 34–79. Longman, Harlow (1995)
Jensen, S.: Is? an element? Towards a non-segmental phonology. SOAS Working Papers In Linguistics and Phonetics 4, 71–78 (1994)
Johnson, C.D.: Formal Aspects of Phonological Description. The Hague, Mouton (1972)
Jäger, G.: Gradient constraints in finite state OT: The unidirectional and the bidirectional case. In: Kaufmann, I., Stiebels, B. (eds.) More than Words. A Festschrift for Dieter Wunderlich, pp. 299–325. Akademie Verlag, Berlin (2002)
Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)
Kaye, J.: Government in phonology: the case of Moroccan Arabic. The Linguistic Review 6, 131–159 (1990)
Kaye, J.: Do you believe in magic? The story of s+C sequences. Working Papers in Linguistics and Phonetics 2, 293–313 (1992)
Kaye, J.: A user’s guide to government phonology (2000) (unpublished manuscript), http://134.59.31.7/~scheer/scan/Kaye00guideGP.pdf
Kaye, J., Lowenstamm, J., Vergnaud, J.R.: Constituent structure and government in phonology. Phonology Yearbook 7, 193–231 (1990)
Keenan, E.: Mathematical structures in language, ms. University of California, Los Angeles (2008)
Koskenniemi, K.: Two-level morphology: A general computational model for word-form recognition and production. Publication 11 (1983)
Kracht, M.: Syntactic codes and grammar refinement. Journal of Logic, Language and Information 4, 41–60 (1995)
Kracht, M.: Features in phonological theory. In: Löwe, B., Malzkorn, W., Räsch, T. (eds.) Foundations of the Formal Sciences II, Applications of Mathematical Logic in Philosophy and Linguistics. Trends in Logic, vol. 17, pp. 123–149. Kluwer, Dordrecht (2003); papers of a conference held in Bonn (November 11–13, 2000)
Leben, W.: Suprasegmental Phonology. Ph.D. thesis, MIT (1973)
Leucker, M., Sánchez, C.: Regular linear temporal logic. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 291–305. Springer, Heidelberg (2007)
Lowenstamm, J.: CV as the only syllable type. In: Durand, J., Laks, B. (eds.) Current Trends in Phonology: Models and Methods, pp. 419–421. European Studies Research Institute, University of Salford (1996)
McNaughton, R., Pappert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
Mitchell, T.F.: Prominence and syllabification in Arabic. Bulletin of the School of Oriental and African Studies 23(2), 369–389 (1960)
Mohri, M., Sproat, R.: An efficient compiler for weighted rewrite rules. In: 34th Annual Meeting of the Association for Computational Linguistics, pp. 231–238 (1996)
Potts, C., Pullum, G.K.: Model theory and the content of OT constraints. Phonology 19(4), 361–393 (2002)
Prince, A., Smolensky, P.: Optimality Theory: Constraint Interaction in Generative Grammar. Blackwell, Oxford (2004)
Pullum, G.K.: The evolution of model-theoretic frameworks in linguistics. In: Rogers, J., Kepser, S. (eds.) Model-Theoretic Syntax @ 10, pp. 1–10 (2007)
Rogers, J.: A model-theoretic framework for theories of syntax. In: Proceedings of the 34th Annual Meeting of the ACL, Santa Cruz, USA, pp. 10–16 (1996)
Rogers, J.: Strict LT2: Regular: Local: Recognizable. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 366–385. Springer, Heidelberg (1997)
Russell, K.: A Constraint-Based Approach to Phonology. Ph.D. thesis, University of Southern California (1993)
Scheer, T.: A Lateral Theory of Phonology: What is CVCV and Why Should it be? Mouton de Gruyter, Berlin (2004)
Sturtevant, W.C. (ed.): A Creek Source Book. Garland, New York (1987)
Thatcher, J.W.: Characterizing derivation trees for context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences 1, 317–322 (1967)
Thomas, W.: Star-free regular sets of ω-sequences. Information and Control 42, 148–156 (1979)
Vaillette, N.: Logical specification of regular relations for NLP. Natural Language Engineering 9(1), 65–85 (2003)
Vardi, M.Y.: A temporal fixpoint calculus. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 250–259 (1988)
Weil, P.: Algebraic recognizability of languages. In: Fiala, J., Koubek, V., KratochvÃl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 149–175. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graf, T. (2010). Formal Parameters of Phonology. In: Icard, T., Muskens, R. (eds) Interfaces: Explorations in Logic, Language and Computation. ESSLLI ESSLLI 2008 2009. Lecture Notes in Computer Science(), vol 6211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14729-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-14729-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14728-9
Online ISBN: 978-3-642-14729-6
eBook Packages: Computer ScienceComputer Science (R0)