Comparatives and ellipsis

Authors:
S. G. Pulman
Affiliations:
University of Cambridge Computer Laboratory
Venue:
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Year:
1991

Citing 5
Cited 4

An implementable semantics for comparative constructions

Computational Linguistics
Resolving Quasi Logical Forms

Computational Linguistics
Logical Forms in the core language engine

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Quantifier scoping in the SRI core language engine

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
A general computational treatment of comparatives for natural language question answering

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics

Bidirectional contextual resolution

Computational Linguistics
Generic NPs and habitual VPs

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Conversational querying

Information Systems
Conversational querying

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper analyses the syntax and semantics of English comparatives, and some types of ellipsis. It improves on other recent analyses in the computational linguistics literature in three respects: (i) it uses no tree- or logical-form rewriting devices in building meaning representations (ii) this results in a fully reversible linguistic description, equally suited for analysis or generation (iii) the analysis extends to types of elliptical comparative not elsewhere treated.