| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wolves (0) - 27 freq wouves (1) - 1 freq solves (1) - 3 freq wove (2) - 9 freq salves (2) - 2 freq yoles (2) - 9 freq olives (2) - 17 freq woes (2) - 5 freq roves (2) - 1 freq wolfe (2) - 3 freq holes (2) - 73 freq roles (2) - 12 freq volvos (2) - 1 freq wyves (2) - 1 freq solve (2) - 9 freq wiles (2) - 11 freq wones (2) - 1 freq doles (2) - 1 freq poles (2) - 30 freq moles (2) - 2 freq wulver (2) - 1 freq wales (2) - 39 freq moves (2) - 32 freq folies (2) - 1 freq oolies (2) - 1 freq |
wolves (0) - 27 freq wouves (2) - 1 freq solves (2) - 3 freq loves (3) - 68 freq weles (3) - 1 freq calves (3) - 5 freq wolfs (3) - 9 freq wyles (3) - 2 freq wales (3) - 39 freq selves (3) - 4 freq twelves (3) - 1 freq evolves (3) - 1 freq wives (3) - 42 freq waves (3) - 139 freq loaves (3) - 5 freq woolies (3) - 2 freq weaves (3) - 9 freq halves (3) - 1 freq wulver (3) - 1 freq waives (3) - 1 freq elves (3) - 10 freq olives (3) - 17 freq wiles (3) - 11 freq salves (3) - 2 freq wyves (3) - 1 freq |
SoundEx code - W412 weil-fesst-up - 1 freq wolves - 27 freq wolfie's - 2 freq wolf's - 4 freq wolfgang - 1 freq wolfi's - 1 freq weelbuikit - 1 freq wulfs - 2 freq wallops - 3 freq wolfskin - 2 freq wolfston's - 1 freq wolfston - 1 freq weel-biggit - 3 freq wolf-whistlin - 2 freq wolfs - 9 freq whalps - 3 freq whalp's - 1 freq whaalbacks - 1 freq well-upfeshed - 1 freq wolfish - 1 freq wolfcleuch - 7 freq welovehistory - 2 freq willy-fisher - 1 freq |
MetaPhone code - WLFS wolves - 27 freq wolfie's - 2 freq wolf's - 4 freq wolfi's - 1 freq wulfs - 2 freq wolfs - 9 freq |
WOLVES |
| Time to execute Levenshtein function - 0.194457 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.345089 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.028670 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037234 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000871 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |