| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oblongs (0) - 1 freq oblong (1) - 4 freq belongs (2) - 14 freq blogs (2) - 9 freq plongs (2) - 10 freq longs (2) - 1 freq bloggs (2) - 1 freq oboils (3) - 1 freq siblings (3) - 6 freq thongs (3) - 2 freq blooms (3) - 9 freq clogs (3) - 10 freq pylons (3) - 5 freq blenks (3) - 1 freq goblins (3) - 1 freq slonks (3) - 3 freq blocs (3) - 2 freq bings (3) - 16 freq belong (3) - 14 freq blond (3) - 20 freq blinns (3) - 1 freq bungs (3) - 1 freq boags (3) - 5 freq 'long (3) - 2 freq bloods (3) - 5 freq |
oblongs (0) - 1 freq belongs (2) - 14 freq oblong (2) - 4 freq bilangs (3) - 6 freq belangs (3) - 79 freq bloggs (3) - 1 freq longs (3) - 1 freq blogs (3) - 9 freq plongs (3) - 10 freq bling (4) - 3 freq baelangs (4) - 2 freq beings (4) - 4 freq walings (4) - 2 freq clings (4) - 9 freq ootlings (4) - 1 freq slings (4) - 2 freq b'langs (4) - 2 freq blondes (4) - 2 freq obliges (4) - 1 freq flings (4) - 20 freq brings (4) - 116 freq lungs (4) - 54 freq blinks (4) - 14 freq bangs (4) - 13 freq blens (4) - 1 freq |
SoundEx code - O145 opulence - 2 freq oblong - 4 freq oblongs - 1 freq offline - 1 freq |
MetaPhone code - OBLNKS oblongs - 1 freq |
OBLONGS |
| Time to execute Levenshtein function - 0.242780 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.408377 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.030456 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.041085 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.001105 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. |