Results 1  10
of
4,195
act * AEC Kleenex: Compiling Nondeterministic Transducers to Deterministic Streaming Transducers
"... ns iste nt * Complete * W ell D ocumented*Easyto ..."
Nondeterministic streaming string transducers
 IN ICALP, SER. LNCS
, 2011
"... We introduce nondeterministic streaming string transducers (nssts) – a new computational model that can implement MSOdefinable relations between strings. An nsst makes a single lefttoright pass on the input string and uses a finite set of string variables to compute the output. In each step, i ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We introduce nondeterministic streaming string transducers (nssts) – a new computational model that can implement MSOdefinable relations between strings. An nsst makes a single lefttoright pass on the input string and uses a finite set of string variables to compute the output. In each step
Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora
, 1997
"... ..."
Expressiveness of streaming string transducers
"... Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and wellstudied class of “regular ” transductions for this case. Such regular transductions can be defined either by twoway deterministic finite
Distributed representations, simple recurrent networks, and grammatical structure
 Machine Learning
, 1991
"... Abstract. In this paper three problems for a connectionist account of language are considered: 1. What is the nature of linguistic representations? 2. How can complex structural relationships such as constituent structure be represented? 3. How can the apparently openended nature of language be acc ..."
Abstract

Cited by 396 (19 self)
 Add to MetaCart
Abstract. In this paper three problems for a connectionist account of language are considered: 1. What is the nature of linguistic representations? 2. How can complex structural relationships such as constituent structure be represented? 3. How can the apparently openended nature of language be accommodated by a fixedresource system? Using a prediction task, a simple recurrent network (SRN) is trained on multiclausal sentences which contain multiplyembedded relative clauses. Principal component analysis of the hidden unit activation patterns reveals that the network solves the task by developing complex distributed representations which encode the relevant grammatical relations and hierarchical constituent structure. Differences between the SRN state representations and the more traditional pushdown store are discussed in the final section.
XQuery Streaming by Forest Transducers
 IN: ICDE
, 2013
"... Streaming of XML transformations is a challenging task and only a few existing systems support streaming. Research approaches generally define custom fragments of XQuery and XPath that are amenable to streaming, and then design custom algorithms for each fragment. These languages have several shortc ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
shortcomings. Here we take a more principled approach to the problem of streaming XQuerybased transformations. We start with an elegant transducer model for which many static analysis problems are wellunderstood: the Macro Forest Transducer (MFT). We show that a large fragment of XQuery can be translated
Regular models of phonological rule systems
, 1994
"... This paper presents a set of mathematical and computational tools for manipulating and reasoning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of contextsensitive re ..."
Abstract

Cited by 379 (6 self)
 Add to MetaCart
This paper presents a set of mathematical and computational tools for manipulating and reasoning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of contextsensitive rewriting rules and also to grammars in Koskenniemi's twolevel formalism. This analysis provides a common representation of phonological constraints that supports efficient generation and recognition by a single simple interpreter.
Training Tree Transducers
 IN HLTNAACL
, 2004
"... Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Treebased modeling still lacks many of the standard tools taken for granted in (finitestate) stringbased modeling. The theory of tree transducer automata provides a possible framework to ..."
Abstract

Cited by 129 (11 self)
 Add to MetaCart
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Treebased modeling still lacks many of the standard tools taken for granted in (finitestate) stringbased modeling. The theory of tree transducer automata provides a possible framework
Tree transducers and . . .
, 2013
"... The aim of this Dagstuhl Seminar was to bring together researchers from various research areas related to the theory and application of tree transducers. Recently, interest in tree transducers has been revived due to surprising new applications in areas such as XML databases, security verification, ..."
Abstract
 Add to MetaCart
The aim of this Dagstuhl Seminar was to bring together researchers from various research areas related to the theory and application of tree transducers. Recently, interest in tree transducers has been revived due to surprising new applications in areas such as XML databases, security verification
Partial parsing via finitestate cascades
 Natural Language Engineering
, 1996
"... Finitestate cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finitestate cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers d ..."
Abstract

Cited by 339 (4 self)
 Add to MetaCart
Finitestate cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finitestate cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers
Results 1  10
of
4,195