Efficient parsing for French

Authors:
Claire Gardent;Gabriel G. Bès;Pierre-François Jurie;Karine Baschung
Affiliations:
University Blaise Pascal - Clermont II and University of Edinburgh, Edinburgh, Scotland, UK;Université Blaise Pascal - Clermont II, Clermont-Ferrand, France;Université Blaise Pascal - Clermont II, Clermont-Ferrand, France;Université Blaise Pascal - Clermont II, Clermont-Ferrand, France
Venue:
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Year:
1989

Citing 4
Cited 1

Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
French order without order

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Predictive combinators: a method for efficient processing of combinatory Categorial Grammars

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A lazy way to chart-parse with Categorial Grammars

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics

Generating from a deep structure

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parsing with categorial grammars often leads to problems such as proliferating lexical ambiguity, spurious parses and overgeneration. This paper presents a parser for French developed on an unification based categorial grammar (FG) which avoids these problems. This parser is a bottom-up chart parser augmented with a heuristic eliminating spurious parses. The unicity and completeness of parsing are proved.