| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obligated (0) - 1 freq blighted (2) - 2 freq obliged (2) - 17 freq foomigated (3) - 2 freq obliterated (3) - 1 freq obliges (3) - 1 freq bigoted (3) - 2 freq obligation (3) - 6 freq obligaotry (3) - 1 freq lighted (3) - 3 freq oblate (3) - 1 freq bloated (3) - 2 freq blirted (3) - 1 freq delegated (3) - 2 freq delighted (3) - 37 freq bioated (3) - 1 freq blighter (3) - 2 freq relegated (3) - 6 freq obligatory (3) - 3 freq onigate (3) - 1 freq obligan (3) - 1 freq obleiged (3) - 3 freq oblige (3) - 2 freq bleated (3) - 1 freq pulsated (4) - 2 freq |
obligated (0) - 1 freq obliged (3) - 17 freq blighted (3) - 2 freq bleated (4) - 1 freq bloated (4) - 2 freq delegated (4) - 2 freq obleiged (4) - 3 freq blirted (4) - 1 freq bigoted (4) - 2 freq obligatory (4) - 3 freq obligaotry (4) - 1 freq relegated (4) - 6 freq obligation (4) - 6 freq oblige (5) - 2 freq blotted (5) - 5 freq belated (5) - 6 freq blasted (5) - 7 freq obleeged (5) - 6 freq blurted (5) - 6 freq budgeted (5) - 1 freq blighter (5) - 2 freq lighted (5) - 3 freq obliges (5) - 1 freq obliterated (5) - 1 freq foomigated (5) - 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 - OBLKTT obligated - 1 freq |
OBLIGATED |
| Time to execute Levenshtein function - 0.202773 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.379341 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.027269 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.037718 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.000913 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. |