| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| abided (0) - 1 freq bided (1) - 30 freq abide (1) - 15 freq abides (1) - 5 freq aided (1) - 2 freq aised (2) - 6 freq aider (2) - 2 freq bidef (2) - 1 freq abid (2) - 1 freq biden (2) - 9 freq ahied (2) - 1 freq bide (2) - 830 freq sided (2) - 5 freq abated (2) - 1 freq abdee (2) - 1 freq abudee (2) - 10 freq guided (2) - 16 freq aide (2) - 1 freq abreed (2) - 5 freq aidled (2) - 1 freq chided (2) - 3 freq aimed (2) - 16 freq ained (2) - 19 freq leided (2) - 1 freq abodes (2) - 1 freq |
abided (0) - 1 freq bided (1) - 30 freq abiddy (2) - 28 freq aided (2) - 2 freq abide (2) - 15 freq abides (2) - 5 freq abiud (3) - 4 freq raided (3) - 4 freq bides (3) - 230 freq biled (3) - 38 freq elided (3) - 1 freq avoided (3) - 6 freq bidet (3) - 1 freq abuised (3) - 1 freq abused (3) - 6 freq abidys (3) - 1 freq biddy (3) - 12 freq bedd (3) - 56 freq abuddee (3) - 1 freq bodied (3) - 2 freq added (3) - 173 freq aabiddy (3) - 1 freq abidin (3) - 9 freq heided (3) - 35 freq abidy (3) - 36 freq |
SoundEx code - A133 appetite - 19 freq abided - 1 freq avoidit - 8 freq avoided - 6 freq appetites - 2 freq avoidet - 1 freq apathetic - 1 freq apdatin - 2 freq aabody'd - 1 freq appiteits - 1 freq aptitudes - 1 freq abated - 1 freq afftaethecludgie - 1 freq |
MetaPhone code - ABTT abided - 1 freq aabody'd - 1 freq abated - 1 freq |
ABIDED |
| Time to execute Levenshtein function - 0.209816 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.380194 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.028877 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.039185 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.000999 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. |