| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iver-hantin (0) - 1 freq iverlastin (3) - 4 freq ever-lastin (3) - 1 freq ever-changin (3) - 1 freq iverchyngin (3) - 1 freq niver-ennin (4) - 1 freq everlastin (4) - 3 freq ile-pintin (4) - 1 freq iverlaistin (4) - 1 freq niver-eyndin (4) - 1 freq iver-risin (4) - 1 freq enchantin (4) - 1 freq iver-lovin (4) - 1 freq niver-endin (4) - 1 freq never-endin (5) - 2 freq enchantan (5) - 1 freq iverthin's (5) - 1 freq nivver-eynin (5) - 1 freq verdant (5) - 7 freq overlappin (5) - 2 freq avertin (5) - 1 freq low-hangin (5) - 1 freq fermentin (5) - 1 freq niverendin (5) - 2 freq ferranti (5) - 2 freq |
iver-hantin (0) - 1 freq ever-changin (5) - 1 freq iverchyngin (5) - 1 freq ever-lastin (5) - 1 freq iverlastin (6) - 4 freq iver-risin (7) - 1 freq enchantin (7) - 1 freq niver-endin (7) - 1 freq niver-eyndin (7) - 1 freq iver-lovin (7) - 1 freq everlastin (7) - 3 freq niver-ennin (7) - 1 freq ile-pintin (7) - 1 freq iverlaistin (7) - 1 freq grantin (8) - 2 freq hantin (8) - 6 freq over-rated (8) - 1 freq merchant (8) - 32 freq merchants (8) - 10 freq everthin (8) - 2 freq overwhelmin (8) - 7 freq elephantine (8) - 1 freq tree-plantin (8) - 1 freq recantin (8) - 1 freq iveriethin (8) - 13 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 - IFRHNTN iver-hantin - 1 freq |
IVER-HANTIN |
| Time to execute Levenshtein function - 0.265461 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.767546 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.100367 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.042251 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.000858 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. |