A Generalized Reconstruction Algorithm For Ellipsis Resolution

A Generalized Reconstruction Algorithm For Ellipsis Resolution (1996)

Cached

Download Links

[semantics.soas.ac.uk]
[das-www.harvard.edu]

Other Repositories/Bibliography

DBLP

by Shalom Lappin , Hsue-hueh Shih

Citations:

8 - 2 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Generalized Reconstruction Algorithm For Ellipsis Resolution	user correction - Legacy Corrections
AUTHOR NAME	Shalom Lappin	user correction - Legacy Corrections
AUTHOR NAME	Hsue-hueh Shih	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Linguistics; School of Oriental and African Studies; University of London	user correction - Legacy Corrections
AUTHOR ADDR	Thornhaugh Street, Russell Square; London WC1H OXG, UK	user correction - Legacy Corrections
ABSTRACT	We present an algorithm which assigns interpretations to several major types of ellipsis structures through a generalized procedure of syntactic reconstruction. Ellipsis structures are taken to be sequences of lexically realized arguments and/or adjuncts of an empty verbal head. Reconstruction is characterized as the specification of a (partial) correspondence relation between the unrealized head verb of an elided clause and its argument and adjuncts on one hand, and the head of a non-elided antecedent sentence and its arguments and adjuncts on the other. The algorithm generates appropriate interpretations for cases of VP ellipsis, pseudo-gapping, bare ellipsis (stripping), and gapping. It provides a uniform computational approach to a wide range of ellipsis phenomena, and it has significant advantages over several other approaches to ellipsis which have recently been suggested in the computational and linguistic literature. 1 Introduction Ellipsis structures pose an important proble...	user correction - Legacy Corrections
YEAR	1996	user correction - Legacy Corrections
CITATIONS	9 found	ParsCit 1.0