Sciweavers

415 search results - page 13 / 83
» Tree Unification Grammar
Sort
View
ACMSE
1990
ACM
14 years 24 days ago
Computerizing a machine readable dictionary
Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexi...
Jan G. Wilms
ACL
2009
13 years 6 months ago
Bayesian Learning of a Tree Substitution Grammar
Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we le...
Matt Post, Daniel Gildea
WIA
2005
Springer
14 years 2 months ago
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
Markus Lohrey, Sebastian Maneth
ENTCS
2002
157views more  ENTCS 2002»
13 years 8 months ago
Arguments and Misunderstandings: Fuzzy Unification for Negotiating Agents
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contri...
Michael Schroeder, Ralf Schweimeier
CLIN
2001
13 years 10 months ago
Performance Grammar: a Declarative Definition
In this paper we present a definition of Performance Grammar (PG), a psycholinguistically motivated syntax formalism, in declarative terms. PG aims not only at describing and expl...
Gerard Kempen, Karin Harbusch