Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
irony (0) - 13 freq iron (1) - 103 freq iront (1) - 1 freq crony (1) - 5 freq irons (1) - 3 freq ibone (2) - 1 freq eiron (2) - 1 freq icons (2) - 9 freq roy (2) - 54 freq ivory (2) - 8 freq isny (2) - 6 freq bony (2) - 6 freq iran (2) - 2 freq rone (2) - 2 freq mony (2) - 1153 freq front (2) - 733 freq ironic (2) - 22 freq ony (2) - 2214 freq pron (2) - 1 freq troy (2) - 8 freq bronk (2) - 1 freq ikon (2) - 1 freq 'ony (2) - 9 freq irno (2) - 1 freq 'rona (2) - 1 freq |
irony (0) - 13 freq iron (1) - 103 freq rone (2) - 2 freq ironie (2) - 1 freq urny (2) - 4 freq irn (2) - 35 freq ron (2) - 12 freq irno (2) - 1 freq irna (2) - 22 freq airon (2) - 1 freq iran (2) - 2 freq crony (2) - 5 freq iront (2) - 1 freq rona (2) - 3 freq irons (2) - 3 freq eiron (2) - 1 freq irene (2) - 56 freq roan (3) - 4 freq rory (3) - 15 freq bron (3) - 1 freq aaron (3) - 5 freq airn (3) - 50 freq ern (3) - 14 freq arena (3) - 41 freq rine (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 |
IRONY |
Time to execute Levenshtein function - 0.234917 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.375797 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.032885 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.044480 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.000868 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. |