681 search results - page 20 / 137 » Parsing as Natural Deduction |
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
EACL
2009
ACL Anthology
15 years 10 months ago
2009
ACL Anthology
108
Voted
JMLR
2012
13 years 2 days ago
2012
Open-text semantic parsers are designed to interpret any statement in natural language by inferring a corresponding meaning representation (MR – a formal representation of its s...
100
click to vote
ACL
2009
14 years 7 months ago
2009
The automatic extraction of relations between entities expressed in natural language text is an important problem for IR and text understanding. In this paper we show how differen...
IJCNLP
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...