1423 search results - page 133 / 285 » Languages of Nested Trees |
122
Voted
COLING
2008
15 years 5 months ago
2008
We propose an approach to natural language inference based on a model of natural logic, which identifies valid inferences by their lexical and syntactic features, without full sem...
109
Voted
ICALP
1999
Springer
15 years 7 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
115
Voted
CONCUR
1998
Springer
15 years 7 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
126
Voted
COLT
1992
Springer
15 years 7 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
118
Voted
EACL
2003
ACL Anthology
15 years 5 months ago
2003
ACL Anthology
Two apparently opposing DOP models exist in the literature: one which computes the parse tree involving the most frequent subtrees from a treebank and one which computes the parse...