Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oblong (0) - 4 freq oblongs (1) - 1 freq blond (2) - 19 freq blone (2) - 2 freq blog (2) - 38 freq long (2) - 535 freq rlong (2) - 1 freq plong (2) - 10 freq bong (2) - 3 freq along (2) - 166 freq s'long (2) - 1 freq 'long (2) - 2 freq €œlong (2) - 2 freq bling (2) - 3 freq belong (2) - 14 freq blob (3) - 4 freq rolling (3) - 7 freq bony (3) - 6 freq melons (3) - 2 freq cling (3) - 6 freq longs (3) - 1 freq 'blin (3) - 1 freq oban (3) - 3 freq blend (3) - 18 freq blok (3) - 1 freq |
oblong (0) - 4 freq bling (2) - 3 freq oblongs (2) - 1 freq belong (2) - 14 freq baling (3) - 1 freq bilang (3) - 7 freq beelong (3) - 1 freq belang (3) - 85 freq boiling (3) - 2 freq 'long (3) - 2 freq blog (3) - 38 freq blone (3) - 2 freq blond (3) - 19 freq along (3) - 166 freq long (3) - 535 freq bong (3) - 3 freq plong (3) - 10 freq rlong (3) - 1 freq i'lang (4) - 1 freq lang (4) - 3210 freq aloang (4) - 3 freq pooling (4) - 1 freq blanc (4) - 1 freq blun (4) - 1 freq belongs (4) - 13 freq |
SoundEx code - O145 opulence - 2 freq oblong - 4 freq oblongs - 1 freq offline - 1 freq |
MetaPhone code - OBLNK oblong - 4 freq |
OBLONG |
Time to execute Levenshtein function - 0.179807 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.362747 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.028701 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.037823 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.000779 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. |