| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iron (0) - 103 freq ion (1) - 1 freq ikon (1) - 1 freq irn (1) - 35 freq irony (1) - 13 freq airon (1) - 1 freq ipon (1) - 16 freq ron (1) - 12 freq pron (1) - 1 freq icon (1) - 10 freq ihon (1) - 2 freq bron (1) - 1 freq eiron (1) - 1 freq 'iron (1) - 2 freq ir'n (1) - 1 freq iront (1) - 1 freq irons (1) - 3 freq iran (1) - 2 freq tron (1) - 11 freq aroun (2) - 127 freq byron (2) - 9 freq sion (2) - 1 freq ipn (2) - 1 freq aran (2) - 5 freq spron (2) - 1 freq |
iron (0) - 103 freq iran (1) - 2 freq ron (1) - 12 freq eiron (1) - 1 freq airon (1) - 1 freq irony (1) - 13 freq irn (1) - 35 freq rin (2) - 452 freq ironie (2) - 1 freq airn (2) - 50 freq rona (2) - 3 freq arun (2) - 2 freq ren (2) - 11 freq ran (2) - 448 freq rone (2) - 2 freq orun (2) - 1 freq irene (2) - 56 freq urn (2) - 6 freq aroon (2) - 564 freq aaron (2) - 5 freq roun (2) - 329 freq rn (2) - 7 freq run (2) - 623 freq irna (2) - 22 freq erin (2) - 9 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 |
IRON |
| Time to execute Levenshtein function - 0.465408 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.546077 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.057130 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.039678 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.031954 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. |