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

Weighted Levenshtein distance support #78

Open
albertoandreottiATgmail opened this issue Sep 18, 2018 · 2 comments
Open

Weighted Levenshtein distance support #78

albertoandreottiATgmail opened this issue Sep 18, 2018 · 2 comments

Comments

@albertoandreottiATgmail

Hello,

I wanted to know if the library has support to provide custom edit penalties. For example, specify edit distance for replacement "1" -> "l" to be different from "1" -> "A", etc.

Alberto.

@matanox
Copy link

matanox commented Sep 19, 2018

I don't believe so. If interested in small edit distances though, you may, depending on your scenario and data, accomplish the same effect by doing some math projecting to a max intended ordinary edit distance to use with this library, then proceeding to performing your nuanced weights/penalty scheme on the cohort that remains after using this library with your chosen first distance value.

I doubt you'd currently find any implementation that does, but this is an interesting project idea.

@roedoejet
Copy link

I don't believe so. If interested in small edit distances though, you may, depending on your scenario and data, accomplish the same effect by doing some math projecting to a max intended ordinary edit distance to use with this library, then proceeding to performing your nuanced weights/penalty scheme on the cohort that remains after using this library with your chosen first distance value.

I doubt you'd currently find any implementation that does, but this is an interesting project idea.

Interesting idea but assuming some substitutions could be made at low or zero cost, it would be difficult to estimate a correct 'max intended ordinary edit distance' in advance.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants