Sciweavers

47 search results - page 3 / 10
» An Algorithm for VP Ellipsis
Sort
View
LACL
1998
Springer
13 years 11 months ago
Anaphora and Quantification in Categorial Grammar
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
Gerhard Jäger
ACL
2001
13 years 8 months ago
Resolving Ellipsis in Clarification
We offer a computational analysis of the resolution of ellipsis in certain cases of dialogue clarification. We show that this goes beyond standard techniques used in anaphora and ...
Jonathan Ginzburg, Robin Cooper
EACL
1993
ACL Anthology
13 years 8 months ago
A Discourse Copying Algorithm for Ellipsis and Anaphora Resolution
We give an analysis of ellipsis resolution in terms of a straightforward discourse copying algorithm that correctly predicts a wide range of phenomena. The treatment does not suff...
Andrew Kehler
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 1 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
CVPR
2012
IEEE
11 years 9 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...