1195 search results - page 52 / 239 » acl 2007 |
117
click to vote
ACL
1994
15 years 5 months ago
1994
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
121
Voted
ACL
1994
15 years 5 months ago
1994
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
108
click to vote
ACL
1996
15 years 5 months ago
1996
We propose an Mgorithm to resolve anaphors, tackling mainly the problem of intrasentential antecedents. We base our methodology on the fact that such antecedents are likely to occ...
161
Voted
ACL
1996
15 years 5 months ago
1996
We use a statistical method to select the most probable structure or parse for a given sentence. It takes as input the dependency structures generated for the sentence by a depend...
126
click to vote
ACL
1994
15 years 5 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...