apted
apted copied to clipboard
Python APTED algorithm for the Tree Edit Distance
Hi there Thanks for your excellent repo! My question is that if I want to normalize the computed tree edit distance into a certain range (e.g., between 0 and 1),...
Hello! Thank you for making this! Do you happen to have a programmatic hello world example? I want to try the algorithm, but I'm not sure how to go about...
My tree is include dict and list, for example: data1 = {"a": [{"b": []}, {"c": [{"h":[]}]}]}, data2 = {"a": [{"b": [{"m":[]}]}, {"c": [{"h":[{"k":[]}]}]}]}, the edit distance always 1. The code:...
I am trying to use this library to compare ASTs of python code (specifically, I'm comparing an incorrect solution to a problem with several correct solutions, to pick a closest...
Great package that is already the fastest python implementation as far as I know. Still, are there plans to use C code to speed up computations, similar to how Levenstheins...
I have the following two trees: ``` tree1 = "{t{tr{td}{td}}{tr{td}{td}{td}}{tr{td}{td}{td}}{tr{td}{td}{td}}{tr{td}{td}{td}}{tr{td}{td}{td}}{tr{td}{td}{td}}{tr{td}{td}{td}}{tr{td}{td}{td}}{tr{td}{td}{td}}{tr{td}{td}{td}}}" tree2 = "{t{tr{td}{td}{td}{td}{td}{td}}{tr{td}{td}{td}{td}{td}{td}}{tr{td}{td}{td}{td}{td}{td}}{tr{td}{td}{td}{td}{td}{td}}{tr{td}{td}{td}{td}{td}{td}}}" tree1 = Tree.from_text(tree1) tree2 = Tree.from_text(tree2) apted = APTED(tree1, tree2) dist = apted.compute_edit_distance() ``` The distance between...