Skip to content

Generalize skewed diagonal approach to rectangular matrices #78

Open
@ashvardanian

Description

@ashvardanian

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);

Metadata

Metadata

Assignees

No one assigned

    Labels

    coreWork on the algorithm design and implementationgood first issueGood for newcomers

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions