Syntactic Parameters and a Coding Theory Perspective on Entropy and Complexity of Language Families
We present a simple computational approach to assigning a measure of complexity and information/entropy to families of natural languages, based on syntactic parameters and the theory of error correcting codes. We associate to each language a binary string of syntactic parameters and to a language fa...
Main Author: | Matilde Marcolli |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2016-04-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/18/4/110 |
Similar Items
-
The Gilbert-Varshamov Bound for Stabilizer Codes Over <inline-formula> <tex-math notation="LaTeX">$\mathbb{Z}_m$ </tex-math></inline-formula>
by: Nianqi Tang, et al.
Published: (2018-01-01) -
Evaluating the Gilbert-Varshamov bound for constrained systems
by: Goyal, Keshav, et al.
Published: (2024) -
Asymmetric Entanglement-Assisted Quantum Error-Correcting Codes and BCH Codes
by: Carlos Galindo, et al.
Published: (2020-01-01) -
Improved Gilbert–Varshamov Bound for Entanglement-Assisted Asymmetric Quantum Error Correction by Symplectic Orthogonality
by: Ryutaroh Matsumoto
Published: (2020-01-01) -
Alphabet Size Matching Techniques Based on Non-Binary Gilbert-Varshamov Bounded Limits for Synchronization Finite State Markov Channel
by: Shamin Achari, et al.
Published: (2023-01-01)