P03-1006 and Sproat , 1996 ) . Let be the weighted transducer obtained by compiling the rules
J14-4002 transduction path in multi-tape weighted transducers . For instance , by encoding
N10-1139 arbitrary rational kernel defined by a weighted transducer T. Let XT denote the regular
P04-1008 a Viterbi decoder applied to a weighted transducer . 3.1 Weighted Finite-State Transducers
N10-1139 Weighted automata can be defined as weighted transducers A with identical input and output
J14-4002 POS tagger and will result in a weighted transducer that maps from input words to
P04-1008 two transducers T1 and T2 is a weighted transducer denoted by T1 o T2 and defined
N10-1139 kernel that can be represented by weighted transducers , it is a rational kernel ( Cortes
P03-1006 1994 ) which can be compiled into weighted transducers . The utilities of the GRM Library
D15-1273 path . In general , consider T a weighted transducer and A it 's equivalent automaton
P04-1008 resulting of the composition of the weighted transducers given figure 2 ( a ) and ( b
N04-1005 the least cost path through a weighted transducer as shown below . stitution and
E06-1046 the least cost path through a weighted transducer as shown below . We first describe
P03-1006 al. , 1996 ) and projection of weighted transducers . It is also based on the transducer
N10-1023 composition with G to produce a weighted transducer Wscored . The shortest path in
N12-1027 consider nondeterministic and weighted transducers . Intuitively , a sensible XTOPR
N10-1139 after the slash separator . A weighted transducer has a set of initial states represented
N10-1139 tasks considered . 2 Preliminaries Weighted transducers are finite-state transducers
N10-1139 and output alphabets E , is a weighted transducer denoted by T1 o T2 when the semiring
P03-1006 applied left to right leads to the weighted transducer given by figure 6 . Our corpus
hide detail