1136 search results - page 2 / 228 » Learning with Weighted Transducers |
CSL
2002
Springer
14 years 11 months ago
2002
Springer
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
100
click to vote
ACL
1996
15 years 29 days ago
1996
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
ACL
2007
15 years 1 months ago
2007
We propose a bootstrapping approach to training a memoriless stochastic transducer for the task of extracting transliterations from an English-Arabic bitext. The transducer learns...
125
click to vote
EMNLP
2009
14 years 9 months ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
This report defines various operations and describes algorithms for weighted multi-tape automata (WMTAs). It presents, among others, a new approach to multi-tape intersection, mea...