Know when to hold 'em: shuffling deterministically in a parser for nonconcatenative grammars

Authors:
Robert T. Kasper;Mike Calcagno;Paul C. Davis
Affiliations:
Ohio State University, Columbus, OH;Ohio State University, Columbus, OH;Ohio State University, Columbus, OH
Venue:
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Year:
1998

Citing 4
Cited 1

PROLOG and Natural Language Analysis

PROLOG and Natural Language Analysis
An efficient implementation of the head-corner parser

Computational Linguistics
Parsing with discontinuous constituents

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Head corner parsing for discontinuous constituency

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics

Introduction to this Special Issue

Natural Language Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nonconcatenative constraints, such as the shuffle relation, are frequently employed in grammatical analyses of languages that have more flexible ordering of constituents than English. We show how it is possible to avoid searching the large space of permutations that results from a nondeterministic application of shuffle constraints. The results of our implementation demonstrate that deterministic application of shuffle constraints yields a dramatic improvement in the overall performance of a head-corner parser for German using an HPSG-style grammar.