Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Finite-State Language Processing
Finite-State Language Processing
Word re-ordering and DP-based search in statistical machine translation
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Hi-index | 0.00 |
There is presented a technique of transcribing Lithuanian text into phonemes for speech recognition. Text-phoneme transformation has been made by formal rules and the dictionary. Formal rules were designed to set the relationship between segments of the text and units of formalized speech sounds - phonemes, dictionary - to correct transcription and specify stress mark and position. Proposed the automatic transcription technique was tested by comparing its results with manually obtained ones. The experiment has shown that less than 6% of transcribed words have not matched.