Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wolf (0) - 91 freq wouf (1) - 12 freq wolfs (1) - 9 freq golf (1) - 61 freq wolfe (1) - 3 freq rolf (1) - 1 freq woll (1) - 1 freq wulf (1) - 6 freq wold (1) - 1 freq wowf (1) - 2 freq woof (1) - 21 freq loof (2) - 21 freq of (2) - 4012 freq wuli (2) - 1 freq wooly (2) - 7 freq wild (2) - 236 freq wop (2) - 1 freq goaf (2) - 1 freq wolfit (2) - 1 freq won (2) - 282 freq off (2) - 542 freq gol' (2) - 1 freq odf (2) - 1 freq orf (2) - 20 freq wif (2) - 1 freq |
wolf (0) - 91 freq wolfe (1) - 3 freq wulf (1) - 6 freq woof (2) - 21 freq wowf (2) - 2 freq wilfu (2) - 1 freq wolfie (2) - 5 freq wold (2) - 1 freq woolfe (2) - 1 freq woll (2) - 1 freq wouf (2) - 12 freq golf (2) - 61 freq wolfs (2) - 9 freq rolf (2) - 1 freq loaf (3) - 81 freq wwf (3) - 1 freq helf (3) - 2 freq would (3) - 690 freq wale (3) - 34 freq wle (3) - 1 freq welp (3) - 1 freq awol (3) - 9 freq wile (3) - 164 freq wlo (3) - 1 freq ulf (3) - 4 freq |
SoundEx code - W410 wolfe - 3 freq wolf - 91 freq wolfie - 5 freq whalp - 11 freq wullfu - 1 freq wallop - 11 freq weel-aff - 28 freq wulf - 6 freq weelaff - 1 freq wallopy - 1 freq whelp - 1 freq waallop - 1 freq wilfu - 1 freq willfu - 1 freq walop - 1 freq welp - 1 freq wullybh - 1 freq woolfe - 1 freq |
MetaPhone code - WLF wolfe - 3 freq wolf - 91 freq wolfie - 5 freq wullfu - 1 freq weel-aff - 28 freq wulf - 6 freq weelaff - 1 freq wilfu - 1 freq willfu - 1 freq woolfe - 1 freq |
WOLF |
Time to execute Levenshtein function - 0.186492 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.345618 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.034800 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.039099 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.000849 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. |