Sciweavers

675 search results - page 26 / 135
» On Compression of Parse Trees
Sort
View
FSMNLP
2009
Springer
13 years 5 months ago
Minimizing Weighted Tree Grammars Using Simulation
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
Andreas Maletti
COLING
2010
13 years 2 months ago
Learning the Scope of Negation via Shallow Semantic Parsing
In this paper we present a simplified shallow semantic parsing approach to learning the scope of negation (SoN). This is done by formulating it as a shallow semantic parsing probl...
Junhui Li, Guodong Zhou, Hongling Wang, Qiaoming Z...
ACL
2009
13 years 5 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
FOSSACS
2009
Springer
14 years 2 months ago
Parameter Reduction in Grammar-Compressed Trees
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
LREC
2010
154views Education» more  LREC 2010»
13 years 9 months ago
Statistical French Dependency Parsing: Treebank Conversion and First Results
We first describe the automatic conversion of the French Treebank (Abeill
Marie Candito, Benoît Crabbé, Pascal ...