Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ivver-helpfu (0) - 1 freq ivver-ready (5) - 1 freq nivvertheless (5) - 4 freq nivertheless (6) - 1 freq hame-help (6) - 1 freq home-help (6) - 1 freq ivverie (6) - 25 freq nevertheless (6) - 4 freq overwhelmed (6) - 7 freq nivver-the-les (6) - 2 freq ivverrie (6) - 1 freq overwhelms (6) - 1 freq nivver-endin (6) - 2 freq overwhelmin (6) - 7 freq nivver-eynin (6) - 1 freq iver-hantin (6) - 1 freq ivverlestin (6) - 3 freq helpfu (6) - 21 freq inter-celto (6) - 1 freq ivveriethin (6) - 1 freq unhelpfu (6) - 1 freq ivy-leaf (7) - 1 freq oer-het (7) - 1 freq owerwhelmin (7) - 11 freq cave-heid (7) - 2 freq |
ivver-helpfu (0) - 1 freq nivvertheless (9) - 4 freq ivver-ready (9) - 1 freq helpfu (10) - 21 freq iver-hantin (10) - 1 freq unhelpfu (10) - 1 freq overwhelmin (10) - 7 freq ivveriethin (10) - 1 freq overwhelms (10) - 1 freq overwhelmed (10) - 7 freq home-help (10) - 1 freq nevertheless (10) - 4 freq hame-help (10) - 1 freq nivertheless (10) - 1 freq aifter-life (11) - 1 freq ivveryithin (11) - 1 freq hover-flees (11) - 1 freq cover-up (11) - 2 freq ivverythin (11) - 3 freq never-stap (11) - 2 freq ivverywhaur (11) - 2 freq iver-lovin (11) - 1 freq self-help (11) - 3 freq halpfu (11) - 1 freq inter-celto (11) - 1 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 - IFRHLPF ivver-helpfu - 1 freq |
IVVER-HELPFU |
Time to execute Levenshtein function - 0.328279 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.606317 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.061391 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.050767 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.001262 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. |