681 search results - page 3 / 137 » Parsing as Natural Deduction |
CADE
1999
Springer
14 years 3 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
ACL
2008
14 years 9 days ago
2008
We define a new formalism, based on Sikkel's parsing schemata for constituency parsers, that can be used to describe, analyze and compare dependency parsing algorithms. This ...
RTA
2004
Springer
14 years 4 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
ACL
1998
14 years 6 days ago
1998
The multiplicative fragment of linear logic has found a number of applications in computational linguistics: in the "glue language" approach to LFG semantics, and in the...
AML
1998
13 years 10 months ago
1998
A natural deduction system NDIL described here admits normalization and has subformula prop