Sciweavers

5 search results - page 1 / 1
» Tree Topological Features for Unlexicalized Parsing
Sort
View
COLING
2010
12 years 11 months ago
Tree Topological Features for Unlexicalized Parsing
As unlexicalized parsing lacks word token information, it is important to investigate novel parsing features to improve the accuracy. This paper studies a set of tree topological ...
Samuel W. K. Chan, Lawrence Y. L. Cheung, Mickey W...
ACL
2006
13 years 6 months ago
Trace Prediction and Recovery with Unlexicalized PCFGs and Slash Features
This paper describes a parser which generates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guara...
Helmut Schmid
ACL
2009
13 years 2 months ago
Topological Field Parsing of German
Freer-word-order languages such as German exhibit linguistic phenomena that present unique challenges to traditional CFG parsing. Such phenomena produce discontinuous constituents...
Jackie Chi Kit Cheung, Gerald Penn
TSD
2007
Springer
13 years 11 months ago
Accurate Unlexicalized Parsing for Modern Hebrew
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
Reut Tsarfaty, Khalil Sima'an
EMNLP
2009
13 years 2 months ago
K-Best Combination of Syntactic Parsers
In this paper, we propose a linear model-based general framework to combine k-best parse outputs from multiple parsers. The proposed framework leverages on the strengths of previo...
Hui Zhang, Min Zhang, Chew Lim Tan, Haizhou Li