| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iverleevin (0) - 1 freq everlestin (3) - 1 freq iverlastin (3) - 4 freq iver-lovin (3) - 1 freq re-leevin (3) - 1 freq ivverlestin (3) - 3 freq beleevin (3) - 1 freq eleevin (3) - 4 freq overseein (3) - 1 freq iveriethin (3) - 13 freq relievin (4) - 3 freq believin (4) - 13 freq owerseein (4) - 5 freq invernevis (4) - 3 freq inbreedin (4) - 1 freq reevin (4) - 3 freq iverlaistin (4) - 1 freq aleevin (4) - 1 freq underleein (4) - 3 freq niver-endin (4) - 1 freq iver-risin (4) - 1 freq sereivin (4) - 2 freq iverythin (4) - 14 freq ivveriethin (4) - 1 freq owerleukin (4) - 4 freq |
iverleevin (0) - 1 freq iver-lovin (4) - 1 freq eleevin (5) - 4 freq overseein (5) - 1 freq relievin (5) - 3 freq beleevin (5) - 1 freq iveriethin (5) - 13 freq everlestin (5) - 1 freq iverlastin (5) - 4 freq re-leevin (5) - 1 freq overhearin (6) - 1 freq ootleevin (6) - 1 freq overseen (6) - 1 freq ferliein (6) - 3 freq ivergreen (6) - 1 freq arreevin (6) - 1 freq everlastin (6) - 3 freq eeleeven (6) - 1 freq vreetin (6) - 2 freq perceivin (6) - 3 freq relivin (6) - 1 freq verlaine (6) - 2 freq evolvin (6) - 1 freq overladen (6) - 1 freq everyeen (6) - 4 freq |
SoundEx code - I164 ivver-helpfu - 1 freq iverlastin - 4 freq ivverlestin - 3 freq ivverlaistin - 1 freq iver-lovin - 1 freq iverleevin - 1 freq iverlaistin - 1 freq ivorljohnson - 2 freq |
MetaPhone code - IFRLFN iver-lovin - 1 freq iverleevin - 1 freq |
IVERLEEVIN |
| Time to execute Levenshtein function - 0.216392 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.414863 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.027790 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.044135 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.000955 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. |