Sciweavers

415 search results - page 18 / 83
» Tree Unification Grammar
Sort
View
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 8 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
IANDC
1998
70views more  IANDC 1998»
13 years 8 months ago
The Generating Power of Total Deterministic Tree Transducers
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...
Sebastian Maneth
ACL
1989
13 years 10 months ago
Cooking Up Referring Expressions
This paper describes the referring expression generation mechanisms used in EPICURE, a computer program which produces natural language descriptions of cookery recipes. Major feat...
Robert Dale
ACL
1990
13 years 10 months ago
Expressing Disjunctive and Negative Feature Constraints with Classical First-Order Logic
In contrast to the "designer logic" approach, this paper shows how the attribute-value feature structures of unification grammar and constraints on them can be axiomatiz...
Mark Johnson
JUCS
2002
91views more  JUCS 2002»
13 years 8 months ago
On Quasi-Products of Tree Automata
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
Ferenc Gécseg