16430 search results - page 90 / 3286 » On Computable Tree Functions |
105
click to vote
ACL
1989
15 years 4 months ago
1989
the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The a...
148
Voted
CAAP
1992
15 years 7 months ago
1992
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
184
Voted
DCC
2011
IEEE
14 years 9 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
150
Voted
ACL
2012
13 years 5 months ago
2012
Many semantic parsing models use tree transformations to map between natural language and meaning representation. However, while tree transformations are central to several state-...
119
Voted
ACL
2000
15 years 4 months ago
2000
We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi ...