Sciweavers

102 search results - page 6 / 21
» Semantically Restricted Argument Dependencies
Sort
View
FUIN
2006
81views more  FUIN 2006»
13 years 7 months ago
Redundant Call Elimination via Tupling
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...
Wei-Ngan Chin, Siau-Cheng Khoo, Neil Jones
ICLP
1999
Springer
13 years 11 months ago
Event, Property, and Hierarchy in Order-Sorted Logic
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...
Ken Kaneiwa, Satoshi Tojo
ACL
2012
11 years 10 months ago
Sentence Compression with Semantic Role Constraints
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...
Katsumasa Yoshikawa, Ryu Iida, Tsutomu Hirao, Mana...
ACL
2011
12 years 11 months ago
A Bayesian Model for Unsupervised Semantic Parsing
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...
Ivan Titov, Alexandre Klementiev
FCT
2005
Springer
14 years 1 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
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...
Aleksy Schubert