Corpus-based grammar specialization

Authors:
Nicola Cancedda;Christer Samuelsson
Affiliations:
Xerox Research Centre Europe, Meylan, France;Xerox Research Centre Europe, Meylan, France
Venue:
ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
Year:
2000

Citing 3
Cited 2

Experiments with corpus-based LFG specialization

ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Grammar specialization through entropy thresholds

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Fast parsing using pruning and grammar specialization

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics

Inferring Attribute Grammars with Structured Data for Natural Language Processing

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning computational grammars

ConLL '01 Proceedings of the 2001 workshop on Computational Natural Language Learning - Volume 7

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broad-coverage grammars tend to be highly ambiguous. When such grammars are used in a restricted domain, it may be desirable to specialize them, in effect trading some coverage for a reduction in ambiguity. Grammar specialization is here given a novel formulation as an optimization problem, in which the search is guided by a global measure combining coverage, ambiguity and grammar size. The method, applicable to any unification grammar with a phrase-structure backbone, is shown to be effective in specializing a broad-coverage LFG for French.