1932
0
  1. Home
  2. A-Z Publications
  3. Annual Review of Linguistics
  4. Volume 5, 2019
  5. Article

Annual Review of Linguistics

Volume 5, 2019

Three Mathematical Foundations for Syntax

Abstract

Three different foundational ideas can be identified in recent syntactic theory: structure from substitution classes, structure from dependencies among heads, and structure as the result of optimizing preferences. As formulated in this review, it is easy to see that these three ideas are completely independent. Each has a different mathematical foundation, each suggests a different natural connection to meaning, and each implies something different about how language acquisition could work. Since they are all well supported by the evidence, these three ideas are found in various mixtures in the prominent syntactic traditions. From this perspective, if syntax springs fundamentally from a single basic human ability, it is an ability that exploits a coincidence of a number of very different things.

Keyword(s): constituency, dependency, mathematical foundations, Optimality Theory, syntax
Loading

Article metrics loading...

/content/journals/10.1146/annurev-linguistics-011415-040658
2019-01-14
2024-04-16
Loading full text...

Full text loading...

/deliver/fulltext/linguistics/5/1/annurev-linguistics-011415-040658.html?itemId=/content/journals/10.1146/annurev-linguistics-011415-040658&mimeType=html&fmt=ahah

Literature Cited

  1. Abels K 2007. Towards a restrictive theory of (remnant) movement: improper movement, remnant movement, and a linear asymmetry. Linguist. Var. Yearb. 7:53–120
     [Google Scholar]
  2. Abels K, Neeleman A 2006. Universal 20 without the LCA Work. pap. Univ. Coll. London UK:
  3. Adger D 2003. Core Syntax: A Minimalist Approach Oxford, UK: Oxford Univ. Press
  4. Baker MC 1985. The mirror principle and morphosyntactic explanation. Linguist. Inq. 16:373–416
     [Google Scholar]
  5. Boeckx C 2008. Bare Syntax New York: Oxford Univ. Press
  6. Boeckx C 2012. Syntactic Islands New York: Cambridge Univ. Press
  7. Boston MF, Hale JT, Kuhlmann M 2010. Dependency structures derived from Minimalist grammars. Mathematics of Language 10/11 C Ebert, G Jäger, J Michaelis1–12 Lect. Notes Comput. Sci. 6149 Berlin: Springer
     [Google Scholar]
  8. Bresnan J 1997. The emergence of the unmarked pronoun: Chicheŵa pronominals in Optimality Theory. Proceedings of the 23rd Annual Meeting of the Berkeley Linguistics Society: Special Session on Syntax and Semantics in Africa26–46 Berkeley, CA: Berkeley Linguist. Soc.
     [Google Scholar]
  9. Bresnan J, Asudeh A, Toivonen I, Wechsler S 2015. Lexical–Functional Syntax Oxford, UK: Wiley-Blackwell, 2nd ed..
  10. Brody M 1998. Projection and phrase structure. Linguist. Inq. 29:367–98
     [Google Scholar]
  11. Cho PW, Goldrick M, Lewis RL, Smolensky P 2018. Dynamic encoding of structural uncertainty in gradient symbols. Proceedings of the 8th Workshop on Cognitive Modeling and Computational Linguistics (CMCL)19–28 Stroudsburg, PA: Assoc. Comput. Linguist.
     [Google Scholar]
  12. Chomsky N 1953. Systems of syntactic analysis. J. Symb. Log. 18:242–56
     [Google Scholar]
  13. Chomsky N 1959. Review of Joseph H. Greenberg, Essays in Linguistics. Word 15:202–18
     [Google Scholar]
  14. Chomsky N 1970. Remarks on nominalization. Readings in English Transformational Grammar RA Jacobs, PS Rosenbaum184–221 Boston: Ginn
     [Google Scholar]
  15. Chomsky N 1986. Barriers Cambridge, MA: MIT Press
  16. Chomsky N 1995. The Minimalist Program Cambridge, MA: MIT Press
  17. Chomsky N 2006. Language and Mind New York: Cambridge Univ. Press. 3rd ed.
  18. Cinque G 1990. Types of A′ Dependencies Cambridge, MA: MIT Press
  19. Cinque G 2005. Deriving Greenberg's Universal 20 and its exceptions. Linguist. Inq. 36:315–32
     [Google Scholar]
  20. Clark A 2015. The syntactic concept lattice: another algebraic theory of the context-free languages?. J. Log. Comput. 25:1203–29
     [Google Scholar]
  21. Clark A 2017. Computational learning of syntax. Annu. Rev. Linguist. 3:107–23
     [Google Scholar]
  22. Clark A, Yoshinaka R 2014. An algebraic approach to multiple context-free grammars. Proceedings of the International Conference on Logical Aspects of Computational Linguistics57–69 Berlin: Springer
     [Google Scholar]
  23. Collins C 2005. A smuggling approach to passive in English. Syntax 8:81–120
     [Google Scholar]
  24. Costa J 2001. The emergence of unmarked word order. Optimality-Theoretic Syntax G Legendre, JB Grimshaw, S Vikner171–204 Cambridge, MA: MIT Press
     [Google Scholar]
  25. Dozat T, Manning CD 2017. Deep biaffine attention for neural dependency parsing Paper presented at the 5th International Conference on Learning Representations, Toulon, Fr., April 24–26
  26. Engelfriet J, Lilin E, Maletti A 2009. Composition and decomposition of extended multi bottom-up tree transducers. Acta Inf. 46:561–90
     [Google Scholar]
  27. Enguehard É, Flemming E, Magri G 2018. Statistical learning theory and linguistic typology: a learnability perspective on OT's strict domination. Proceedings of the Society for Computation in Linguistics (SCiL 2018)1–11 Stroudsburg, PA: Assoc. Comput. Linguist.
     [Google Scholar]
  28. Frank R, Satta G 1998. Optimality theory and the generative complexity of constraint violability. Comput. Linguist. 24:307–15
     [Google Scholar]
  29. Frege G 1977 (1918). Thoughts. Gottlob Frege: Logical Investigations transl. PT Geach, RH Stoothof New Haven, CT: Yale Univ. Press
     [Google Scholar]
  30. Graf T 2013. Local and transderivational constraints in syntax and semantics PhD thesis Univ. Calif. Los Angel.:
  31. Graf T, Heinz J 2015. Commonality in disparity: the computational view of syntax and phonology Slides presented at the 38th Generative Linguistics in the Old Word Colloqium (GLOW 38), Paris, April 15–18
  32. Hao Y 2017. Harmonic Serialism and finite-state Optimality Theory. Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing20–29 Stroudsburg, PA: Assoc. Comput. Linguist.
     [Google Scholar]
  33. Harkema H 2001. A characterization of minimalist languages. Proceedings of the International Conference on Logical Aspects of Computational Linguistics193–211 Berlin: Springer
     [Google Scholar]
  34. Harris ZS 1951. Methods in Structural Linguistics Chicago: Chicago Univ. Press
  35. Hein J 2018. Verbal fronting: typology and theory PhD thesis Univ. Leipzig Leipzig, Ger.:
  36. Hiraiwa K 2005. Dimensions of symmetry in syntax: agreement and clausal architecture PhD thesis MIT Cambridge, MA:
  37. Hopcroft JE, Ullman JD 1969. Formal Languages and Their Relation to Automata Reading, MA: Addison-Wesley
  38. Jäger G, Rogers J 2012. Formal language theory: refining the Chomsky hierarchy. Philos. Trans. R. Soc. B 367:1956–70
     [Google Scholar]
  39. Johnson M 1988. Attribute Value Logic and The Theory of Grammar Stanford, CA: Cent. Study Lang. Inf.
  40. Joshi AK 1985. How much context-sensitivity is necessary for characterizing structural descriptions. Natural Language Processing: Theoretical, Computational and Psychological Perspectives D Dowty, L Karttunen, A Zwicky206–50 New York: Cambridge Univ. Press
     [Google Scholar]
  41. Joshi AK, Schabes Y 1997. Tree-adjoining grammars. Handbook of Formal Languages, vol. 3: Beyond Words G Rozenberg, A Salomaa69–124 Berlin: Springer
     [Google Scholar]
  42. Kallmeyer L 2010. Parsing Beyond Context-Free Grammars Berlin: Springer
  43. Kanazawa M, Michaelis J, Salvati S, Yoshinaka R 2011. Well-nestedness properly subsumes strict derivational minimalism. Proceedings of the International Conference on Logical Aspects of Computational Linguistics112–28 Berlin: Springer
     [Google Scholar]
  44. Kaplan R, Kay M 1994. Regular models of phonological rule systems. Comput. Linguist. 20:331–78
     [Google Scholar]
  45. Kayne RS 1994. The Antisymmetry of Syntax Cambridge, MA: MIT Press
  46. Keenan EL, Stabler EP 2010. Language variation and linguistic invariants. Lingua 120:2680–85
     [Google Scholar]
  47. Kiperwasser E, Goldberg Y 2016. Simple and accurate dependency parsing using bidirectional LSTM feature representations. Trans. Assoc. Comput. Linguist. 4:313–27
     [Google Scholar]
  48. Klein D, Manning CD 2002. A generative constituent-context model for improved grammar induction. Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics128–35 Stroudsburg, PA: Assoc. Comput. Linguist.
     [Google Scholar]
  49. Klein D, Manning CD 2005. Corpus-based induction of syntactic structure: models of dependency and constituency. Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics478–85 Stroudsburg, PA: Assoc. Comput. Linguist.
     [Google Scholar]
  50. Kobele GM 2006. Generating copies: an investigation into structural identity in language and grammar PhD thesis Univ. Calif. Los Angel.:
  51. Kobele GM, Retoré C, Salvati S 2007. An automata-theoretic approach to minimalism. Proceedings of the 2007 European Summer School on Logic, Language and Information (ESSLLI 2007): Model Theoretic Syntax at 10 71–80 Stroudsburg, PA: Assoc. Comput. Linguist.
     [Google Scholar]
  52. Koopman H 1984. The Syntax of Verbs: From Verb Movement Rules in the Kru Languages to Universal Grammar Dordrecht, Neth.: Foris
  53. Koopman H 2005. On the parallelism of DPs and clauses in Kisongo Maasai. Verb First A Carnie, S Dooley, H Harley281–301 Philadelphia: Benjamins
     [Google Scholar]
  54. Koopman H, Szabolcsi A 2000. Verbal Complexes Cambridge, MA: MIT Press
  55. Kozen D 1992. On the Myhill–Nerode theorem for trees. Bull. Eur. Assoc. Theor. Comput. Sci. 47:254–66
     [Google Scholar]
  56. Kracht M 2007.a Compositionality: the very idea. Res. Lang. Comput. 5:287–308
     [Google Scholar]
  57. Kracht M 2007.b The emergence of syntactic structure. Linguist. Philos. 30:47–95
     [Google Scholar]
  58. Kuhlmann M 2013. Mildly non-projective dependency grammar. Comput. Linguist. 39:355–87
     [Google Scholar]
  59. Kuhlmann M, Koller A, Satta G 2015. Lexicalization and generative power in CCG. Comput. Linguist. 41:215–47
     [Google Scholar]
  60. Kuhlmann M, Satta G 2009. Treebank grammar techniques for non-projective dependency parsing. Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics478–86 Stroudsburg, PA: Assoc. Comput. Linguist.
     [Google Scholar]
  61. Kuhlmann M, Satta G, Jonsson P 2017. On the complexity of CCG parsing. arXiv:1702.06594 [cs]
  62. Manaster-Ramer A 1983. The soft formal underbelly of theoretical syntax. Papers from the 19th Regional Meeting of the Chicago Linguistics Society256–62 Chicago: Chicago Linguist. Soc.
     [Google Scholar]
  63. McDonald R, Pereira F, Ribarov K, Hajič J 2005. Non-projective dependency parsing using spanning tree algorithms. Proceedings of the 2005 Conference on Human Language Technology and Empirical Methods in Natural Language Processing (HLT 05)523–30 Stroudsburg, PA: Assoc. Comput. Linguist.
     [Google Scholar]
  64. Merchant J, Frazier L, Clifton C, Weskott T 2013. Fragment answers to questions: a case of inaudible syntax. Brevity L Goldstein21–35 New York: Oxford Univ. Press
     [Google Scholar]
  65. Michaelis J 2001. Transforming linear context free rewriting systems into Minimalist grammars. Proceedings of the International Conference on Logical Aspects of Computational Linguistics228–44 Berlin: Springer
     [Google Scholar]
  66. Mönnich U 1998. TAGs M-constructed. Proceedings of the 4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4)108–11 Philadelphia: Inst. Res. Cogn. Sci.
     [Google Scholar]
  67. Moortgat M 2010. Typelogical grammar. Stanford Encyclopedia of Philosophy EN Zalta Stanford, CA: Stanford Univ. Winter ed. https://plato.stanford.edu/entries/typelogical-grammar/
    [Google Scholar]
  68. Morawietz F 2001. Two-step approaches to natural language formalisms PhD thesis Univ. Tübingen Tübingen, Ger.:
  69. Morrill G, Valentín O 2010. Displacement calculus. Linguist. Anal. 36:167–92
     [Google Scholar]
  70. Müller G 2001. Order preservation, parallel movement, and the emergence of the unmarked. Optimality-Theoretic Syntax G Legendre, JB Grimshaw, S Vikner279–313 Cambridge, MA: MIT Press
     [Google Scholar]
  71. Myler N 2017. Exceptions to the mirror principle and morphophonological action at a distance. The Structure of Words at the Interfaces H Newell, M Noonan, G Piggott, L Travis100–25 Oxford, UK: Oxford Univ. Press
     [Google Scholar]
  72. Pan VJ 2015. Mandarin peripheral construals at the syntax–discourse interface. Linguist. Rev. 32:819–68
     [Google Scholar]
  73. Pate JK, Johnson M 2016. Grammar induction from (lots of) words alone. Proceedings of the 26th International Conference on Computational Linguistics (COLING2016)23–32 Stroudsburg, PA: Assoc. Comput. Linguist.
     [Google Scholar]
  74. Pesetsky D 2000. Phrasal Movement and Its Kin Cambridge, MA: MIT Press
  75. Pollard C 1984. Generalized phrase structure grammars, head grammars and natural language PhD thesis Stanford Univ. Stanford, CA:
  76. Prince A, Smolensky P 2004. Optimality Theory: Constraint Interaction in Generative Grammar Malden, MA: Blackwell
  77. Pullum GK, Rawlins K 2007. Argument or no argument?. Linguist. Philos. 30:277–87
     [Google Scholar]
  78. Radford A 2009. An Introduction to English Sentence Structure Cambridge, UK: Cambridge Univ. Press
  79. Rizzi L 1978. Violations of the wh-island constraint in Italian and the subjacency condition. Montreal Work. Pap. Linguist. 11:155–90
     [Google Scholar]
  80. Rizzi L 1997. The fine structure of the left periphery. Elements of Grammar L Haegeman281–337 Boston: Kluwer
     [Google Scholar]
  81. Ross JR 1967. Constraints on variables in syntax PhD thesis MIT Cambridge, MA:
  82. Sag I, Wasow T, Bender E 2003. Syntactic Theory: A Formal Introduction Stanford, CA: Cent. Study Lang. Inf. 2nd ed.
  83. Sakarovitch J 2009. Elements of Automata Theory New York: Cambridge Univ. Press
  84. Salomaa A 1973. Formal Languages New York: Academic
  85. Salvati S 2015. Mix is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchies. J. Comput. Syst. Sci. 81:1252–77
     [Google Scholar]
  86. Sauerland U 1999. Erasability and scrambling. Syntax 2:161–88
     [Google Scholar]
  87. Seki H, Matsumura T, Fujii M, Kasami T 1991. On multiple context-free grammars. Theor. Comput. Sci. 88:191–229
     [Google Scholar]
  88. Shieber SM 1985. Evidence against the context-freeness of natural language. Linguist. Philos. 8:333–44
     [Google Scholar]
  89. Smolensky P 1986. Information processing in dynamical systems: foundations of harmony theory. Parallel Distributed Processing: Explorations in the Microstructure of Cognition, vol. 1: Foundations DE Rumelhart, JL McClelland194–281 Cambridge, MA: MIT Press
     [Google Scholar]
  90. Smolensky P, Goldrick M, Mathis D 2014. Optimization and quantization in gradient symbol systems: a framework for integrating the continuous and the discrete in cognition. Cogn. Sci. 38:1102–38
     [Google Scholar]
  91. Spitkovsky VI, Alshawi H, Jurafsky D 2013. Grammar induction and parsing with dependency-and-boundary models PhD thesis Stanford Univ. Stanford, CA:
  92. Sportiche D, Koopman H, Stabler E 2014. An Introduction to Syntactic Analysis and Theory Oxford, UK: Blackwell
  93. Stabler EP 1997. Derivational minimalism. Proceedings of the International Conference on Logical Aspects of Computational Linguistics68–95 Berlin: Springer
  94. Stabler EP 2010. Computational perspectives on minimalism. Oxford Handbook of Minimalism C Boeckx617–41 Oxford, UK: Oxford Univ. Press
     [Google Scholar]
  95. Stabler EP 2013. Two models of minimalist, incremental syntactic analysis. Top. Cogn. Sci. 5:611–33
     [Google Scholar]
  96. Starke M 2001. Move dissolves into merge: a theory of locality PhD thesis Univ. Geneva Geneva, Switz.:
  97. Steedman MJ 2014. Categorial grammar. Routledge Handbook of Syntax A Carnie, Y Sato, D Siddiqi670–701 New York: Routledge
     [Google Scholar]
  98. Tesar B, Smolensky P 2000. Learnability in Optimality Theory Cambridge, MA: MIT Press
  99. Thatcher JW 1967. Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J. Comput. Syst. Sci. 1:317–22
     [Google Scholar]
  100. Torenvliet L, Trautwein M 1995. A note on the complexity of restricted attribute-value grammars. Proceedings of Computational Linguistics in the Netherlands (CLIN5)145–64 Twente, Neth.: Dep. Comput Sci., Univ. Twente
     [Google Scholar]
  101. Vogel R 2004. Correspondence in OT syntax and minimal link effects. Minimality Effects in Syntax A Stepanov, G Fanselow, R Vogel401–41 Berlin: Mouton de Gruyter
     [Google Scholar]
  102. Weir A 2014. Fragments and clausal ellipsis PhD thesis Univ. Mass. Amherst:
  103. Westerståhl D 2004. On the compositional extension problem. J. Philos. Log. 33:549–82
     [Google Scholar]
  104. Wijnholds GJ 2014. Conversions between D and MCFG: logical characterizations of the mildly context-sensitive languages. Comput. Linguist. Neth. J. 4:137–48
     [Google Scholar]
  105. Williams A, Drozdov A, Bowman SR 2018. Do latent tree learning models identify meaningful structure in sentences?. Trans. Assoc. Comput. Linguist. 6:253–67
     [Google Scholar]
  106. Zadrozny W 1994. From compositional to systematic semantics. Linguist. Philos. 17:329–42
     [Google Scholar]
  107. Zipf GK 1949. Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology Boston: Houghton, Mifflin
/content/journals/10.1146/annurev-linguistics-011415-040658
Loading
  • Article Type: Review Article

Most Cited Most Cited RSS feed

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error