Sciweavers

8 search results - page 1 / 2
» Compact Representations by Finite-State Transducers
Sort
View
ACL
1994
13 years 6 months ago
Compact Representations by Finite-State Transducers
Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving t...
Mehryar Mohri
TASLP
2010
106views more  TASLP 2010»
12 years 11 months ago
Efficient and Robust Music Identification With Weighted Finite-State Transducers
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...
Mehryar Mohri, Pedro Moreno, Eugene Weinstein
COLING
1994
13 years 6 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
TCIAIG
2010
12 years 11 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
CICLING
2007
Springer
13 years 11 months ago
Finite-State Technology as a Programming Environment
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
Shuly Wintner