Levenstein automata for even moar perf?

[LifeIsStrange]

Describe what you are looking for

Noob question: would a levenstein automata in stringzilla allow for even faster fuzzy search?
https://blog.mikemccandless.com/2011/03/lucenes-fuzzyquery-is-100-times-faster.html?m=1
There is also https://arxiv.org/abs/1008.1191

Can you contribute to the implementation?

• I can contribute

Is your feature request specific to a certain interface?

It applies to everything

Contact Details

No response

Is there an existing issue for this?

• I have searched the existing issues

Code of Conduct

• I agree to follow this project's Code of Conduct

[ashvardanian]

Yes, @LifeIsStrange, absolutely, automata will be more efficient than our current algorithm. For the unbounded case they are often trickier to implement, so I didn’t rush that for now. Let me know, if you know someone curious to work on that 🤗