29 search results - page 2 / 6 » Global Learning of Labeled Dependency Trees |
EMNLP
2007
13 years 6 months ago
2007
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
PODS
2010
ACM
13 years 10 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
ECML
2007
Springer
13 years 11 months ago
2007
Springer
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...