fastr
fastr copied to clipboard
Implement the `adist` builtin
From the documentation: Compute the approximate string distance between character vectors. The distance is a generalized Levenshtein (edit) distance, giving the minimal possibly weighted number of insertions, deletions and substitutions needed to transform one string into another.
Hi! Could I have this issue assigned to me?
Hello, sure :+1: