2475 search results - page 21 / 495 » On the accuracy of language trees |
CC
2003
Springer
14 years 28 days ago
2003
Springer
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
JIIS
2008
13 years 7 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
EMNLP
2009
13 years 5 months ago
2009
Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing ap...