Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
andiabz (0) - 13 freq andra (3) - 116 freq andalg (3) - 1 freq andras (3) - 8 freq andie (3) - 1 freq andrae (3) - 7 freq indiane (3) - 1 freq india' (3) - 1 freq indians (3) - 11 freq andra's (3) - 15 freq andean (3) - 1 freq andraes (3) - 13 freq india (3) - 21 freq indian (3) - 34 freq indiana (3) - 2 freq lndia (3) - 1 freq andyrbn (3) - 2 freq andied (3) - 1 freq andras' (3) - 1 freq and-aa (3) - 1 freq andback (3) - 1 freq asda (4) - 32 freq dib (4) - 1 freq anlie (4) - 15 freq andaman (4) - 1 freq |
andiabz (0) - 13 freq andyrbn (5) - 2 freq indiana (5) - 2 freq indian (5) - 34 freq india (5) - 21 freq andied (5) - 1 freq andback (5) - 1 freq ndz (5) - 1 freq dbz (5) - 1 freq andra (5) - 116 freq andraes (5) - 13 freq and-aa (5) - 1 freq andie (5) - 1 freq andras (5) - 8 freq andrae (5) - 7 freq andean (5) - 1 freq indiane (5) - 1 freq india' (5) - 1 freq indians (5) - 11 freq andalg (5) - 1 freq endin (6) - 43 freq indict (6) - 1 freq adobe (6) - 2 freq adz (6) - 1 freq unviable (6) - 1 freq |
SoundEx code - A531 antipathies - 6 freq antibiotics - 7 freq anti-poll - 1 freq antipodes - 2 freq anti-freeze - 4 freq antibodies - 1 freq anti-epilepsy - 1 freq antibiotic - 1 freq antiphoner - 2 freq antiphoners - 1 freq anti-public - 1 freq anitafrika's - 1 freq andiabz - 13 freq andback - 1 freq awayandboilyirheed - 2 freq andyfaeaberdeen - 4 freq antifa - 1 freq andipeters - 8 freq andybtravels - 1 freq antiballgame - 6 freq |
MetaPhone code - ANTBS andiabz - 13 freq |
ANDIABZ |
Time to execute Levenshtein function - 0.319859 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.541129 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.032756 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.043546 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.001253 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. |