Sciweavers

135 search results - page 19 / 27
» A Deductive Approach to Dependency Parsing
Sort
View
134
Voted
ACL
2003
15 years 5 months ago
Accurate Unlexicalized Parsing
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
Dan Klein, Christopher D. Manning
250
Voted
NLP
2000
15 years 7 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
110
Voted
EMNLP
2010
15 years 1 months ago
Using Universal Linguistic Knowledge to Guide Grammar Induction
We present an approach to grammar induction that utilizes syntactic universals to improve dependency parsing across a range of languages. Our method uses a single set of manually-...
Tahira Naseem, Harr Chen, Regina Barzilay, Mark Jo...
169
Voted
INTERSPEECH
2010
14 years 10 months ago
Memory-based active learning for French broadcast news
Stochastic dependency parsers can achieve very good results when they are trained on large corpora that have been manually annotated. Active learning is a procedure that aims at r...
Frédéric Tantini, Christophe Cerisar...
135
Voted
FASE
2006
Springer
15 years 7 months ago
A Graph-Based Approach to Transform XML Documents
Abstract. As XML diffusion keeps increasing, it is today common practice for most developers to deal with XML parsing and transformation. XML is used as format to e.g. render data,...
Gabriele Taentzer, Giovanni Toffetti Carughi