A Markov model of the Indus script
Open Access
- 18 August 2009
- journal article
- research article
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 106 (33) , 13685-13690
Abstract
Although no historical information exists about the Indus civilization (flourishedca. 2600–1900 B.C.), archaeologists have uncovered about 3,800 short samples of a script that was used throughout the civilization. The script remains undeciphered, despite a large number of attempts and claimed decipherments over the past 80 years. Here, we propose the use of probabilistic models to analyze the structure of the Indus script. The goal is to reveal, through probabilistic analysis, syntactic patterns that could point the way to eventual decipherment. We illustrate the approach using a simple Markov chain model to capture sequential dependencies between signs in the Indus script. The trained model allows new sample texts to be generated, revealing recurring patterns of signs that could potentially form functional subunits of a possible underlying language. The model also provides a quantitative way of testing whether a particular string belongs to the putative language as captured by the Markov model. Application of this test to Indus seals found in Mesopotamia and other sites in West Asia reveals that the script may have been used to express different content in these regions. Finally, we show how missing, ambiguous, or unreadable signs on damaged objects can be filled in with most likely predictions from the model. Taken together, our results indicate that the Indus script exhibits rich synactic structure and the ability to represent diverse content. both of which are suggestive of a linguistic writing system rather than a nonlinguistic symbol system.Keywords
This publication has 9 references indexed in Scilit:
- Statistical Analysis of the Indus Script Using n-GramsPLOS ONE, 2010
- Entropic Evidence for Linguistic Structure in the Indus ScriptScience, 2009
- Graphical ModelsStatistical Science, 2004
- Improved backing-off for M-gram language modeling2002
- An empirical study of smoothing techniques for language modelingComputer Speech & Language, 1999
- Estimating the Entropy of DNA SequencesJournal of Theoretical Biology, 1997
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989
- The Collapse of the Indus-Script Thesis: The Myth of a Literate Harappan Civilization
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967