[recommenders-dev] [subwords] new algorithm

[Marcel Bruch <marcel.bruch@xxxxxxxxx>]

Hi subwords users,

this goes out to subwords users on this list: In close collaboration with Deepak (JDT) I've written a new matching algorithm for subwords. It's not based on matching bigrams anymore but searches for the best (longest continuous) subsequences in the completion string. Furthermore, subsequences need to match word boundaries.

For examples and discussion of these features, please check:

https://bugs.eclipse.org/bugs/show_bug.cgi?id=377333
https://bugs.eclipse.org/bugs/show_bug.cgi?id=376674
https://bugs.eclipse.org/bugs/show_bug.cgi?id=364083


I'd be glad if users of subwords would update and let me know if they like these changes.

Thanks,
Marcel