SIMD-accelerated Levenshtein/restricted Damerau-Levenshtein distance/etc.

rair-project / rair

RAIR: RAdare In Rust

GNU Lesser General Public License v3.0

71 stars 12 forks source link

SIMD-accelerated Levenshtein/restricted Damerau-Levenshtein distance/etc. #88

Closed Daniel-Liu-c0deb0t closed 4 years ago

Daniel-Liu-c0deb0t commented 4 years ago

Hello, I was looking through BK-tree implementations and I found your rtrees library. I am working on efficient edit distance calculations through SIMD in my library here, and I was wondering whether you were interested in adding some additional edit distance metrics for the BK-tree implementation. I think it would be an interesting addition, and I would be willing to work on a pull request.

oddcoder commented 4 years ago

Hello, That would very nice addition, feel free to do so! looking forward for your pull request.

Daniel-Liu-c0deb0t commented 4 years ago

I am a bit busy right now, but I will do a PR soon. I am curious: how is rtrees used in RAIR? I am familiar with the trees, but not with the overall project that they seem to be part of.

oddcoder commented 4 years ago

The Augmented RBtree itself is not directly used, but it is used to create interval search tree. IST is used as data structure for memory regions mapping / unmapping. The BKTree is used to create fuzzy search for commands as in the screenshot

Daniel-Liu-c0deb0t commented 4 years ago

I see, thank you for the explanation!