Skip to search formSkip to main contentSkip to account menu

Finite-state transducer

Known as: Finite state transducer, Weighted finite-state transducer, Weighted automaton 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Abstract — Automatic syllabification lies at the heart of script processing especially for the South East Asian scripts like… 
2012
2012
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a… 
2010
2010
Abductive reasoning has been recognized as a valuable com- plement to deductive inference for tasks such as diagnosis and… 
2009
2009
We proposed a dialog system using a weighted finite-state transducer (WFST) in which user concept and system action tags are… 
2006
2006
Ranked lists of output trees from syntactic statistical NLP applications frequently contain multiple repeated entries. This… 
2006
2006
nach entnommen habe, sind kenntlich gemacht. 
2004
2004
This work presents a formal framework for a policy representation model based on finite state transducers (FSTs). The main… 
2003
2003
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain… 
2000
2000
In this paper we describe our work involving the conversion of our phonologically-based synthesizer into a finite-state transducer… 
1999
1999
Deterministic two-way finite state transductions are exactly the mso definable string transductions. Nondeterministic mso…