| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irene (0) - 56 freq grene (1) - 15 freq renew (2) - 7 freq gren (2) - 1 freq ire (2) - 9 freq tryne (2) - 5 freq rone (2) - 2 freq irvine (2) - 21 freq rede (2) - 14 freq grete (2) - 2 freq prone (2) - 11 freq trenn (2) - 1 freq irno (2) - 1 freq sirens (2) - 9 freq cyrene (2) - 2 freq breme (2) - 1 freq crone (2) - 2 freq bren (2) - 2 freq prune (2) - 3 freq iens (2) - 1 freq ien (2) - 3 freq gree (2) - 102 freq dreme (2) - 2 freq drane (2) - 1 freq cryne (2) - 2 freq |
irene (0) - 56 freq irony (2) - 13 freq rine (2) - 1 freq reine (2) - 2 freq arenae (2) - 83 freq iron (2) - 103 freq irnae (2) - 23 freq iran (2) - 2 freq erne (2) - 4 freq irna (2) - 22 freq areni (2) - 1 freq irn (2) - 35 freq ren (2) - 11 freq arena (2) - 41 freq ironie (2) - 1 freq urine (2) - 2 freq rane (2) - 3 freq arne (2) - 1 freq aren (2) - 3 freq rone (2) - 2 freq irno (2) - 1 freq grene (2) - 15 freq ine (3) - 3 freq ir'n (3) - 1 freq abene (3) - 1 freq |
SoundEx code - I650 ir'n - 1 freq i'rn - 1 freq 'iron - 2 freq irna - 22 freq iron - 103 freq irnae - 23 freq irony - 13 freq irn - 35 freq irene - 56 freq irno - 1 freq i'worm - 1 freq i'rain - 10 freq iyurn - 2 freq iran - 2 freq ironie - 1 freq |
MetaPhone code - IRN ir'n - 1 freq i'rn - 1 freq 'iron - 2 freq irna - 22 freq iron - 103 freq irnae - 23 freq irony - 13 freq irn - 35 freq irene - 56 freq irno - 1 freq i'rain - 10 freq iran - 2 freq ironie - 1 freq |
IRENE |
| Time to execute Levenshtein function - 0.525818 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.887240 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.086226 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.100779 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.000860 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. |