Skip to main content
SpringerLink
Log in

Syntactic Structures and Code Parameters

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

We assign binary and ternary error-correcting codes to the data of syntactic structures of world languages and we study the distribution of code points in the space of code parameters. We show that, while most codes populate the lower region approximating a superposition of Thomae functions, there is a substantial presence of codes above the Gilbert–Varshamov bound and even above the asymptotic bound and the Plotkin bound. We investigate the dynamics induced on the space of code parameters by spin glass models of language change, and show that, in the presence of entailment relations between syntactic parameters the dynamics can sometimes improve the code. For large sets of languages and syntactic data, one can gain information on the spin glass dynamics from the induced dynamics in the space of code parameters.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baker, M.: The Atoms of Language. Basic Books, New York (2001)

    Google Scholar 

  2. Barg, A., Forney, G.D.: Random codes: minimum distances and error exponents. IEEE Trans. Inf. Theory 48(9), 2568–2573 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chomsky, N.: Lectures on Government and Binding. Foris Publications, Dordrecht (1982)

    Google Scholar 

  4. Chomsky, N., Lasnik, H.: The theory of Principles and Parameters, in “Syntax: An international handbook of contemporary research”, pp. 506–569, de Gruyter (1993)

  5. Coffey, J.T., Goodman, R.M.: Any code of which we cannot think is good. IEEE Trans. Inf. Theory 36(6), 1453–1461 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Longobardi, G., Guardiano, C.: Evidence for syntax as a signal of historical relatedness. Lingua 119, 1679–1706 (2009)

    Article  Google Scholar 

  7. Longobardi, G., Guardiano, C., Silvestri, G., Boattini, A., Ceolin, A.: Towards a syntactic phylogeny of modern Indo-European languages. J. Hist. Linguist. 3(1), 122–152 (2013)

    Article  Google Scholar 

  8. Manin, Y.I.: What is the maximum number ofpoints on a curve over \({\mathbb{F}}_2\)? J. Fac. Sci. Univ. Tokyo Sect. IA Math 2(83), 715–720 (1982)

    Google Scholar 

  9. Manin, Y.I.: A computability challenge: asymptotic bounds and isolated error-correcting codes, in “Computation, physics and beyond”, pp. 174–182, Lecture Notes in Comput. Sci., vol. 7160, Springer (2012)

  10. Manin, Y.I.: Complexity vs Energy: Theory of Computation and Theoretical Physics, arXiv:1302.6695 [cs.CC]

  11. Manin, Y.I., Marcolli, M.: Error-correcting codes and phase transitions. Math. Comput. Sci. 5, 133–170 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Manin, YuI, Marcolli, M.: Kolmogorov complexity and the asymptotic bound for error-correcting codes. J. Differ. Geom. 97, 91–108 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  13. Marcolli, M.: Syntactic parameters and a coding theory perspective on entropy and complexity of language families. Entropy 18(4), 110 (2016)

    Article  MathSciNet  Google Scholar 

  14. Park, J.J., Boettcher, R., Zhao, A., Mun, A., Yuh, K., Kumar, V., Marcolli, M.: Prevalence and recoverability of syntactic parameters in sparse distributed memories, arXiv:1510.06342 [cs.CL]

  15. Port, A., Gheorghita, I., Guth, D., Clark, J.M., Liang, C., Dasu, S., Marcolli, M.: Persistent Topology of Syntax, arXiv:1507.05134 [cs.CL]

  16. Ronen, S., Goncalves, B., Hu, K.Z., Vespignani, A., Pinker, S., Hidalgo, C.A.: Links that speak: the global language network and its association with global fame. Proc. Natl. Acad. Sci. 111(52), E5616–E5622 (2014)

    Article  Google Scholar 

  17. Siva, K., Tao, J., Marcolli, M.: Spin Glass Models of Syntax and Language Evolution, arXiv:1508.00504 [cs.CL]

  18. Tsfasman, M.A., Vladut, S.G.: Algebraic-geometric codes, Mathematics and its Applications (Soviet Series), vol. 58, Kluwer Academic Publishers (1991)

  19. Tsfasman, M.A., Vladut, S.G., Zink, T.: Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound. Math. Nachr. 109, 21–28 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  20. Vladut, S.G., Drinfeld, V.G.: The number of points of an algebraic curve. Funktsional. Anal. I Prilozhen. 17(1), 68–69 (1983)

    Article  MathSciNet  Google Scholar 

  21. SSWL Database of Syntactic Parameters: http://sswl.railsplayground.net/

Download references

Author information

Authors and Affiliations

  1. Division of Physics, Mathematics, and Astronomy, California Institute of Technology, 1200 E. California Blvd, Pasadena, CA, 91125, USA

    Kevin Shu & Matilde Marcolli

Authors
  1. Kevin Shu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matilde Marcolli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matilde Marcolli.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shu, K., Marcolli, M. Syntactic Structures and Code Parameters. Math.Comput.Sci. 11, 79–90 (2017). https://doi.org/10.1007/s11786-017-0298-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-017-0298-0

Keywords

Mathematics Subject Classification

Search

Navigation