Results 1  10
of
1,591
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 392 (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 string
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
PartofSpeech Tagging with Two Sequential Transducers
, 2000
"... The article presents a method of constructing and applying a cascade consisting of a leftand a rightsequential finitestate transducer, , for partofspeech disambiguation. In the process of POS tagging, every word is first assigned a unique ambiguity class that represents the set of alternati ..."
Abstract
 Add to MetaCart
The article presents a method of constructing and applying a cascade consisting of a leftand a rightsequential finitestate transducer, , for partofspeech disambiguation. In the process of POS tagging, every word is first assigned a unique ambiguity class that represents the set
Factorization of Ambiguous FiniteState Transducers
 THE UNIVERSITY OF WESTERN ONTARIO. FINAL
, 2000
"... This article describes an algorithm for factorizing an ambiguous finitestate transducer (FST) into two FSTs, T 1 and T 2 , such that T 1 is functional and T 2 retains the ambiguity of the original FST. The application of T 2 to the output of T 1 never leads to a state that does not provide a tran ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This article describes an algorithm for factorizing an ambiguous finitestate transducer (FST) into two FSTs, T 1 and T 2 , such that T 1 is functional and T 2 retains the ambiguity of the original FST. The application of T 2 to the output of T 1 never leads to a state that does not provide a
Weighted finitestate transducers in speech recognition
 COMPUTER SPEECH & LANGUAGE
, 2002
"... We survey the use of weighted finitestate transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for hidden Markov models (HMMs), contextdependency, pronunciation dictionaries, grammars, and alternative recognition outputs. Furthermore, general tr ..."
Abstract

Cited by 211 (5 self)
 Add to MetaCart
We survey the use of weighted finitestate transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for hidden Markov models (HMMs), contextdependency, pronunciation dictionaries, grammars, and alternative recognition outputs. Furthermore, general
FiniteState Transducers
 in Speech Recognition. Computer Speech and Language
, 1997
"... Abstract. psubsequential transducers are efficient finitestate transducers with p final outputs used in a variety of applications. Not all transducers admit equivalent psubsequential transducers however. We briefly describe an existing generalized determinization algorithm for psubsequential tran ..."
Abstract

Cited by 92 (20 self)
 Add to MetaCart
Abstract. psubsequential transducers are efficient finitestate transducers with p final outputs used in a variety of applications. Not all transducers admit equivalent psubsequential transducers however. We briefly describe an existing generalized determinization algorithm for psubsequential
Abstract Factorization of Ambiguous FiniteState Transducers
"... This article describes an algorithm for factorizing an ambiguous finitestate transducer (FST) into two ¢ ¡ FSTs, ¤ £ and, such ¥ ¡ that is functional and ¦ £ retains the ambiguity of the original FST. The application of ¤ £ to the output of ¥ ¡ never leads to a state that does not provide a tra ..."
Abstract
 Add to MetaCart
This article describes an algorithm for factorizing an ambiguous finitestate transducer (FST) into two ¢ ¡ FSTs, ¤ £ and, such ¥ ¡ that is functional and ¦ £ retains the ambiguity of the original FST. The application of ¤ £ to the output of ¥ ¡ never leads to a state that does not provide a
Generating FiniteState Transducers For SemiStructured Data Extraction From The Web
, 1998
"... Integrating a large number of Web information sources may significantly increase the utility of the WorldWide Web. A promising solution to the integration is through the use of a Web Information mediator that provides seamless, transparent access for the clients. Information mediators need wrappers ..."
Abstract

Cited by 178 (3 self)
 Add to MetaCart
and typos. This paper presents SoftMealy, a novel wrapper representation formalism. This representation is based on a finitestate transducer (FST) and contextual rules. This approach can wrap a wide range of semistructured Web pages because FSTs can encode each different attribute permutation as a path. A
Principles and methods of Testing Finite State Machines  a survey
 PROCEEDINGS OF IEEE
, 1996
"... With advanced computer technology, systems are getting larger to fulfill more complicated tasks, however, they are also becoming less reliable. Consequently, testing is an indispensable part of system design and implementation; yet it has proved to be a formidable task for complex systems. This moti ..."
Abstract

Cited by 345 (16 self)
 Add to MetaCart
. This motivates the study of testing finite state machines to ensure the correct functioning of systems and to discover aspects of their behavior. A finite state machine contains a finite number of states and produces outputs on state transitions after receiving inputs. Finite state machines are widely used
Parsing with FiniteState Transducers
, 1996
"... Accurately parsing natural language sentences requires large scale and detailed lexical grammars. We will see that for the problem of parsing natural language sentences, #nitestate models are not an e#cient but somewhat inaccurate tool but rather one of the best formalism to represent accurately co ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
complex linguistic phenomena. Finitestate transducers should appeal to the linguist looking for precise and natural description of complex syntactic structures while the wide range of formal operations on #nitestate transducers provides the designer of parsing programs with powerful tools to improve
Results 1  10
of
1,591