Конечные автоматы
Related Papers
A Finite State Approach to German Verb Morphology
This paper presents a new, language independent model for analysis and generation of word forms based on Finite State Transducers (FSTs). It has been completely implemented on a PC and …...
MULTI-TAPE TWO-LEVEL MORPHOLOGY: A Case Study in Semitic Non-linear Morphology
This I)aper presents an implemented multi-tal)e two- level model capable of describing Semitie non-linear morphology. The computational fl'arnework behind the ettrrcnt work is motivated by [Kay 1987]; the fimnal- ism …...
Incremental Identification of Inflectional Types
We present an approach to the incremental ac- crual of lexical information for unknown words that is constraint-based and compatible with standard unification-based grammars. Although the tech- niques are language-independent …...
From Machine Translation to Computer Assisted Translation using Finite-State Models
State-of-the-art machine translation techniques are still far from producing high quality translations. This drawback leads us to introduce an alterna- tive approach to the translation problem that brings human expertise …...
Efficient statistical machine translation with constrained reordering
. This paper describes how word alignment information makes machine translation more effi- cient. Following a statistical approach based on finite-state transducers, we perform reordering of source sentences in training …...
A comparison of linguistically and statistically enhanced models for speech-to-speech machine translation
AbstractThe goal of this work is to improve current translation models by taking into account additional knowledge sources such as semantically motivated segmentation or statistical categorization. Specifically, two different approaches …...
A finite-state framework for log-linear models in machine translation
. Log-linear models represent nowadays the state-of-the-art in statistical machine translation. There, several models are combined al- together into a whole statistical approach. Finite-state transducers cons- titute a special type …...
Hindi Urdu Machine Transliteration using Finite-State Transducers
Finite-state Transducers (FST) can be very efficient to implement inter-dialectal transliteration. We illustrate this on the Hindi and Urdu language pair. FSTs can also be used for translation between sur- …...
Towards Optimal TTS Corpora
AbstractUnit selection text-to-speech systems currently produce very natural synthesized phrases by concatenating speech segments from a large database. Recently, increasing demand for designing high quality voices with less data has …...
A Framework for Translating SMS Messages
Short Messaging Service (SMS) has become a popular form of communication. While it is predominantly used for monolingual communication, it can be extremely useful for facilitating cross-lingual communication through statistical …...
Minimally Supervised Number Normalization
AbstractWe propose two models for verbalizing numbers, a key component in speech recognition and synthesis systems. The first model uses an end-to-end recurrent neural network. The second model, drawing inspiration …...