Skip to main content

Formal Parameters of Phonology

From Government Phonology to SPE

  • Conference paper
Interfaces: Explorations in Logic, Language and Computation (ESSLLI 2008, ESSLLI 2009)

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

  • 504 Accesses

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.

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

Access this chapter

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. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)

    Google Scholar 

  2. Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6, 66–92 (1960)

    Article  MATH  Google Scholar 

  3. Charette, M., Göksel, A.: Licensing constraints and vowel harmony in Turkic languages. SOAS Working Papers In Linguistics and Phonetics 6, 1–25 (1996)

    Google Scholar 

  4. Chomsky, N.: Lectures on Government and Binding: The Pisa Lectures. Foris, Dordrecht (1981)

    Google Scholar 

  5. Cohen, J.: On the expressive power of temporal logic for infinite words. Theoretical Computer Science 83, 301–312 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cohen, J., Perrin, D., Pin, J.E.: On the expressive power of temporal logic. Journal of Computer and System Sciences 46, 271–294 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. 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)

    Google Scholar 

  8. Frank, R., Satta, G.: Optimality theory and the generative complexity of constraint violability. Computational Linguistics 24, 307–315 (1998)

    MathSciNet  Google Scholar 

  9. Goldsmith, J.: Autosegmental Phonology. Ph.D. thesis, MIT (1976)

    Google Scholar 

  10. 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

  11. Graf, T.: Logics of Phonological Reasoning. Master’s thesis, University of California, Los Angeles (2010)

    Google Scholar 

  12. 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]

    Google Scholar 

  13. Harris, J., Lindsey, G.: The elements of phonological representation. In: Durand, J., Katamba, F. (eds.) Frontiers of Phonology, pp. 34–79. Longman, Harlow (1995)

    Google Scholar 

  14. Jensen, S.: Is? an element? Towards a non-segmental phonology. SOAS Working Papers In Linguistics and Phonetics 4, 71–78 (1994)

    Google Scholar 

  15. Johnson, C.D.: Formal Aspects of Phonological Description. The Hague, Mouton (1972)

    Google Scholar 

  16. 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)

    Google Scholar 

  17. Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)

    Google Scholar 

  18. Kaye, J.: Government in phonology: the case of Moroccan Arabic. The Linguistic Review 6, 131–159 (1990)

    Article  Google Scholar 

  19. Kaye, J.: Do you believe in magic? The story of s+C sequences. Working Papers in Linguistics and Phonetics 2, 293–313 (1992)

    Google Scholar 

  20. Kaye, J.: A user’s guide to government phonology (2000) (unpublished manuscript), http://134.59.31.7/~scheer/scan/Kaye00guideGP.pdf

  21. Kaye, J., Lowenstamm, J., Vergnaud, J.R.: Constituent structure and government in phonology. Phonology Yearbook 7, 193–231 (1990)

    Article  Google Scholar 

  22. Keenan, E.: Mathematical structures in language, ms. University of California, Los Angeles (2008)

    Google Scholar 

  23. Koskenniemi, K.: Two-level morphology: A general computational model for word-form recognition and production. Publication 11 (1983)

    Google Scholar 

  24. Kracht, M.: Syntactic codes and grammar refinement. Journal of Logic, Language and Information 4, 41–60 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  25. 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)

    Google Scholar 

  26. Leben, W.: Suprasegmental Phonology. Ph.D. thesis, MIT (1973)

    Google Scholar 

  27. 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)

    Chapter  Google Scholar 

  28. 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)

    Google Scholar 

  29. McNaughton, R., Pappert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)

    MATH  Google Scholar 

  30. Mitchell, T.F.: Prominence and syllabification in Arabic. Bulletin of the School of Oriental and African Studies 23(2), 369–389 (1960)

    Article  Google Scholar 

  31. 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)

    Google Scholar 

  32. Potts, C., Pullum, G.K.: Model theory and the content of OT constraints. Phonology 19(4), 361–393 (2002)

    Article  Google Scholar 

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

    Google Scholar 

  34. 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)

    Google Scholar 

  35. 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)

    Google Scholar 

  36. Rogers, J.: Strict LT2: Regular: Local: Recognizable. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 366–385. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  37. Russell, K.: A Constraint-Based Approach to Phonology. Ph.D. thesis, University of Southern California (1993)

    Google Scholar 

  38. Scheer, T.: A Lateral Theory of Phonology: What is CVCV and Why Should it be? Mouton de Gruyter, Berlin (2004)

    Google Scholar 

  39. Sturtevant, W.C. (ed.): A Creek Source Book. Garland, New York (1987)

    Google Scholar 

  40. 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)

    MATH  MathSciNet  Google Scholar 

  41. Thomas, W.: Star-free regular sets of ω-sequences. Information and Control 42, 148–156 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  42. Vaillette, N.: Logical specification of regular relations for NLP. Natural Language Engineering 9(1), 65–85 (2003)

    Article  Google Scholar 

  43. 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)

    Google Scholar 

  44. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics