SearchSkip to Search Results
- 2Computational linguistics
- 2Natural language processing
Algorithmic decipherment is a prime example of a truly unsupervised problem. This thesis presents several algorithms developed for the purpose of decrypting unknown alphabetic scripts representing unknown languages. We assume that symbols in scripts which contain no more than a few dozen unique...
Grapheme-to-phoneme conversion (G2P) is the task of converting a word, represented by a sequence of graphemes, to its pronunciation, represented by a sequence of phonemes. The G2P task plays a crucial role in speech synthesis systems, and is an important part of other applications, including...
Grapheme-to-phoneme conversion (G2P) and machine transliteration are important tasks in natural language processing. Supplemental data can often help resolve difficult ambiguities: existing transliterations of the same word can help choose among a G2P system’s candidate output transcriptions;...
Machine transliteration is important to machine translation and cross-lingual information retrieval. Previous works show that machine transliteration can benefit from supplemental phonetic transcriptions and transliterations from other languages through a re-ranking framework. In this thesis, I...