Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
weel-aff (0) - 28 freq weelaff (1) - 1 freq wan-aff (3) - 2 freq weel-fed (3) - 2 freq sealt-aff (3) - 1 freq weel-on (3) - 1 freq weel-cut (3) - 1 freq one-aff (3) - 1 freq weel-faur (3) - 1 freq weel-noo (3) - 1 freq tirl-aff (3) - 1 freq weel-rade (3) - 1 freq weel-sawn (3) - 1 freq send-aff (3) - 1 freq well-ah (3) - 1 freq weelcam (3) - 2 freq weel- (3) - 1 freq weel-made (3) - 1 freq ill-aff (3) - 6 freq ane-aff (3) - 4 freq weelfare (3) - 2 freq weelads (3) - 1 freq weelass (3) - 2 freq waff (4) - 19 freq wan-off (4) - 1 freq |
weel-aff (0) - 28 freq weelaff (2) - 1 freq ill-aff (4) - 6 freq weel-fed (4) - 2 freq weel-faur (4) - 1 freq wan-aff (4) - 2 freq weel- (5) - 1 freq wan-off (5) - 1 freq weel-rade (5) - 1 freq weelfare (5) - 2 freq ane-aff (5) - 4 freq weel-made (5) - 1 freq weel-cut (5) - 1 freq sealt-aff (5) - 1 freq weel-on (5) - 1 freq one-aff (5) - 1 freq weel-noo (5) - 1 freq tirl-aff (5) - 1 freq weff (6) - 1 freq weil- (6) - 1 freq weel-used (6) - 1 freq rin-aff (6) - 1 freq welfare (6) - 21 freq weel-usit (6) - 1 freq play-off (6) - 1 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 |
WEEL-AFF |
Time to execute Levenshtein function - 0.208896 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.354096 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.027887 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.037443 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.000900 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. |