Abstract

How to computationally describe the fascinating diversity of indigenous languages of the Americas? This work provides a large-scale and quantitative approach to these languages through the proposal of a novel measure of linguistic complexity based on co-occurrence graphs. Linguistic complexity is measured using the set of eigenvalues obtained from the Laplacian matrix of graphs. The results suggest first that our graph-based definition of linguistic complexity is positively correlated with previous approaches. Second, we were able to describe some structural differences between indigenous languages. We argue that our approach might suggest another application of graph-based techniques to the study of language.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.