| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| overheard (0) - 6 freq overhears (1) - 1 freq owerheard (1) - 4 freq overboard (2) - 2 freq owerhead (2) - 3 freq overheid (2) - 2 freq overhearin (2) - 1 freq overseas (3) - 2 freq pierhead (3) - 1 freq overseer (3) - 2 freq overload (3) - 2 freq owerhearan (3) - 1 freq owerheed (3) - 1 freq overpaid (3) - 3 freq oerheid (3) - 1 freq vernear (3) - 8 freq owerheid (3) - 15 freq owerend (4) - 1 freq overruled (4) - 3 freq overcoat (4) - 2 freq covered (4) - 119 freq overall (4) - 6 freq forehead (4) - 5 freq verneer (4) - 5 freq overlap (4) - 1 freq |
overheard (0) - 6 freq owerheard (2) - 4 freq overhears (2) - 1 freq overhearin (3) - 1 freq overheid (3) - 2 freq overboard (3) - 2 freq owerhead (4) - 3 freq overpaid (5) - 3 freq oerheid (5) - 1 freq owerheid (5) - 15 freq averred (5) - 1 freq vernear (5) - 8 freq owerheed (5) - 1 freq owerhearan (5) - 1 freq overseer (5) - 2 freq pierhead (5) - 1 freq overload (5) - 2 freq heard (6) - 1263 freq greybeard (6) - 2 freq over-rated (6) - 1 freq gerrard (6) - 1 freq ferwerd (6) - 1 freq overturn (6) - 1 freq misheard (6) - 2 freq muirhead (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.214433 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.357379 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.027148 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.036824 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.000923 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. |