Sciweavers

573 search results - page 2 / 115
» Probabilistic Parsing Strategies
Sort
View
EMNLP
2006
13 years 7 months ago
Is it Really that Difficult to Parse German?
This paper presents a comparative study of probabilistic treebank parsing of German, using the Negra and T
Sandra Kübler, Erhard W. Hinrichs, Wolfgang M...
ECML
2007
Springer
13 years 11 months ago
Probabilistic Models for Action-Based Chinese Dependency Parsing
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
Xiangyu Duan, Jun Zhao, Bo Xu
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 5 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
ANLP
2000
96views more  ANLP 2000»
13 years 7 months ago
Efficient parsing strategies for syntactic analysis of closed captions
We present an efficientmulti-levelchart parser that was designed forsyntacticanalysisofclosedcaptions (subtitles) in a real-time Machine Translation (MT) system. In order to achie...
Krzysztof Czuba
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 5 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson