681 search results - page 12 / 137 » Parsing as Natural Deduction |
174
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
168
click to vote
EMNLP
2010
15 years 4 months ago
2010
Parser disambiguation with precision grammars generally takes place via statistical ranking of the parse yield of the grammar using a supervised parse selection model. In the stan...
138
click to vote
ECCC
2006
15 years 6 months ago
2006
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
134
click to vote
COLING
1996
15 years 7 months ago
1996
We present an approach to parallel natural language parsing which is based on a concurrent, object-oriented model of computation. A depth-first, yet incomplete parsing algorithm f...