| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| welcomin (0) - 8 freq walcomin (1) - 5 freq welcomin' (1) - 1 freq welcoming (1) - 3 freq becomin (2) - 45 freq welcomet (2) - 1 freq walcomit (2) - 1 freq owercomin (2) - 2 freq welcomer (2) - 1 freq welcome (2) - 168 freq welcom (2) - 1 freq welcome' (2) - 1 freq welcomed (2) - 15 freq welcomes (2) - 4 freq wylcome (3) - 2 freq bloomin (3) - 28 freq wechtin (3) - 13 freq walcumit (3) - 1 freq wellin (3) - 5 freq in-comin (3) - 1 freq becoman (3) - 2 freq wilcomed (3) - 3 freq wilcome (3) - 4 freq wenchin (3) - 1 freq reconin (3) - 1 freq |
welcomin (0) - 8 freq walcomin (1) - 5 freq welcoming (2) - 3 freq welcomin' (2) - 1 freq welcome' (3) - 1 freq welcomed (3) - 15 freq welcomes (3) - 4 freq welcome (3) - 168 freq welcom (3) - 1 freq welcomer (3) - 1 freq welcomet (3) - 1 freq walcomit (3) - 1 freq owercomin (3) - 2 freq walcummin (4) - 1 freq welcum (4) - 10 freq walcomed (4) - 10 freq walcomes (4) - 5 freq walcome (4) - 74 freq wilcome (4) - 4 freq weelcome (4) - 8 freq walcom (4) - 3 freq wilcomed (4) - 3 freq walcumit (4) - 1 freq wylcome (4) - 2 freq becomin (4) - 45 freq |
SoundEx code - W425 walkin - 299 freq welcome - 168 freq weel-kent - 79 freq welcomed - 15 freq wilson - 48 freq walcum - 31 freq walcome - 74 freq 'welcome - 6 freq walcomes - 5 freq walkman - 3 freq walking - 53 freq walkin' - 7 freq weill-kent - 20 freq weel-akwant - 1 freq wilsum - 1 freq walcomin - 5 freq walkmans - 1 freq walcom - 3 freq walcomed - 10 freq weilcum - 11 freq welcum - 10 freq well-kent - 4 freq welcomes - 4 freq welcomin - 8 freq walken - 1 freq weel-sawn - 1 freq weelkennt - 1 freq weel-kennt - 15 freq walcumed - 2 freq walcumit - 1 freq weelkeent - 1 freq walcums - 10 freq weelcome - 8 freq 'weelcome - 1 freq wilcome - 4 freq waalkin - 6 freq wilcomed - 3 freq wylcome - 2 freq walkeen - 1 freq walkan - 8 freq walcummin - 1 freq weelkent - 1 freq walkin-talkin - 1 freq 'walk-ins - 1 freq welcome' - 1 freq waalkeen - 1 freq waulkin - 3 freq weill-composit - 1 freq weil-kent - 3 freq wullsomely - 1 freq weil-sindert - 1 freq wilkin - 2 freq weill-cumed - 1 freq wielkum - 1 freq wallochin - 1 freq well-kend - 1 freq wilsome - 1 freq welsh-medium - 2 freq welshman - 1 freq wullsome - 1 freq wilsomeness - 1 freq €œwalcum - 2 freq walcummed - 3 freq walcomit - 1 freq walkand - 1 freq weel-luikin - 1 freq weel-wussin - 1 freq wholesome - 1 freq €œwelcome - 2 freq weel-acquentit - 1 freq €˜walcome - 1 freq welcoming - 3 freq wulson - 8 freq welcomet - 1 freq weillkent - 1 freq €œwalcome - 1 freq wulsome - 2 freq wulsomely - 2 freq weel-seen - 2 freq wilson's - 2 freq welcomin' - 1 freq walesinbuts - 1 freq williejohn - 23 freq weel-kenned - 1 freq wilsonÂ’s - 1 freq walkinÂ’ - 1 freq “welcome - 1 freq weelcam - 2 freq wiljun - 1 freq welcometofife - 3 freq wilkins - 1 freq wilsonmcleod - 2 freq willkommen - 1 freq walkn - 1 freq welcom - 1 freq welcomer - 1 freq walkingfootscot - 4 freq |
MetaPhone code - WLKMN walkman - 3 freq walcomin - 5 freq welcomin - 8 freq walcummin - 1 freq welcomin' - 1 freq willkommen - 1 freq |
WELCOMIN |
| Time to execute Levenshtein function - 0.175757 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.331507 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.027745 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.037376 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.000859 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. |