PLTIG Parsing (2005)
by
Winston Cheng, et al.
BibTeX
@MISC{Cheng05pltigparsing,
author = {Winston Cheng and et al.},
title = {PLTIG Parsing},
year = {2005}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe the TIG formalism and its advantages over CFGs and TAGs. We then give an algorithm for training PLTIGs following Hwa (2001). We train on a partially supervised corpus by repeated parsing with a lexicalized normal form. The training algorithm is EM-style, and the parsing algorithm is a generalization of CKY. Finally, we look toward the possibility of extending this method into a synchronous form.
Citations
| 549 | Tree-adjoining grammars - Joshi, Schabes - 1997 |
| 279 | Tree adjunct grammars - Joshi, Levy, et al. - 1975 |
| 69 | Tree Insertion Grammar: A Cubic-Time Parsable Formalism that Lexicalizes ContextFree Grammar without Changing the Tree Produced. Technical Report TR-94-13, Mitsubishi Electric Research Laboratories. A Parameters of PLTIG Each elementary tree of a Probabil - Schabes, Waters - 1994 |
| 46 | Multitext grammars and synchronous parsers - Melamed - 2003 |
| 36 | Global thresholding and multiple-pass parsing - Goodman - 1997 |
| 30 | A statistical approach to machine translation - Lafferty, Roossin - 1990 |
| 8 | Learning Probabilistic Lexicalized Grammars for Natural Language Processing - Hwa - 2001 |
