INTERSPEECH
2010
13 years 7 months ago
2010
This paper describes a new method for building compact context-dependency transducers for finite-state transducer-based ASR decoders. Instead of the conventional phonetic decision...
IJCM
2010
13 years 11 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
JUCS
2002
14 years 3 days ago
2002
: When the words of a language are communicated via a noisy channel, the language property of error-detection ensures that no word of the language can be transformed to another wor...
CSL
2002
Springer
14 years 7 days 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...
COLING
2002
14 years 7 days ago
2002
The objective of this work is to disambiguate transducers which have the following form: T = R D and to be able to apply the determinization algorithm described in (Mohri, 1997)....
EACL
1989
ACL Anthology
14 years 1 months ago
1989
ACL Anthology
Koskenniemi's model of two-level morphology has been very influential in recent years, but definitions of the formalism have generally been phrased in terms of a compilation ...
DGO
2003
14 years 1 months ago
2003
Business to Government (B2G) e-commerce has increased manifold the opportunities available for entrepreneurs for global trade. The entrepreneurs can deal with businesses around th...