2006
DOI: 10.1007/11780885_16
|View full text |Cite
|
Sign up to set email alerts
|

Parsing with Lexicalized Probabilistic Recursive Transition Networks

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2009
2009

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…We parse all of the translated sentences in Ghmt, GhPhar, and Pharaoh in addition to all the references for all the studied test sets. We use the MICA dependency parser (Nasr and Rambow 2006). The translational SB precision is computed as follows: for each SB in the translated output, we consider a match to be present if the same SB appears in any of the references.…”
Section: Span-specific Syntactic Dependency Precision Evaluationmentioning
confidence: 99%
“…We parse all of the translated sentences in Ghmt, GhPhar, and Pharaoh in addition to all the references for all the studied test sets. We use the MICA dependency parser (Nasr and Rambow 2006). The translational SB precision is computed as follows: for each SB in the translated output, we consider a match to be present if the same SB appears in any of the references.…”
Section: Span-specific Syntactic Dependency Precision Evaluationmentioning
confidence: 99%