Sciweavers

282 search results - page 4 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
COLING
2008
15 years 1 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
ECML
2006
Springer
15 years 3 months ago
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
Alessandro Moschitti
EMNLP
2007
15 years 1 months ago
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
Luke S. Zettlemoyer, Michael Collins
ACL
2010
14 years 9 months ago
Transition-Based Parsing with Confidence-Weighted Classification
We show that using confidence-weighted classification in transition-based parsing gives results comparable to using SVMs with faster training and parsing time. We also compare wit...
Martin Haulrich
ACL
2012
13 years 2 months ago
Selective Sharing for Multilingual Dependency Parsing
We present a novel algorithm for multilingual dependency parsing that uses annotations from a diverse set of source languages to parse a new unannotated language. Our motivation i...
Tahira Naseem, Regina Barzilay, Amir Globerson