Description Usage Arguments Details Value References Examples
Compute tree similarity
1 |
t1 |
A TreeHarp object. |
t2 |
A TreeHarp object. |
verbose |
A logical value, indicating if the output should be verbose. |
As far as possible, this function tries to do things recursively.
It sets up a n x m matrix and fills up as much as it can. Then it uses
recursive relationships to fill in the rest. When it cannot, it uses
generate_all_subtrees
to generate and count common subtrees.
An integer, that counts the number of sub-trees in common between the two trees. Please see the reference papers for more information.
Convolution kernels for natural language, M Collins and N Duffy, Advances in neural information processing systems, 2002.
Convolution kernels on discrete structures, D Haussler, Technical report, Department of Computer Science, UC Santa Cruz, 1999.
1 2 3 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.