Finite-State Back-Transliteration for Marathi
In this paper, we describe the creation of an open-source, finite-state based system for back-transliteration of Latin text in the Indian language Marathi. We outline the advantages of our system and compare it to other existing systems, evaluate its recall, and evaluate the coverage of an open-sour...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2017-06-01
|
| Series: | Prague Bulletin of Mathematical Linguistics |
| Online Access: | https://doi.org/10.1515/pralin-2017-0030 |
| Summary: | In this paper, we describe the creation of an open-source, finite-state based system for back-transliteration of Latin text in the Indian language Marathi. We outline the advantages of our system and compare it to other existing systems, evaluate its recall, and evaluate the coverage of an open-source morphological analyser on our back-transliterated corpus. |
|---|---|
| ISSN: | 1804-0462 |