Sciweavers

415 search results - page 46 / 83
» Tree Unification Grammar
Sort
View
LACL
2005
Springer
14 years 2 months ago
Strict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
John T. Hale, Edward P. Stabler
ACL
1993
13 years 10 months ago
Towards History-Based Grammars: Using Richer Models for Probabilistic Parsing
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
Ezra Black, Frederick Jelinek, John D. Lafferty, D...
ECOOP
2004
Springer
14 years 2 months ago
Rewritable Reference Attributed Grammars
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRA...
Torbjörn Ekman, Görel Hedin
ACL
1990
13 years 9 months ago
Polynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
K. Vijay-Shanker, David J. Weir
ACL
2006
13 years 10 months ago
Prototype-Driven Grammar Induction
We investigate prototype-driven learning for primarily unsupervised grammar induction. Prior knowledge is specified declaratively, by providing a few canonical examples of each ta...
Aria Haghighi, Dan Klein