Results 1 
9 of
9
FiniteState Transducers in Language and Speech Processing
 Computational Linguistics
, 1997
"... Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential stringtostring transducer ..."
Abstract

Cited by 387 (42 self)
 Add to MetaCart
Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential stringtostring transducers. Transducers that output weights also play an important role in language and speech processing. We give a specific study of stringtoweight transducers, including algorithms for determinizing and minimizing these transducers very efficiently, and characterizations of the transducers admitting determinization and the corresponding algorithms. Some applications of these algorithms in speech recognition are described and illustrated. 1.
An Efficient Compiler for Weighted Rewrite Rules
 IN 34TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
, 1996
"... Contextdependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finitestate transducers (FSTs). We describe a new algorithm for compilin ..."
Abstract

Cited by 77 (24 self)
 Add to MetaCart
Contextdependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finitestate transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs. We show the algorithm to be simpler and more efficient than existing algorithms. Further, many
Describing Syntax with StarFree Regular Expressions
, 2003
"... Syntactic constraints in Koskenniemi's FiniteState Intersection Granunar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turns out that although the constraints in Voutilainen's (1994) FSIG description of English make use of sever ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Syntactic constraints in Koskenniemi's FiniteState Intersection Granunar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turns out that although the constraints in Voutilainen's (1994) FSIG description of English make use of several extensions to regular expressions, the description as a whole reduces to a finite combination of union, complement and concatenation.
Joint work with
"... Text and speech processing: hard problems Theory of automata Appropriate level of abstraction ..."
Abstract
 Add to MetaCart
Text and speech processing: hard problems Theory of automata Appropriate level of abstraction
Image Storage, Indexing and Recognition with Finite State Automata
"... Abstract: In this paper, we introduce the weighted finite state automata (WFA) as a tool for image specification and loss or lossfree compression. We describe how to compute WFA from input images and how the resultant automaton can be used to store images (or to create image database) and to obtain ..."
Abstract
 Add to MetaCart
Abstract: In this paper, we introduce the weighted finite state automata (WFA) as a tool for image specification and loss or lossfree compression. We describe how to compute WFA from input images and how the resultant automaton can be used to store images (or to create image database) and to obtain additional interesting information usable for image indexing or recognition. Next, we describe an automata composition technique. We also present a possible way of storing automata in persistent storage. Finally, we depict some tests. The benefit of our approach is that some beneficial information for indexing and recognition without knowledge of scene does not need to be computed from compressed images using other algorithms since the resultant WFA already contains it. Index Terms: indexing, compression, automata, preprocessing I.
Onedimensional and ndimensional Usage of the Finite State Automata
"... In this paper we describe teoretical solution and practical usage of a Finite State Automata (FSA) in one and ndimensional space. We classify approximate pattern matching problems using algebraic structures. Construction of algebra for pattern matching and operations applied to FSA corresponds to t ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper we describe teoretical solution and practical usage of a Finite State Automata (FSA) in one and ndimensional space. We classify approximate pattern matching problems using algebraic structures. Construction of algebra for pattern matching and operations applied to FSA corresponds to the creation of new pattern matching problems. We present several operations and describe some identified properties of the algebra defined this way. We propose a formal description useful for all similar problems to use better the known algorithms. Finally we describe a basic idea for using FSA on ndimensional space. Here we consider transformations of the input strings for weighted finite automata (WFA) in order to obtain dimension transformations which preserve multidimensional similarities. 1
Algebra of Pattern Matching Automata
"... Abstract. In this paper we classify pattern matching problems using algebraic means. We construct an algebra of pattern matching automata in which nite automata are the elements and operations applied to them correspond to the creation of new pattern matching problems. We present several such operat ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper we classify pattern matching problems using algebraic means. We construct an algebra of pattern matching automata in which nite automata are the elements and operations applied to them correspond to the creation of new pattern matching problems. We present several such operations and describe some identied properties of the algebra dened in this way. Key words: pattern matching, nite automata, algebra 1