Sciweavers

5 search results - page 1 / 1
» Parsing to Stanford Dependencies: Trade-offs between Speed a...
Sort
View
LREC
2010
180views Education» more  LREC 2010»
13 years 6 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...
CVPR
2008
IEEE
14 years 6 months ago
Order consistent change detection via fast statistical significance testing
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
Maneesh Singh, Vasu Parameswaran, Visvanathan Rame...
ACL
1996
13 years 5 months ago
A New Statistical Parser Based on Bigram Lexical Dependencies
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniqu...
Michael Collins
COLING
2010
12 years 11 months ago
2D Trie for Fast Parsing
In practical applications, decoding speed is very important. Modern structured learning technique adopts template based method to extract millions of features. Complicated templat...
Xian Qian, Qi Zhang, Xuanjing Huang, Lide Wu
EMNLP
2011
12 years 4 months ago
Lateen EM: Unsupervised Training with Multiple Objectives, Applied to Dependency Grammar Induction
We present new training methods that aim to mitigate local optima and slow convergence in unsupervised training by using additional imperfect objectives. In its simplest form, lat...
Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jura...