Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
irelandinwales (0) - 1 freq ireland's (6) - 4 freq irelanders (6) - 1 freq celandine (6) - 2 freq bbcradiowales (6) - 1 freq meaninless (7) - 2 freq readies (7) - 3 freq radicals (7) - 7 freq renewables (7) - 3 freq cardinalis (7) - 1 freq readin-lamps (7) - 1 freq randies (7) - 2 freq ordinals (7) - 3 freq cardinals (7) - 3 freq relatives (7) - 17 freq greendies (7) - 1 freq kirklandis (7) - 1 freq aladdinsane (7) - 2 freq elainealba (7) - 1 freq radiates (7) - 3 freq grandwaens (7) - 1 freq cardinal's (7) - 1 freq preliminaries (7) - 1 freq radikale (7) - 1 freq credentials (7) - 4 freq |
irelandinwales (0) - 1 freq irelanders (9) - 1 freq ireland's (9) - 4 freq landles (10) - 2 freq ordinals (10) - 3 freq randiness (10) - 1 freq landins (10) - 3 freq celandine (10) - 2 freq readins (11) - 15 freq iceland's (11) - 1 freq rationales (11) - 1 freq irelan's (11) - 1 freq landwards (11) - 1 freq readings (11) - 4 freq lendins (11) - 1 freq lanmines (11) - 1 freq redials (11) - 1 freq airlann's (11) - 1 freq ranunculus (11) - 1 freq flannels (11) - 1 freq rinnals (11) - 1 freq paulandrews (11) - 1 freq blandness (11) - 2 freq belangins (11) - 6 freq landscapes (11) - 5 freq |
SoundEx code - I645 ireland - 145 freq irelan's - 1 freq irelan' - 1 freq ireland's - 4 freq irland - 6 freq irelanders - 1 freq irelan - 3 freq irelandinwales - 1 freq |
MetaPhone code - IRLNTNWL |
IRELANDINWALES |
Time to execute Levenshtein function - 0.263078 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.470395 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.028639 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.037617 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.000888 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. |