Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

ACL
1992

favoriteEmaildiscussreport

107views Computational Linguistics» more ACL 1992»

An Algorithm for VP Ellipsis

13 years 6 months ago

An Algorithm for VP Ellipsis

Download www.aclweb.org

An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents, and then imposes a preference ordering on possible antecedents. The algorithm performs with 94% accuracy on a set of 304 examples of VP ellipsis collected from the Brown Corpus. The problem of determining antecedents for VP ellipsis has received little attention in the literature, and it is shown that the current proposal is a significant improvement over alternative approaches.

Daniel Hardt

Real-time Traffic

ACL 1992 | ACL 2007 | Algorithm | Impossible Antecedents | Vp Ellipsis |

claim paper

Related Content

» Generation of VP Ellipsis A CorpusBased Approach

» A Theory of Parallelism and the Case of VP Ellipsis

» A unificationbased approach to multiple VP Ellipsis resolution

» VP Ellipsis in a DRTimplementation

» Some Problematic Cases of VP Ellipsis

» VP Ellipsis and Contextual Interpretation

» Virtual path control for ATM networks with call level quality of service guarantees

» Generalised Vector Precoding Design Based on the MBER Criterion for Multiuser Transmission

» Bounded Flooding Routing Algorithm for Provisioning the Globally Optimal Route in a Hierar...

Post Info
More Details (n/a)

Added	06 Nov 2010
Updated	06 Nov 2010
Type	Conference
Year	1992
Where	ACL
Authors	Daniel Hardt

Comments (0)