weighted finite state transducers
Hierarchical Phrase Based Translation with Weighted Finite State Transducers
... Hierarchical phrase-based translation generates translation hypotheses via the application of hierar- chical rules in CYK parsing (Chiang, 2005). Cube pruning is used to apply language models at each cell of the CYK grid ...
9
Hidden semi-Markov Model based earthquake classification system using Weighted Finite-State Transducers
... HMM state transi- ...contrast, Weighted Finite-State Transducers (WF- STs) unfold the complete HSMM structure, where each un- folded path is modeled individually at the expense of ...
9
Intrasentential Grammatical Correction with Weighted Finite State Transducers.
... each state to the final state in the log ...each state. Summing the arc between state i and j, α of state i, and β of state j, we obtain our expected value for a particular ...
113
Hierarchical Phrase Based Translation with Weighted Finite State Transducers and Shallow n Grammars
... lowing the manner in which Knight and Al-Onaizan (1998), Kumar, Deng, and Byrne (2006), and Graehl, Knight, and May (2008) elucidate other machine translation models, we can use WFST operations to make the operations of ...
30
Transliterated Mobile Keyboard Input via Weighted Finite State Transducers
... The usefulness of weighted finite-state transduc- ers (WFSTs) has been well-documented for speech recognition decoding. Large component WFSTs representing a context-dependent phone sequence model ( C ), the ...
10
Lattice Based Minimum Error Rate Training Using Weighted Finite State Transducers with Tropical Polynomial Weights
... MERT uses a line optimisation procedure (Press et al., 2002) to identify a range of points along a line in parameter space that maximise an objective func- tion based on the BLEU score. A key property of the line ...
10
Compilation of Weighted Finite State Transducers from Decision Trees
... In particular, once compiled into a WFST, a tree can be used in the same way as a W F S T derived from any other source, such as a lexicon or a language model; a compiled WFST can be use[r] ...
8
Composing Finite State Transducers on GPUs
... Weighted finite state transducers (FSTs) are frequently used in language process- ing to handle tasks such as part-of-speech tagging and speech ...accelerate finite state ...
9
An Efficient Compiler for Weighted Rewrite Rules
... Weighted rewrite rules can be compiled into weighted finite-state transducers, namely transducers generalized by providing transitions with a weighted output, under the same context cond[r] ...
8
Bayesian Inference for Finite State Transducers
... appropriate weighted coin flip? Finally, would such a sampler be reversible? In order to satisfy theoretical conditions for Gibbs sampling, if we move from sample A to sample B, we must be able to immediately get ...
9
Decoding with Finite State Transducers on GPUs
... Weighted finite automata and transduc- ers (including hidden Markov models and conditional random fields) are widely used in natural language processing (NLP) to perform tasks such as morphological anal- ...
9
Parameter Estimation for Probabilistic Finite State Transducers
... a weighted regular relation, then the following statements are equivalent: (1) f is a joint probabilistic relation; (2) f can be computed by a Markovian FST that halts with probability 1; (3) f can be expressed as ...
8
Automatic Sanskrit Segmentizer Using Finite State Transducers
... Sanskrit words are mostly analyzed by build- ing a finite state transducer (Beesley, 1998). In the first approach, this transducer was modified by linking the final states to appropriate interme- diate ...
6
Finite State Transducers in Language and Speech Processing
... We give a specific study of string-to-weight transducers, including algorithms for determinizing and minimizing these transducers very efficiently, and characterizations of the transduce[r] ...
44
Quantifier free least fixed point functions for phonology
... In this paper we define quantifier-free least fixed point functions (QFLFP) and argue that they are an appropriate and valuable ap- proach to modeling phonological processes (construed as input-output maps). These func- ...
13
Urdu Roman Transliteration via Finite State Transducers
... the finite state transducer should also be able to deal with unknown items; thus, the con- straints on transliteration should not be too restric- tive, but should allow for a default transliteration as ...a ...
5
Locating Noun Phrases with Finite State Transducers
... X referred to in the corpus; what have been his different occupations through out the period over which our corpus extends?' In the first case, non trivial occurrences of noun phrases ar[r] ...
8
Finite State Transducers Approximating Hidden Markov Models
... We then build the union uS i of all initial subsequences Si and the union uS~n of all extended middle subsequences S,e=, and formulate a preliminary sentence model: uS ° = ~S, uS°~* 14 i[r] ...
8
Two Parsing Algorithms by Means of Finite State Transducers
... Two Parsing Algorithms by Means of Finite State Transducers T w o P a r s i n g A l g o r i t h m s by M e a n s of F i n i t e S t a t e T r a n s d u c e r s E m m a i m e l R e c h e * M i t s u b[.] ...
5
Parallel Intersection and Serial Composition of Finite State Transducers
... Parallel Intersection and Serial Composition of Finite State Transducers P a r a l l e l I n t e r s e c t i o n a n d S e r i a l C o m p o s i t i o n o f F i n i t e S t a t e T r a n s d u c e r s[.] ...
5