| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oppened (0) - 22 freq hoppened (1) - 1 freq opened (1) - 283 freq appened (1) - 5 freq opposed (2) - 20 freq oppenly (2) - 1 freq opined (2) - 5 freq hippened (2) - 1 freq peened (2) - 10 freq speened (2) - 1 freq oppeneen (2) - 1 freq apened (2) - 6 freq ripened (2) - 2 freq pened (2) - 1 freq oppens (2) - 4 freq opener (2) - 4 freq oppen (2) - 31 freq happened (2) - 445 freq open'd (2) - 1 freq append (2) - 2 freq lippened (2) - 11 freq oppenin (2) - 6 freq oppinen (2) - 1 freq aipened (2) - 4 freq openeen (3) - 2 freq |
oppened (0) - 22 freq appened (1) - 5 freq hoppened (2) - 1 freq opened (2) - 283 freq append (2) - 2 freq oppen (3) - 31 freq oppens (3) - 4 freq oppinen (3) - 1 freq aipened (3) - 4 freq pened (3) - 1 freq oppenin (3) - 6 freq lippened (3) - 11 freq happened (3) - 445 freq hippened (3) - 1 freq opined (3) - 5 freq oppenly (3) - 1 freq ripened (3) - 2 freq peened (3) - 10 freq opposed (3) - 20 freq oppeneen (3) - 1 freq speened (3) - 1 freq apened (3) - 6 freq penned (4) - 14 freq appenin (4) - 3 freq applied (4) - 27 freq |
SoundEx code - O153 opened - 283 freq opent - 85 freq opined - 5 freq open-moued - 1 freq open't - 5 freq openit - 4 freq oppint - 2 freq opint - 1 freq open'd - 1 freq offendit - 10 freq offendin - 13 freq offended - 29 freq offend - 12 freq offendet - 7 freq openta - 1 freq offenders - 3 freq oppened - 22 freq openmouthed - 1 freq opennt - 1 freq offhandedly - 1 freq open-moothed - 2 freq offender - 2 freq offends - 1 freq |
MetaPhone code - OPNT opened - 283 freq opent - 85 freq opined - 5 freq open't - 5 freq openit - 4 freq oppint - 2 freq opint - 1 freq open'd - 1 freq openta - 1 freq oppened - 22 freq opennt - 1 freq |
OPPENED |
| Time to execute Levenshtein function - 0.193168 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.342751 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.028005 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.037884 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.000946 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. |