Parsing with Lexicalized Probabilistic Recursive Transition Networks
Cached
Download Links
- [pageperso.lif.univ-mrs.fr]
- [www.cs.columbia.edu]
- DBLP
Other Repositories/Bibliography
by
Alexis Nasr
,
Owen Rambow
| Citations: | 3 - 2 self |
BibTeX
@MISC{Nasr_parsingwith,
author = {Alexis Nasr and Owen Rambow},
title = {Parsing with Lexicalized Probabilistic Recursive Transition Networks},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg from a syntactically annotated corpus, present a chart parser for gdg, and discuss different probabilistic models which are directly implemented in the finite automata and do not affect the parser. 1
