1942 search results - page 117 / 389 » Parse |
146
click to vote
ACL
1998
15 years 7 months ago
1998
Any large language processing software relies in its operation on heuristic decisions concerning the strategy of processing. These decisions are usually "hard-wired" int...
148
click to vote
ANLP
2000
15 years 7 months ago
2000
It is generally recognized that the common nonterminal labels for syntactic constituents (NP, VP, etc.) do not exhaust the syntactic and semantic information one would like about ...
157
click to vote
COLING
2000
15 years 7 months ago
2000
Common wisdom has it that tile bias of stochastic grammars in favor of shorter deriwttions of a sentence is hamfful and should be redressed. We show that the common wisdom is wron...
146
click to vote
EACL
1993
ACL Anthology
15 years 7 months ago
1993
ACL Anthology
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
155
click to vote
EACL
1993
ACL Anthology
15 years 7 months ago
1993
ACL Anthology
We report grammar inference experiments on partially parsed sentences taken from the Wall Street Journal corpus using the inside-outside algorithm for stochastic context-free gram...