60 search results - page 3 / 12 » Disambiguation of Finite-State Transducers |
ACL
2010
13 years 5 months ago
2010
In this paper, we propose a novel method for automatic segmentation of a Sanskrit string into different words. The input for our segmentizer is a Sanskrit string either encoded as...
TASLP
2010
13 years 2 months ago
2010
We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recogn...
COLING
2000
13 years 8 months ago
2000
A deterministic finite state transducer is a fast device for analyzing strings. It takes O(n) time to analyze a string of length n. In this paper, an application of this technique...
EACL
2009
ACL Anthology
2009
ACL Anthology
Semitic Morphological Analysis and Generation Using Finite State Transducers with Feature Structures
14 years 8 months ago
This paper presents an application of finite state transducers weighted with feature structure descriptions, following Amtrup (2003), to the morphology of the Semitic language Tig...
EUROGP
2003
Springer
14 years 20 days ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...