| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wolfs (0) - 9 freq wolf's (1) - 4 freq woufs (1) - 1 freq wowfs (1) - 3 freq wulfs (1) - 2 freq wolf (1) - 91 freq wolfe (1) - 3 freq coles (2) - 4 freq toffs (2) - 13 freq doles (2) - 1 freq bolts (2) - 12 freq wots (2) - 3 freq polis (2) - 261 freq olds (2) - 3 freq boles (2) - 1 freq wilfu (2) - 1 freq wiles (2) - 11 freq woll (2) - 1 freq roofs (2) - 11 freq elfs (2) - 1 freq wyles (2) - 2 freq wos (2) - 2 freq oafs (2) - 1 freq lolls (2) - 2 freq loufs (2) - 1 freq |
wolfs (0) - 9 freq wulfs (1) - 2 freq wolfe (2) - 3 freq wolf (2) - 91 freq woufs (2) - 1 freq wolf's (2) - 4 freq wowfs (2) - 3 freq wolves (3) - 26 freq wylds (3) - 1 freq wells (3) - 19 freq wilds (3) - 7 freq wolfie (3) - 5 freq walks (3) - 97 freq wales (3) - 37 freq wolfi's (3) - 1 freq delfs (3) - 1 freq woolfe (3) - 1 freq wels (3) - 5 freq walls (3) - 27 freq wouffs (3) - 1 freq wls (3) - 1 freq wolfit (3) - 1 freq wulls (3) - 2 freq waifs (3) - 1 freq waffs (3) - 7 freq |
SoundEx code - W412 weil-fesst-up - 1 freq wolves - 26 freq wolfie's - 2 freq wolf's - 4 freq wolfgang - 1 freq wolfi's - 1 freq weelbuikit - 1 freq wulfs - 2 freq wallops - 2 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 - 26 freq wolfie's - 2 freq wolf's - 4 freq wolfi's - 1 freq wulfs - 2 freq wolfs - 9 freq |
WOLFS |
| Time to execute Levenshtein function - 0.192307 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.350207 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.030288 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.038681 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.000827 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. |