| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ivermair (0) - 3 freq evermair (1) - 5 freq nivermair (1) - 1 freq neermair (2) - 1 freq vermin (3) - 3 freq nevermar (3) - 1 freq uppermair (3) - 4 freq iverie (3) - 73 freq mermaid (3) - 3 freq naemair (3) - 1 freq overtaik (3) - 1 freq iverrie (3) - 1 freq invermay (3) - 5 freq i'mair (3) - 1 freq overpaid (3) - 3 freq kermit (4) - 2 freq verra (4) - 436 freq everyhin (4) - 31 freq werain (4) - 1 freq futhermair (4) - 2 freq rair (4) - 30 freq gremmar (4) - 52 freq repair (4) - 15 freq ventir (4) - 1 freq thermals (4) - 9 freq |
ivermair (0) - 3 freq evermair (1) - 5 freq nivermair (2) - 1 freq neermair (3) - 1 freq evermore (4) - 2 freq iverrie (4) - 1 freq nevermar (4) - 1 freq vermin (4) - 3 freq verdur (5) - 1 freq vernear (5) - 8 freq fermer (5) - 194 freq verneer (5) - 5 freq overseer (5) - 2 freq verm (5) - 1 freq nivermore (5) - 1 freq hermer (5) - 1 freq verray (5) - 1 freq i'mair (5) - 1 freq mermaid (5) - 3 freq iverie (5) - 73 freq uppermair (5) - 4 freq naemair (5) - 1 freq overtaik (5) - 1 freq overpaid (5) - 3 freq verrier (5) - 1 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 - IFRMR ivermair - 3 freq |
IVERMAIR |
| Time to execute Levenshtein function - 0.248241 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.398472 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.028068 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.037850 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.000902 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. |