| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ivrywan (0) - 7 freq iverywan (1) - 1 freq evrywan (1) - 1 freq everywan (2) - 22 freq evriwan (2) - 2 freq ivryday (2) - 5 freq everywhan (3) - 1 freq cryan (3) - 1 freq avoydan (3) - 1 freq evriman (3) - 1 freq dryan (3) - 2 freq ivryone (3) - 2 freq ingrowan (3) - 1 freq ryan (3) - 32 freq iverywhar (3) - 2 freq throwan (3) - 4 freq onywan (3) - 19 freq tryan (3) - 32 freq bryan (3) - 17 freq irelan (3) - 3 freq iveryday (3) - 4 freq erowan (3) - 1 freq iviry-ean (3) - 1 freq ivan (3) - 6 freq rypan (3) - 1 freq |
ivrywan (0) - 7 freq evrywan (1) - 1 freq iverywan (1) - 1 freq evriwan (2) - 2 freq everywan (2) - 22 freq everwan (3) - 4 freq evryhin (4) - 2 freq varyan (4) - 1 freq erowan (4) - 1 freq rowan (4) - 18 freq everywans (4) - 1 freq iverywye (4) - 1 freq drywyn (4) - 1 freq everywhan (4) - 1 freq ivryday (4) - 5 freq growan (4) - 24 freq evriman (4) - 1 freq ivryone (4) - 2 freq iviry-ean (4) - 1 freq everyane (5) - 1 freq grewn (5) - 3 freq iverson (5) - 1 freq drown (5) - 2 freq everywoman (5) - 2 freq grawin (5) - 13 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 - IFRWN ivrywan - 7 freq iverywan - 1 freq |
IVRYWAN |
| Time to execute Levenshtein function - 0.206787 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.387154 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.027352 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.038769 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.000994 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. |