| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offline (0) - 1 freq affline (1) - 2 freq offin (2) - 20 freq ootline (2) - 14 freq on-line (2) - 9 freq offrin (2) - 1 freq feline (2) - 16 freq offaice (2) - 11 freq offing (2) - 1 freq outline (2) - 4 freq offie (2) - 2 freq offside (2) - 3 freq offince (2) - 1 freq office (2) - 216 freq oanline (2) - 36 freq online (2) - 143 freq famine (3) - 15 freq offsides (3) - 1 freq refine (3) - 4 freq fulie (3) - 1 freq offend (3) - 12 freq kodaline (3) - 1 freq offies (3) - 1 freq wafflin (3) - 2 freq decline (3) - 21 freq |
offline (0) - 1 freq affline (1) - 2 freq offrin (3) - 1 freq feline (3) - 16 freq offin (3) - 20 freq offen (4) - 17 freq effin (4) - 14 freq eff-in (4) - 1 freq riflin (4) - 1 freq flane (4) - 2 freq wafflin (4) - 2 freq affafine (4) - 1 freq offerin (4) - 65 freq offcn (4) - 1 freq jufflin (4) - 1 freq bafflin (4) - 1 freq fllin (4) - 1 freq mufflin (4) - 2 freq affin (4) - 2 freq filin (4) - 3 freq offern (4) - 1 freq fylin (4) - 1 freq offie (4) - 2 freq offside (4) - 3 freq offince (4) - 1 freq |
SoundEx code - O145 opulence - 2 freq oblong - 4 freq oblongs - 1 freq offline - 1 freq |
MetaPhone code - OFLN offline - 1 freq |
OFFLINE |
| Time to execute Levenshtein function - 0.217220 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.404896 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.037004 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.048452 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.001001 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. |