Tree Insertion Grammar: A Cubic-Time, Parsable Formalism that Lexicalizes Context-Free Grammar without Changing the Trees Produced (1994)
by
Yves Schabes
,
Richard C. Waters
| Venue: | Computational Linguistics |
| Citations: | 69 - 1 self |
BibTeX
@ARTICLE{Schabes94treeinsertion,
author = {Yves Schabes and Richard C. Waters},
title = {Tree Insertion Grammar: A Cubic-Time, Parsable Formalism that Lexicalizes Context-Free Grammar without Changing the Trees Produced},
journal = {Computational Linguistics},
year = {1994},
volume = {21}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, we study the problem of lexicalizing context-free grammars and show that it enables faster processing. In previous attempts to take advantage of lexicalization, a variety of lexicalization procedures have been developed that convert context-free grammars (CFGs) into equivalent lexicalized grammars. However, these procedures typically suffer from one or more of the following problems
