102 search results - page 6 / 21 » Semantically Restricted Argument Dependencies |
129
click to vote
FUIN
2006
15 years 4 months ago
2006
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
122
click to vote
ICLP
1999
Springer
15 years 8 months ago
1999
Springer
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could c...
130
click to vote
ACL
2012
13 years 6 months ago
2012
For sentence compression, we propose new semantic constraints to directly capture the relations between a predicate and its arguments, whereas the existing approaches have focused...
175
click to vote
ACL
2011
14 years 8 months ago
2011
We propose a non-parametric Bayesian model for unsupervised semantic parsing. Following Poon and Domingos (2009), we consider a semantic parsing setting where the goal is to (1) d...
147
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...