Efficient parsing for French

1Citations
Citations of this article
64Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Gardent, C., Bès, G. G., Jude, P. F., & Baschung, K. (1989). Efficient parsing for French. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1989-June, pp. 280–287). Association for Computational Linguistics (ACL). https://doi.org/10.3115/981623.981657

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free