This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 5Transliteration
- 2Computational linguistics
- 2NLP
- 2Natural Language Processing
- 2Natural language processing
- 1Alignments
-
Spring 2016
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...
-
Fall 2019
The conversion of romanized texts back to the native scripts is a challenging task because of the inconsistent romanization conventions and non-standard language use. This problem is compounded by code-mixing, i.e., using words from more than one language within the same discourse. Considering...
-
Spring 2011
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...
-
Fall 2011
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;...
-
Fall 2014
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...