Results 1  10
of
21
Minimization Algorithms for Sequential Transducers
, 2000
"... We present general algorithms for minimizing sequential finitestate transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S+E+V+(EV+F)x(Pmax+1)) steps, where S is the sum of ..."
Abstract

Cited by 64 (11 self)
 Add to MetaCart
We present general algorithms for minimizing sequential finitestate transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S+E+V+(EV+F)x(Pmax+1)) steps, where S is the sum
Direct Construction of Minimal Acyclic Subsequential Transducers
, 2001
"... This paper presents an algorithm for direct building of minimal acyclic subsequential transducer, which represents a finite relation given as a sorted list of words with their outputs. The algorithm constructs the minimal transducer directly without constructing intermediate treelike or pseudomini ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
This paper presents an algorithm for direct building of minimal acyclic subsequential transducer, which represents a finite relation given as a sorted list of words with their outputs. The algorithm constructs the minimal transducer directly without constructing intermediate treelike or pseudo
Incremental construction of minimal acyclic finite state automata and transducers.
 In Proceedings of the International Workshop on Finite State Methods in Natural Language Processing,
, 1998
"... ..."
Minimization of Sequential Transducers
 Lecture Notes in Computer Science
"... . We present an algorithm for minimizing sequential transducers. This algorithm is shown to be efficient, since in the case of acyclic transducers it operates in O(jEj + jV j + (Ej \Gamma jV j + jF j):(jPmax j + 1) steps, where E is the set of edges of the given transducer, V the set of its vertices ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
. We present an algorithm for minimizing sequential transducers. This algorithm is shown to be efficient, since in the case of acyclic transducers it operates in O(jEj + jV j + (Ej \Gamma jV j + jF j):(jPmax j + 1) steps, where E is the set of edges of the given transducer, V the set of its
Incremental Construction of Minimal Sequential Transducers The UnsortedData Algorithm for Acyclic Sequential Transducers
"... This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm generalizes a known method of constructing minimal finitestate automata (Daciuk, Mihov, Watson and Watson 2000). Unlike ..."
Abstract
 Add to MetaCart
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm generalizes a known method of constructing minimal finitestate automata (Daciuk, Mihov, Watson and Watson 2000). Unlike
DAGGER: A Toolkit for Automata on Directed Acyclic Graphs
"... This paper presents DAGGER, a toolkit for finitestate automata that operate on directed acyclic graphs (dags). The work is based on a model introduced by (Kamimura and Slutzki, 1981; Kamimura and Slutzki, 1982), with a few changes to make the automata more applicable to natural language processing. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper presents DAGGER, a toolkit for finitestate automata that operate on directed acyclic graphs (dags). The work is based on a model introduced by (Kamimura and Slutzki, 1981; Kamimura and Slutzki, 1982), with a few changes to make the automata more applicable to natural language processing
The reactive engine for modular transducers
 Algebra, Meaning and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday
, 2005
"... Abstract. This paper explains the design of the second release of the Zen toolkit [5–7]. It presents a notion of reactive engine which simulates finitestate machines represented as shared aums [8]. We show that it yields a modular interpreter for finite state machines described as local transducers ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
transducers. For instance, in the manner of Berry and Sethi, we define a compiler of regular expressions into a scheduler for the reactive engine, chaining through aums labeled with phases — associated with the letters of the regular expression. This gives a modular composition scheme for general finite
HFST Runtime Format A Compacted Transducer Format Allowing for Fast Lookup
"... Abstract. Lexical transducers form part of most languageaware applications, which means that less time spent on lexical lookup will have wideranging eects. The eciency of a morphological analyzer stems mainly from the properties of the underlying transducer, but the way its transition sets are re ..."
Abstract
 Add to MetaCart
material for evaluating the speed allowed by the formats, we use two full
edged morphological descriptions: Morphalou for French, which is a fullform morphological lexicon resulting in an acyclic transducer, and the Divvun lexicon for Northern Sami, which is a morphological description with a pro
Towards probabilistic acceptors and transducers for feature structures
 IN PROC. SSST WORKSHOP
, 2012
"... Weighted finitestate acceptors and transducers (Pereira and Riley, 1997) are a critical technology for NLP and speech systems. They flexibly capture many kinds of stateful lefttoright substitution, simple transducers can be composed into more complex ones, and they are EM trainable. They are una ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
and reference (“who did what to whom”). Feature structures provide an attractive, wellstudied, standard format (Shieber, 1986; Rounds and Kasper, 1986), which we can view computationally as directed acyclic graphs. In this paper, we develop probabilistic acceptors and transducers for feature structures
Results 1  10
of
21