282 search results - page 12 / 57 » Online Learning of Approximate Dependency Parsing Algorithms |
NECO
2008
13 years 7 months ago
2008
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
FUIN
2006
13 years 7 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Consider the online regression problem where the dependence of the outcome yt on the signal xt changes with time. Standard regression techniques, like Ridge Regression, d...
NLP
2000
13 years 11 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
VLDB
2006
ACM
14 years 7 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...