| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obligatory (0) - 3 freq obligaotry (2) - 1 freq alligators (3) - 1 freq obligations (3) - 5 freq obligation (3) - 6 freq alligator (3) - 3 freq obligated (3) - 1 freq navigator (4) - 1 freq litigator (4) - 1 freq lavatory (4) - 5 freq signatory (4) - 1 freq mollicators (4) - 1 freq bigotry (4) - 9 freq obligingly (4) - 1 freq blighter (4) - 2 freq derogatory (4) - 1 freq blighters (4) - 1 freq ordinators (4) - 1 freq observatory (4) - 3 freq purgatory (4) - 3 freq olfactory (4) - 1 freq blighty (4) - 1 freq obligan (4) - 1 freq migratory (4) - 1 freq dilatory (4) - 1 freq |
obligatory (0) - 3 freq obligaotry (2) - 1 freq obligated (4) - 1 freq obligation (4) - 6 freq alligator (4) - 3 freq bigotry (5) - 9 freq alligators (5) - 1 freq blighter (5) - 2 freq obligations (5) - 5 freq blighty (6) - 1 freq purgatory (6) - 3 freq blustery (6) - 15 freq blighters (6) - 1 freq blister (6) - 3 freq obligan (6) - 1 freq dilatory (6) - 1 freq balintore (6) - 1 freq blinter (6) - 2 freq navigator (6) - 1 freq derogatory (6) - 1 freq litigator (6) - 1 freq lavatory (6) - 5 freq glittery (7) - 13 freq blately (7) - 2 freq blistert (7) - 2 freq |
SoundEx code - O142 obleege - 2 freq obligin - 6 freq obleeged - 6 freq obleegin - 2 freq off-licence - 1 freq obligingly - 1 freq obligated - 1 freq obligation - 6 freq obleegit - 1 freq obliged - 17 freq oblige - 2 freq oblique - 2 freq obligations - 5 freq obligan - 1 freq obligement - 2 freq obleiged - 3 freq obliges - 1 freq obleegements - 6 freq obleegement - 2 freq obliyjin - 1 freq obleeget - 1 freq obleigement - 2 freq obligatory - 3 freq oboils - 1 freq ophelia's - 1 freq obligaotry - 1 freq |
MetaPhone code - OBLKTR obligatory - 3 freq obligaotry - 1 freq |
OBLIGATORY |
| Time to execute Levenshtein function - 0.218082 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.385484 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.028645 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.038319 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.000955 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. |