681 search results - page 55 / 137 » Parsing as Natural Deduction |
102
click to vote
ACL
2011
14 years 1 months ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
IJCNLP
2005
Springer
15 years 3 months ago
2005
Springer
We present a preliminary study of several parser adaptation es evaluated on the GENIA corpus of MEDLINE abstracts [1,2]. We begin by observing that the Penn Treebank (PTB) is lexic...
TSD
2004
Springer
15 years 3 months ago
2004
Springer
Discourse in formal domains, such as mathematics, is characterized by a mixture of telegraphic natural language and embedded formal expressions. Little is known about the suitabil...
NLPRS
2001
Springer
15 years 2 months ago
2001
Springer
In this project report we describe work in statistical parsing using the maximum entropy technique and the Alpino language analysis system for Dutch. A major difficulty in this d...
AGP
1998
IEEE
15 years 2 months ago
1998
IEEE
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...