16430 search results - page 179 / 3286 » On Computable Tree Functions |
133
click to vote
ACL
2011
14 years 7 months ago
2011
This work introduces a new approach to checking treebank consistency. Derivation trees based on a variant of Tree Adjoining Grammar are used to compare the annotation of word sequ...
125
Voted
ICCBR
2007
Springer
15 years 10 months ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
173
click to vote
FLOPS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
151
Voted
IFL
2005
Springer
15 years 9 months ago
2005
Springer
Polytypic functional programming has the advantage that it can derive code for generic functions automatically. However, it is not clear whether it is useful for anything other tha...
144
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...