Constituent coordination in Lexical-Functional Grammar

Kaplan, Ronald M.; Maxwell, John T.

doi:10.3115/991635.991696

Cited by 44 publications

(22 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(3) a. Kim grew lAP wealthy]/* [Np a Republican] 2Note that the LFG account of coordination provided by Kaplan and Maxwell (1988) differs significantly from both the generalization and the subsumption accounts of coordination just mentioned, and does not generate the incorrect predictions described below. Our LCG account analyses these constructions in a similar way.…”

Section: Coordination and Agreement Asymmetriesmentioning

confidence: 99%

Features and agreement

Bayer

Johnson

1995

Proceedings of the 33rd Annual Meeting on Association for Computational Linguistics -

View full text Add to dashboard Cite

show abstract

Section: Coordination and Agreement Asymmetriesmentioning

confidence: 99%

Features and agreement

Bayer

Johnson

1995

Proceedings of the 33rd Annual Meeting on Association for Computational Linguistics -

View full text Add to dashboard Cite

show abstract

“…In this paper we investigate the expressivity of an additional feature term form that is known as functional uncertainty [7,8] and was invented for the convenient description of so-called long-distance dependencies in the gram-.mar formalism LFG [6]. It takes the form…”

Section: Contentsmentioning

confidence: 99%

On the expressivity of feature logics with negation, functional uncertainty, and sort equations

Baader

B�rckert²,

Nebel

et al. 1993

J Logic Lang Inf

View full text Add to dashboard Cite

Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional uncertainty construct needed for the description of long-distance dependencies and obtain the following results: satisfiability of feature terms is undecidable, sort equations can be internalized, consistency of sort equations is decidable if there is at least one atom, and consistency of sort equations is undecidable if t here is no atom.

show abstract

“…The main attempts to take complex coordinated structures into account are found in formal grammar-based approaches of parsing [10,5,9,1,7,8], using one of two ways:…”

Section: Introductionmentioning

confidence: 99%

Parsing Coordination Extragrammatically

Dufour-Lussier

Guillaume

Perrier

2014

Human Language Technology Challenges for Computer Science and Linguistics

View full text Add to dashboard Cite

We propose to process coordination at the parsing level as a linguistic performance issue, outside the grammar, rather than as a matter of competence. We apply a specific algorithm to combine coordinated syntactic structures that were partially parsed using a coordinationless grammar, resulting in a directed acyclic parse graph in which constituent sharing appears sharply. This article presents an algorithm working within the framework of tree-adjoining grammars (although it can be adapted to other formalisms) that is able to handle many types of coordinating constructions, including left and right node raising, argument clusters, and verb gapping.

show abstract

Constituent coordination in Lexical-Functional Grammar

Cited by 44 publications

References 6 publications

Features and agreement

Features and agreement

On the expressivity of feature logics with negation, functional uncertainty, and sort equations

Parsing Coordination Extragrammatically

Contact Info

Product

Resources

About