| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| overheard (0) - 6 freq owerheard (1) - 4 freq overhears (1) - 1 freq overboard (2) - 2 freq owerhead (2) - 3 freq overhearin (2) - 1 freq overheid (2) - 2 freq owerheed (3) - 1 freq oerheid (3) - 1 freq overseas (3) - 2 freq overseer (3) - 2 freq owerhearan (3) - 1 freq overload (3) - 2 freq owerheid (3) - 15 freq overpaid (3) - 3 freq vernear (3) - 8 freq pierhead (3) - 1 freq overlap (4) - 1 freq taethebard (4) - 1 freq overwhelmed (4) - 7 freq ower-heid (4) - 2 freq overhung (4) - 1 freq overcoat (4) - 2 freq governed (4) - 4 freq ivered (4) - 4 freq |
overheard (0) - 6 freq overhears (2) - 1 freq owerheard (2) - 4 freq overheid (3) - 2 freq overhearin (3) - 1 freq overboard (3) - 2 freq owerhead (4) - 3 freq overpaid (5) - 3 freq vernear (5) - 8 freq averred (5) - 1 freq overload (5) - 2 freq pierhead (5) - 1 freq owerheid (5) - 15 freq owerheed (5) - 1 freq oerheid (5) - 1 freq overseer (5) - 2 freq owerhearan (5) - 1 freq reread (6) - 2 freq overwork (6) - 1 freq overjoyed (6) - 2 freq versed (6) - 4 freq gerrard (6) - 1 freq overdid (6) - 1 freq muirhead (6) - 1 freq aerheid (6) - 1 freq |
SoundEx code - O166 overheard - 6 freq ofrer - 1 freq overhearin - 1 freq overworked - 2 freq overhears - 1 freq overwork - 1 freq |
MetaPhone code - OFRHRT overheard - 6 freq |
OVERHEARD |
| Time to execute Levenshtein function - 0.199197 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.355783 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.027641 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.037644 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.000893 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. |