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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

Abstract — Automatic syllabification lies at the heart of script processing especially for the South East Asian scripts like…

2012

We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a…

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

We proposed a dialog system using a weighted finite-state transducer (WFST) in which user concept and system action tags are…

2006

Ranked lists of output trees from syntactic statistical NLP applications frequently contain multiple repeated entries. This…

2006

In this paper we present how finite state transducers can be effectively used for compound treatment in text analysis. The…

2006

nach entnommen habe, sind kenntlich gemacht.

2005

This paper presents a formal method of detecting emerging and changing interests that appear in document streams arriving…

2003

Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain…

2000

In this paper we describe our work involving the conversion of our phonologically-based synthesizer into a ﬁnite-state transducer…