Results 1 - 10 of 52

Implementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers

by Heinz Faßbender, Andrea Mößle, Heiko Vogler , 1996
"... During the execution of functional logic programs, particular E-unification 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 E-unification 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

by Alain Frisch, Haruo Hosoya , 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

by Sebastian Maneth, Keisuke Nakano , 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 build-in 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

by Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren - 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 bottom-up 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 bottom-up deterministic Node Selecting Tree Transducers (NSTTs), a

Random generation of deterministic tree (walking) automata

by Pierre-cyrille Héam, Cyril Nicaud Sylvain Schmitz - 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 letter-to-letter 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 letter-to-letter transducers up to isomorphism. We tailor this general scheme to randomly generate deterministic tree

Parametric Random Generation of Deterministic Tree Automata ✩,✩✩

by Pierre-cyrille Héam A, Cyril Nicaud B, Sylvain Schmitz C , 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 letter-to-letter transducers up to isomorphism. We also propose an original parametric random generation algorithm to prod ..."
Abstract - Add to MetaCart
to produce sequential letter-to-letter transducers with a fixed number of transitions. We tailor this general scheme to randomly generate deterministic tree walking automata and deterministic top-down 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

by Julien Carme, Aurelien Lemay, Joachim Niehren - 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

by Joshua Goodman , 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 context-free grammar. We solve the second problem by a novel deterministic parsing strategy that maximizes the expected

State-Identification Problems for Finite-State Transducers (extended abstract)

by Moez Krichen, Stavros Tripakis
"... Abstract. A well-established theory exists for testing finite-state 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 successor-tree algorithm for Mealy machines can be turned into a semi-algorithm

Integrated Natural Language Generation with Schema-Tree Adjoining Grammars

by Karin Harbusch, Jens Woch
"... This paper describes an integrated generation system (INLGS) based on the formalism of Schema-Tree Adjoining Grammars with Unification (SU-TAGs). 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 Schema-Tree Adjoining Grammars with Unification (SU-TAGs). 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