Results 1  10
of
52
Implementation of a Deterministic Partial EUnification Algorithm for Macro Tree Transducers
, 1996
"... During the execution of functional logic programs, particular Eunification problems must be solved quite frequently. In this paper we contribute to the efficient solution of such problems in the case where E is induced by particular term rewriting systems called macro tree transducers. We formalize ..."
Abstract
 Add to MetaCart
formalize the implementation of a deterministic partial Eunification algorithm on a deterministic abstract machine, called the twin unification machine. The unification algorithm is based on a particular narrowing strategy that combines leftmost outermost narrowing with a local constructor consistency
Towards practical typechecking for macro tree transducers
, 2007
"... Abstract. Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step toward an implementation of mtt typechecker that has a practical efficiency. Our approach is to represent an input ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step toward an implementation of mtt typechecker that has a practical efficiency. Our approach is to represent
XML Type Checking for Macro Tree Transducers with Holes
, 2007
"... Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because they support sequence concatenation of output trees as buildin operation. Surprisingly, inverse type inference for mfts, ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
, for a fixed output type, can be done within the same complexity as for mtts. Inverse type inference is used in algorithms for exact type checking of XML transformations. The macro tree transducer with holes (hmtt) is a new concept that is introduced in this paper. It generalizes sequence concatenation
Interactive Learning of Node Selecting Tree Transducer
 MACHINE LEARNING
, 2007
"... We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. We propose to represent monadic queries by bottomup deterministic Node Selecting Tree Transducers (NSTTs), a particul ..."
Abstract

Cited by 40 (14 self)
 Add to MetaCart
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. We propose to represent monadic queries by bottomup deterministic Node Selecting Tree Transducers (NSTTs), a
Random generation of deterministic tree (walking) automata
 In International Conference on Implementation and Application of Automata (CIAA
, 2009
"... Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential lettertoletter transducers up to isomorphism. We tailor this general scheme to randomly generate deterministic tree walk ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential lettertoletter transducers up to isomorphism. We tailor this general scheme to randomly generate deterministic tree
Parametric Random Generation of Deterministic Tree Automata ✩,✩✩
, 2011
"... Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential lettertoletter transducers up to isomorphism. We also propose an original parametric random generation algorithm to prod ..."
Abstract
 Add to MetaCart
to produce sequential lettertoletter transducers with a fixed number of transitions. We tailor this general scheme to randomly generate deterministic tree walking automata and deterministic topdown tree automata. We apply our implementation of the generator to the estimation of the average complexity of a
Learning Node Selecting Tree Transducer from Completely Annotated Examples
 In 7th International Colloquium on Grammatical Inference
, 2004
"... A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically from examples. We introduce node selecting tree transducer (NSTT) and show how to induce deterministic NSTTs in polynomial time fro ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically from examples. We introduce node selecting tree transducer (NSTT) and show how to induce deterministic NSTTs in polynomial time
Efficient Algorithms for Parsing the DOP Model
, 1996
"... Excellent results have been reported for DataOriented Parsing (DOP) of natural language texts (Bod, 1993c). Unfortunately, existing algorithms are both computationally intensive and difficult to implement. Previous algorithms are expensive due to two factors: the exponential number of rules that mus ..."
Abstract

Cited by 66 (4 self)
 Add to MetaCart
that must be generated and the use of a Monte Carlo p arsing algorithm. In this paper we solve the first problem by a novel reduction of the DOP model toga small, equivalent probabilistic contextfree grammar. We solve the second problem by a novel deterministic parsing strategy that maximizes the expected
StateIdentification Problems for FiniteState Transducers (extended abstract)
"... Abstract. A wellestablished theory exists for testing finitestate machines, in particular Moore and Mealy machines. A fundamental class of problems handled by this theory is state identification: we are given a machine with known state space and transition relation but unknown initial state, and w ..."
Abstract
 Add to MetaCart
the latter are deterministic and minimal. We also provide partial answers to the decidability question, namely, checking whether a given transducer admits a particular type of experiment. First, we show how the standard successortree algorithm for Mealy machines can be turned into a semialgorithm
Integrated Natural Language Generation with SchemaTree Adjoining Grammars
"... This paper describes an integrated generation system (INLGS) based on the formalism of SchemaTree Adjoining Grammars with Unification (SUTAGs). According to this system architecture, all knowledge bases are specified in the same formalism and run the same processing algorithm. A main advantage is ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper describes an integrated generation system (INLGS) based on the formalism of SchemaTree Adjoining Grammars with Unification (SUTAGs). According to this system architecture, all knowledge bases are specified in the same formalism and run the same processing algorithm. A main advantage
Results 1  10
of
52