Sciweavers

2750 search results - page 2 / 550
» Learning Efficient Parsing
Sort
View
ECML
2006
Springer
13 years 11 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
ACL
2008
13 years 9 months ago
Semi-Supervised Convex Training for Dependency Parsing
We present a novel semi-supervised training algorithm for learning dependency parsers. By combining a supervised large margin loss with an unsupervised least squares loss, a discr...
Qin Iris Wang, Dale Schuurmans, Dekang Lin
NAACL
2010
13 years 5 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
CORR
1999
Springer
81views Education» more  CORR 1999»
13 years 7 months ago
Explanation-based Learning for Machine Translation
In this paper we present an application of explanation-based learning (EBL) in the parsing module of a real-time English-Spanish machine translation system designed to translate c...
Janine Toole, Fred Popowich, Devlan Nicholson, Dav...
EMNLP
2004
13 years 8 months ago
Max-Margin Parsing
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
Ben Taskar, Dan Klein, Mike Collins, Daphne Koller...