P03-1029 |
for his implementation of the
|
subtree discovery
|
algorithm and the anonymous reviewers
|
D11-1075 |
given domain based on frequent
|
subtree discovery
|
in dependency parse trees . These
|
W09-3212 |
of the output , one way to keep
|
subtree discovery
|
within manageable bounds is to
|
W09-3212 |
that this type of approach to
|
subtree discovery
|
has runtime bounds proportionate
|
P03-1029 |
The right-most expansion base
|
subtree discovery
|
algorithm ( Abe et al. , 2002
|
W09-3212 |
2003 ) . Research on frequent
|
subtree discovery
|
generally draws heavily on early
|
W10-3713 |
. 2 Varro Toolkit for Frequent
|
Subtree Discovery
|
The Varro toolkit is an open-source
|