giacomocavalieri/edit_distance

📝 A pure Gleam package to compute the edit distance of two strings

edit_distance's Issues

[Feature] Allow computing normalized distances

Enable the option to compute the normalized distance, which returns a value between 0 and 1. A result of 0 indicates no similarity between the provided strings, while a result of 1 indicates a perfect match as determined by the similarity function. This feature could be useful when applying a threshold to determine whether two strings are sufficiently similar.

[Feature] Allow assigning different weights to edit operations

Possibly add the ability to apply different weights to each operation—such as insertion, deletion, substitution, transposition, etc. — when calculating string similarity. This would allow more granular control over the distance metric by giving more importance to certain operations based on the context.

[Feature] The Smith-Waterman Algorithm

The Smith-Waterman algorithm is essentially a paiwise sequence alignment algorithm typically used in bioinformatics to optimally align two (e.g. DNA) sequences.

The Smith-Waterman algorithm can be seen as a generalization of the edit distance and on the other hand the edit distance can be considered as a special case of the Smith-Waterman algorithm with specific scoring rules (giving specific weights to matching, mismatching string characters and gaps). There's more info here:

• wiki: https://en.m.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorithm
• an excellent python lib: https://biopython.org/docs/1.75/api/Bio.pairwise2.html