1423 search results - page 133 / 285 » Languages of Nested Trees |
157
click to vote
COLING
2008
15 years 7 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...
138
click to vote
ICALP
1999
Springer
15 years 10 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...
153
click to vote
CONCUR
1998
Springer
15 years 10 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...
169
click to vote
COLT
1992
Springer
15 years 10 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...
155
click to vote
EACL
2003
ACL Anthology
15 years 7 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...