1064 search results - page 95 / 213 » Single Tree Grammars |
134
Voted
ACL
1989
15 years 4 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
116
Voted
ACL
1992
15 years 4 months ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
141
click to vote
ISCI
2006
15 years 3 months ago
2006
We investigate the effectiveness of GP-generated intelligent structures in classification tasks. Specifically, we present and use four context-free grammars to describe (1) decisi...
143
Voted
JQL
2008
15 years 3 months ago
2008
A wide range of evidence points to a preference for syntactic structures in which dependencies are short. Here we examine the question: what kinds of dependency configurations min...
129
Voted
LRE
2008
15 years 3 months ago
2008
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...