Abstract

Demonstrates how a dynamic programing algorithm can be developed to segment unusually long written inscriptions from the Indus Valley Civilization. Explains the problem of segmentation, discusses the dynamic programing algorithm used, and includes tables which illustrate the segmentation of the inscriptions. (GEA)

Citation

Siromoney, G. & Huq, A. (1988). Segmentation of Indus Texts: A Dynamic Programming Approach. Computers and the Humanities, 22(1), 11-21. Retrieved August 7, 2024 from https://www.learntechlib.org/p/170374/.

This record was imported from ERIC on December 3, 2015. [Original Record]

ERIC is sponsored by the Institute of Education Sciences (IES) of the U.S. Department of Education.

Copyright for this record is held by the content creator. For more details see ERIC's copyright policy.

Keywords

• Ancient History
• Computer Oriented Programs
• Foreign Countries
• Language Research
• Program Descriptions
• Social Science Research
• Written Language