Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Generalize skewed diagonal approach to rectangular matrices #78

Open
ashvardanian opened this issue Feb 7, 2024 · 0 comments
Open

Generalize skewed diagonal approach to rectangular matrices #78

ashvardanian opened this issue Feb 7, 2024 · 0 comments
Labels
core Work on the algorithm design and implementation good first issue Good for newcomers

Comments

@ashvardanian
Copy link
Owner

Currently, the anti-diagonal approach for Levenshtein distance is only implemented for square matrices.
It should be easy to generalize it to rectangular ones, opening opportunities for more aggressive vectorization.

// TODO: Generalize to remove the following asserts!
sz_assert(!bound && "For bounded search the method should only evaluate one band of the matrix.");
sz_assert(shorter_length == longer_length && "The method hasn't been generalized to different length inputs yet.");
sz_unused(longer_length && bound);

@ashvardanian ashvardanian added good first issue Good for newcomers core Work on the algorithm design and implementation labels Feb 7, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
core Work on the algorithm design and implementation good first issue Good for newcomers
Projects
None yet
Development

No branches or pull requests

1 participant