170 search results - page 5 / 34 » Minimizing Weighted Tree Grammars Using Simulation |
102
Voted
PR
2007
15 years 19 days ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
121
Voted
COLING
2002
15 years 29 days ago
2002
Today there is a relatively large body of work on automatic acquisition of lexicosyntactical preferences (subcategorization) from corpora. Various techniques have been developed t...
109
Voted
CAI
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
ICPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
108
Voted
HICSS
2008
IEEE
15 years 1 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...