Sciweavers

1229 search results - page 7 / 246
» A New Method for Dependent Parsing
Sort
View
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 7 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
ACL
2004
13 years 9 months ago
Deep Dependencies from Context-Free Statistical Parsers: Correcting the Surface Dependency Approximation
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based...
Roger Levy, Christopher D. Manning
EMNLP
2009
13 years 5 months ago
An Empirical Study of Semi-supervised Structured Conditional Models for Dependency Parsing
This paper describes an empirical study of high-performance dependency parsers based on a semi-supervised learning approach. We describe an extension of semisupervised structured ...
Jun Suzuki, Hideki Isozaki, Xavier Carreras, Micha...
AI
2002
Springer
13 years 7 months ago
A Constructive Approach to Parsing with Neural Networks - The Hybrid Connectionist Parsing Method
The concept of Dynamic Neural Networks (DNN) is a new approach within the Neural Network paradigm, which is based on the dynamic construction of Neural Networks during the processi...
Christel Kemke
COLING
2008
13 years 9 months ago
Robust and Efficient Chinese Word Dependency Analysis with Linear Kernel Support Vector Machines
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...
Yu-Chieh Wu, Jie-Chi Yang, Yue-Shi Lee