Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wallochin (0) - 1 freq bellochin (2) - 3 freq wallopin (2) - 16 freq grallochin (2) - 1 freq yellochin (2) - 11 freq walloched (2) - 1 freq yallochie (2) - 1 freq walloch (2) - 1 freq mollachin (3) - 1 freq gollachin (3) - 1 freq waachin (3) - 1 freq allouin (3) - 14 freq gallousin (3) - 1 freq allowin (3) - 9 freq swallowin (3) - 2 freq slochin (3) - 2 freq allooin (3) - 20 freq falloein (3) - 2 freq hallooin (3) - 2 freq hallockit (3) - 7 freq allocatin (3) - 1 freq watchin (3) - 395 freq gallopin (3) - 6 freq bollockin (3) - 1 freq walcomin (3) - 5 freq |
wallochin (0) - 1 freq walloched (3) - 1 freq yellochin (3) - 11 freq walloch (3) - 1 freq bellochin (3) - 3 freq grallochin (4) - 1 freq mollachin (4) - 1 freq gollachin (4) - 1 freq yallochie (4) - 1 freq wallopin (4) - 16 freq walcomin (5) - 5 freq bollockin (5) - 1 freq waatchin (5) - 24 freq skellochin (5) - 7 freq watchin (5) - 395 freq squallochin (5) - 6 freq allocatin (5) - 1 freq waachin (5) - 1 freq slochin (5) - 2 freq belchin (6) - 2 freq yellocht (6) - 1 freq golloch (6) - 1 freq willin (6) - 59 freq allophone (6) - 1 freq waatchan (6) - 8 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 - WLXN wallochin - 1 freq |
WALLOCHIN |
Time to execute Levenshtein function - 0.639392 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 - 1.545051 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.081756 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.110332 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.001176 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. |