Sciweavers

360 search results - page 17 / 72
» Dependency Parsing
Sort
View
LREC
2010
180views Education» more  LREC 2010»
13 years 11 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...
LREC
2008
180views Education» more  LREC 2008»
13 years 11 months ago
MaltEval: an Evaluation and Visualization Tool for Dependency Parsing
This paper presents a freely available evaluation tool for dependency parsing, MaltEval (http://w3.msi.vxu.se/users/jni/malteval). It is flexible and extensible, and provides func...
Jens Nilsson, Joakim Nivre
ACL
2007
13 years 11 months ago
K-best Spanning Tree Parsing
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...
Keith Hall
EMNLP
2007
13 years 11 months ago
Fast and Robust Multilingual Dependency Parsing with a Generative Latent Variable Model
We use a generative history-based model to predict the most likely derivation of a dependency parse. Our probabilistic model is based on Incremental Sigmoid Belief Networks, a rec...
Ivan Titov, James Henderson
ACL
2009
13 years 8 months ago
Non-Projective Dependency Parsing in Expected Linear Time
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
Joakim Nivre