Results 1 
6 of
6
Finite State Transducers with Predicates and Identities
 Grammars
, 2001
"... An extension to finite state transducers is presented, in which atomic symbols are replaced by arbitrary predicates over symbols. The extension is motivated by applications in natural language processing (but may be more widely applicable) as well as by the observation that transducers with predicat ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
(Show Context)
An extension to finite state transducers is presented, in which atomic symbols are replaced by arbitrary predicates over symbols. The extension is motivated by applications in natural language processing (but may be more widely applicable) as well as by the observation that transducers with predicates generally have fewer states and fewer transitions. Although the extension is fairly trivial for finite state acceptors, the introduction of predicates is more interesting for transducers. It is shown how various operations on transducers (e.g. composition) can be implemented, as well as how the transducer determinization algorithm can be generalized for predicateaugmented finite state transducers.
The treatment of epsilon moves in subset construction
 IN FINITESTATE METHODS IN NATURAL LANGUAGE PROCESSING, ANKARA. CMPLG/9804003
, 1998
"... The paper discusses the problem of determinizing finitestate automata containing large numbers of εmoves. Experiments with finitestate approximations of natural language grammars often give rise to very large automata with a very large number of εmoves. The paper identifies and compares a number ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
The paper discusses the problem of determinizing finitestate automata containing large numbers of εmoves. Experiments with finitestate approximations of natural language grammars often give rise to very large automata with a very large number of εmoves. The paper identifies and compares a number of subset construction algorithms that treat εmoves. Experiments have been performed which indicate that the algorithms differ considerably in practice, both with respect to the size of the resulting deterministic automaton, and with respect to practical efficiency. Furthermore, the experiments suggest that the average number of εmoves per state can be used to predict which algorithm is likely to be the fastest for a given input automaton.
Implementing WS1S via Finite Automata
"... It has long been known that WS1S is decidable through the use of finite automata. However, since the worst case running time has been proven to grow extremely quickly, few have explored the implementation of the algorithm. In this paper we describe some of the points of interest that have come up wh ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
It has long been known that WS1S is decidable through the use of finite automata. However, since the worst case running time has been proven to grow extremely quickly, few have explored the implementation of the algorithm. In this paper we describe some of the points of interest that have come up while coding and running the algorithm. These points include the data structures used as wekk as the special properties of the automata, which we can exploit to perform minimization very quickly in certain cases. We also present some data that enable us to gain insight into how the algorithm performs in the average case, both on random inputs ans on inputs that come from the use of Presburger Arithmetic (which can be converted to WS1S) in compiler optimization.
Subset construction complexity for homogeneous automata, position automata and ZPCstructures
 Theoretical Computer Science
, 2001
"... The aim of this paper is to investigate how subset construction performs on specific families of automata. A new upper bound on the number of states of the subsetautomaton is established in the case of homogeneous automata. The complexity of the two basic steps of subset construction, i.e. the comp ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
The aim of this paper is to investigate how subset construction performs on specific families of automata. A new upper bound on the number of states of the subsetautomaton is established in the case of homogeneous automata. The complexity of the two basic steps of subset construction, i.e. the computation of deterministic transitions and the set equality tests, is examined depending on whether the nondeterministic automaton is an unrestricted one, an homogeneous one, a position one or a ZPCstructure, which is an implicit construction for a position automaton.
Treatment of epsilonMoves in Subset Construction
, 2000
"... The paper discusses the problem of determinising finitestate automata containing large numbers of emoves. Experiments with finitestate approximations of natural language grammars often give rise to very large automata with a very large number of emoves. ..."
Abstract
 Add to MetaCart
The paper discusses the problem of determinising finitestate automata containing large numbers of emoves. Experiments with finitestate approximations of natural language grammars often give rise to very large automata with a very large number of emoves.
Finite Automata with Predicates for NLP
, 2000
"... Finite automata are widely used in natural language processing. We present an extension to finite automata, in which atomic symbols are replaced by arbitrary predicates over symbols. After motivating the extension, we show how operations such as intersection, composition, determinization and min ..."
Abstract
 Add to MetaCart
(Show Context)
Finite automata are widely used in natural language processing. We present an extension to finite automata, in which atomic symbols are replaced by arbitrary predicates over symbols. After motivating the extension, we show how operations such as intersection, composition, determinization and minimization are implemented.