论文信息 - Optimizing the Computational Lexicalization of Large Grammars

Optimizing the Computational Lexicalization of Large Grammars

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 NP-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.

Christian Jacquemin

[1] Christian Jacquemin,et al. Retrieving terms and their variants in a lexicalized unification-based framework , 1994, SIGIR '94.

[2] Rudolph Sommerhalder,et al. The theory of computability - programs, machines, effectiveness and feasibility , 1988, International computer science series.

[3] Aravind K. Joshi,et al. Parsing Strategies with ‘Lexicalized’ Grammars: Application to Tree Adjoining Grammars , 1988, COLING.

[4] Ivan A. Sag,et al. Information-based syntax and semantics , 1987 .

[5] Ivan A. Sag,et al. Information-Based Syntax and Semantics: Volume 1, Fundamentals , 1987 .

[6] Richard C. Waters,et al. Lexicalized Context-Free Grammars , 1993, ACL.

[7] Christian Jacquemin,et al. Transformations des noms composés , 1991 .

[8] Anne Abeillé,et al. Parsing Idioms in Lexicalized TAGs , 1989, EACL.