| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iviry-ean (0) - 1 freq ivrywan (3) - 7 freq iverywan (3) - 1 freq ivirythin (3) - 2 freq ivvrywhar (4) - 1 freq ivrytheen (4) - 1 freq varyan (4) - 1 freq dairylea (4) - 1 freq evrywan (4) - 1 freq ivy-leaf (4) - 1 freq cairry-oan (4) - 11 freq ivvrythin (4) - 1 freq yird-an (4) - 1 freq cairy-on (4) - 2 freq ivergreen (4) - 1 freq kirkbean (4) - 2 freq iveryday (4) - 4 freq ivryday (4) - 5 freq dairyman (4) - 2 freq iviry (4) - 56 freq everyeen (4) - 4 freq pirndean (4) - 2 freq iverythin (4) - 14 freq ivrythin (4) - 3 freq dairymen (4) - 2 freq |
iviry-ean (0) - 1 freq iverywan (4) - 1 freq ivrywan (4) - 7 freq cairy-on (5) - 2 freq everyeen (5) - 4 freq everywan (5) - 22 freq evrywan (5) - 1 freq verdean (5) - 3 freq varyan (5) - 1 freq ivirythin (5) - 2 freq virgin (6) - 34 freq everyfin (6) - 10 freq evriman (6) - 1 freq gra-an (6) - 1 freq soor-an (6) - 4 freq everywhan (6) - 1 freq virgyne (6) - 1 freq fore-en (6) - 2 freq everyhin (6) - 31 freq byre-en (6) - 2 freq overseen (6) - 1 freq ivryone (6) - 2 freq ver-near (6) - 1 freq sour-an (6) - 1 freq ivirithin (6) - 1 freq |
SoundEx code - I165 ivrywan - 7 freq iverywan - 1 freq ivryone - 2 freq iver-hantin - 1 freq iver-wuntherin - 1 freq ivermair - 3 freq iviry-ean - 1 freq i'poorin - 2 freq i'firemannie - 1 freq i'fermer's - 1 freq i'bairns - 1 freq i'front - 1 freq |
MetaPhone code - IFRN iviry-ean - 1 freq |
IVIRY-EAN |
| Time to execute Levenshtein function - 0.203121 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.404430 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.027794 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.037222 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.000931 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. |