Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,553 papers from all fields of science
Search
Sign In
Create Free Account
Finite-state transducer
Known as:
Finite state transducer
, Weighted finite-state transducer
, Weighted automaton
Expand
A finite-state transducer (FST) is a finite-state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Automaton
Concatenation
Deterministic finite automaton
Directed graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Automatic syllable segmentation of Myanmar texts using finite state transducer
Tin Htay Hlaing
,
Y. Mikami
2014
Corpus ID: 62754291
Abstract — Automatic syllabification lies at the heart of script processing especially for the South East Asian scripts like…
Expand
2012
2012
Bounded repairability for regular tree languages
P. Bourhis
,
Gabriele Puppis
,
Cristian Riveros
,
S. Staworko
International Conference on Database Theory
2012
Corpus ID: 11680295
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a…
Expand
2010
2010
Automata-Based Abduction for Tractable Diagnosis
Thomas Hubauer
,
S. Lamparter
,
M. Pirker
Description Logics
2010
Corpus ID: 7207768
Abductive reasoning has been recognized as a valuable com- plement to deductive inference for tasks such as diagnosis and…
Expand
2009
2009
Weighted finite state transducer based statistical dialog management
Chiori Hori
,
Kiyonori Ohtake
,
Teruhisa Misu
,
H. Kashioka
,
Satoshi Nakamura
IEEE Workshop on Automatic Speech Recognition…
2009
Corpus ID: 25809612
We proposed a dialog system using a weighted finite-state transducer (WFST) in which user concept and system action tags are…
Expand
2006
2006
A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata
Jonathan May
,
Kevin Knight
North American Chapter of the Association for…
2006
Corpus ID: 312883
Ranked lists of output trees from syntactic statistical NLP applications frequently contain multiple repeated entries. This…
Expand
2006
2006
Analysis of German Compounds Using Weighted Finite State Transducers
T. Marek
2006
Corpus ID: 17001858
nach entnommen habe, sind kenntlich gemacht.
2004
2004
Finite state transducers for policy evaluation and conflict resolution
J. Baliosian
,
J. Serrat
Proceedings. Fifth IEEE International Workshop on…
2004
Corpus ID: 5574841
This work presents a formal framework for a policy representation model based on finite state transducers (FSTs). The main…
Expand
2003
2003
Evolving Finite State Transducers: Some Initial Explorations
S. Lucas
European Conference on Genetic Programming
2003
Corpus ID: 16706239
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain…
Expand
2000
2000
A flexible, scalable finite-state transducer architecture for corpus-based concatenative speech synthesis
Jon R. W. Yi
,
James R. Glass
,
I. L. Hetherington
Interspeech
2000
Corpus ID: 252230
In this paper we describe our work involving the conversion of our phonologically-based synthesizer into a finite-state transducer…
Expand
1999
1999
Two-Way Finite State Transducers and Monadic Second-Order Logic
J. Engelfriet
,
H. Hoogeboom
International Colloquium on Automata, Languages…
1999
Corpus ID: 46416812
Deterministic two-way finite state transductions are exactly the mso definable string transductions. Nondeterministic mso…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE