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.
2012
2012
A relation is a set of pairs—in this paper, a subset of ⌃⇤ ⇥ ⇤, so it relates strings over an “input” alphabet ⌃ to strings over… 
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
A prefilled syringe comprises a barrel having at a distal end a needle-connecting portion and at the proximal end an open end, a… 
2005
2005
We aim at learning anunbiasedstochastic edit distance in the form of a finite-state transducer from a corpus of ( input,output… 
2005
2005
Computer-Assisted Translation (CAT) is an alternative approach to machine translation, that integrates human expertise into the… 
2004
2004
In this paper, we investigate a weighted finite-state transducer approach to language modelling for speech recognition… 
2002
2002
The main focus of this thesis is on improving the quality of concatenative speech synthesis by taking advantage of the natural… 
2000
2000
In this paper we describe our work involving the conversion of our phonologically-based synthesizer into a finite-state transducer…