We introduce two probabilistic models that can be used to identify elementary discourse units and build sentence-level discourse parse trees. The models use syntactic and lexical ...
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...
A mechanically formalized feature modeling metamodel is presented. This theory is a generic higher-order formalization of a mathematical model synthesizing several feature modelin...