Parsing with Lexicalized Probabilistic Recursive Transition Networks

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.

• Type: Conference
• Year: 2005
• Where: FSMNLP
• Authors: Alexis Nasr, Owen Rambow
• Keywords: Different Probabilistic Models, FSMNLP 2005, Generative Dependency Grammar, Natural Language Processing, Recursive Transition Networks