Syntactic structures and code parameters

DOI10.1007/S11786-017-0298-0MaRDI QIDQ2364907zbMATH OpenOpenAlexFDO

Authors Kevin Shu, Matilde Marcolli

Publication date 25 July 2017

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.00311, https://authors.library.caltech.edu/78207/

zbMATH Keywords

asymptotic boundscode parameterserror-correcting codesnatural languagesspin Glass dynamicssyntactic parameters

Mathematics Subject Classification ID

Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30) Linguistics (91F20) Bounds on codes (94B65)

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.

Recommendations

• Syntactic codes and grammar refinement
• Error-correcting codes and phase transitions
• Coding strategies in language
• A revision of coding theory for learning from language
• Persistent topology of syntax

Cites work

• A computability challenge: asymptotic bounds for error-correcting codes
• Any code of which we cannot think is good
• Error-correcting codes and phase transitions
• scientific article; zbMATH DE number 3836211 (Why is no real title available?)
• Kolmogorov complexity and the asymptotic bound for error-correcting codes
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• Number of points of an algebraic curve
• Persistent topology of syntax
• Random codes: minimum distances and error exponents

Cited in

(8)

• Persistent topology of syntax
• Heat kernel analysis of syntactic structures
• Phylogenetics of Indo-European language families via an algebro-geometric analysis of their syntactic structures
• Syntax checking either way
• scientific article; zbMATH DE number 1872989 (Why is no real title available?)
• Dimensions of popcorn-like pyramid sets
• Syntactic structures and the general Markov models
• Topological analysis of syntactic structures

This page was built for publication: Syntactic structures and code parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364907)