| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ivryone (0) - 2 freq everyone (2) - 96 freq ivrie (3) - 5 freq ivree (3) - 1 freq ivryday (3) - 5 freq iront (3) - 1 freq ironed (3) - 5 freq hormone (3) - 4 freq irony (3) - 13 freq rhone (3) - 2 freq prone (3) - 11 freq overdone (3) - 1 freq tyrone (3) - 6 freq rone (3) - 2 freq trone (3) - 6 freq lerone (3) - 1 freq ironie (3) - 1 freq iphone (3) - 7 freq everyones (3) - 2 freq geryon (3) - 9 freq yone (3) - 7 freq dryope (3) - 1 freq throne (3) - 45 freq irene (3) - 56 freq ivrybody (3) - 1 freq |
ivryone (0) - 2 freq everyone (2) - 96 freq everyane (3) - 1 freq drone (4) - 19 freq iverson (4) - 1 freq overtone (4) - 1 freq varyin (4) - 5 freq ivrywan (4) - 7 freq marone (4) - 1 freq tryne (4) - 5 freq vrote (4) - 1 freq broone (4) - 1 freq iron (4) - 107 freq varyan (4) - 1 freq krone (4) - 2 freq iverywye (4) - 1 freq ivry (4) - 124 freq crone (4) - 2 freq irene (4) - 56 freq cryne (4) - 2 freq tyrone (4) - 6 freq rone (4) - 2 freq trone (4) - 6 freq overdone (4) - 1 freq prone (4) - 11 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 - IFRYN ivryone - 2 freq |
IVRYONE |
| Time to execute Levenshtein function - 0.205552 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.413821 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.030903 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.041466 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.001241 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. |