15 search results - page 3 / 3 » Machine Translation with Inferred Stochastic Finite-State Tr... |
COLING
2010
13 years 1 months ago
2010
We use robust and fast Finite-State Machines (FSMs) to solve scriptural translation problems. We describe a phonetico-morphotactic pivot UIT (universal intermediate transcription)...
PODS
2005
ACM
14 years 6 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
ACL
2010
13 years 4 months ago
2010
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
SIGIR
2003
ACM
13 years 11 months ago
2003
ACM
Translation of proper names is generally recognized as a significant problem in many multi-lingual text and speech processing applications. Even when large bilingual lexicons use...
AAAI
1997
13 years 7 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...