Lexicalized Context-Free Grammars

This paper introduces a tree generating system called Lexicalized Context-Free Grammar (LCFG) and describes a cubic-time parser for it. LCFG embeds the elegance of the analyses found in lexicalized tree-adjoining grammar without allowing for context-sensitive languages and therefore without requiring more computational resources than context-free grammars. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Resear...

• Type: Conference
• Year: 1993
• Where: ACL
• Authors: Yves Schabes, Richard C. Waters
• Keywords: ACL 1993, ACL 2007, Context-free Grammars, Electric Research Laboratories, Mitsubishi Electric Research