Sciweavers

213 search results - page 5 / 43
» Experiments with Learning Parsing Heuristics
Sort
View
IJCNLP
2005
Springer
15 years 3 months ago
Heuristic Methods for Reducing Errors of Geographic Named Entities Learned by Bootstrapping
Abstract. One of issues in the bootstrapping for named entity recognition is how to control annotation errors introduced at every iteration. In this paper, we present several heuri...
Seungwoo Lee, Gary Geunbae Lee
ICML
1989
IEEE
15 years 1 months ago
Uncertainty Based Selection of Learning Experiences
The training experiences needed by a learning system may be selected by either an external agent or the system itself. We show that knowledge of the current state of the learner&#...
Paul D. Scott, Shaul Markovitch
ECML
2006
Springer
15 years 1 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
AIIA
1995
Springer
15 years 1 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung
ICML
2002
IEEE
15 years 10 months ago
Pruning Improves Heuristic Search for Cost-Sensitive Learning
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
Valentina Bayer Zubek, Thomas G. Dietterich