Richard C. Waters


pdf bib
Tree Insertion Grammar: A Cubic-Time, Parsable Formalism that Lexicalizes Context-Free Grammar without Changing the Trees Produced
Yves Schabes | Richard C. Waters
Computational Linguistics, Volume 21, Number 4, December 1995


Lexicalized Context-Fee Grammars
Yves Schabes | Richard C. Waters
31st Annual Meeting of the Association for Computational Linguistics

Stochastic Lexicalized Context-Free Grammar
Yves Schabes | Richard C. Waters
Proceedings of the Third International Workshop on Parsing Technologies

Stochastic lexicalized context-free grammar (SLCFG) is an attractive compromise between the parsing efficiency of stochastic context-free grammar (SCFG) and the lexical sensitivity of stochastic lexicalized tree-adjoining grammar (SLTAG) . SLCFG is a restricted form of SLTAG that can only generate context-free languages and can be parsed in cubic time. However, SLCFG retains the lexical sensitivity of SLTAG and is therefore a much better basis for capturing distributional information about words than SCFG.