Long-distance dependencies and Applicative Universal Grammar

Authors:
Sebastian Shaumyan;Frédérique Segond
Affiliations:
Yale University;Rank Xerox Research Centre, France
Venue:
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Year:
1994

Citing 2
Cited 1

Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
Efficient processing of flexible categorial grammar

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics

Realization of natural language interfaces using lazy functional programming

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

To deal with long-distance dependencies, Applicative Universal Grammar (AUG) proposes a new type of categorial rules, called superposition rules. We compare the AUG rules with the alternative rules of Steedman's Combinatory Categorial Grammar (CCG) (Steedman, 1987, 1988, 1990; Szabolcsi, 1987; Ades and Steedman, 1982). In contrast to Steedman's rules, the AUG rules are free from inconsistencies in their semantic interpretation, free from spurious ambiguity. The superposition rules are based on the Theory of Type Superposition, established independently of the problem of long-distance dependencies and having a broad unifying power.