Paper: Optimizing The Computational Lexicalization Of Large Grammars

ACL ID P94-1027
Title Optimizing The Computational Lexicalization Of Large Grammars
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1994
Authors

The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filtering during parsing. This problem is N P-complete and untractable on large grammars. An approximation algorithm is presented. The quality of the suboptimal solution is evaluated on real-world grammars as well as on randomly generated ones.