| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obleegement (0) - 2 freq obleigement (1) - 2 freq obleegements (1) - 6 freq obligement (2) - 2 freq obleeget (3) - 1 freq bellement (4) - 3 freq jeedgement (4) - 4 freq obleeged (4) - 6 freq ameesement (4) - 2 freq meevement (4) - 3 freq obleege (4) - 2 freq obleegin (4) - 2 freq enlargement (4) - 1 freq arreengement (4) - 1 freq obleegit (4) - 1 freq bleetering (5) - 1 freq betterment (5) - 6 freq agreement (5) - 36 freq greement (5) - 20 freq owergeen (5) - 2 freq deeferent (5) - 4 freq beeteen (5) - 1 freq bazement (5) - 1 freq placement (5) - 6 freq bleeterin (5) - 1 freq |
obleegement (0) - 2 freq obleigement (1) - 2 freq obligement (2) - 2 freq obleegements (2) - 6 freq bellement (5) - 3 freq obleeget (5) - 1 freq obleegin (6) - 2 freq enlargement (6) - 1 freq jeedgement (6) - 4 freq obleegit (6) - 1 freq management (7) - 24 freq basement (7) - 9 freq engagement (7) - 28 freq joodgement (7) - 3 freq bereavement (7) - 4 freq regiment (7) - 21 freq element (7) - 45 freq blue-melt (7) - 1 freq judgement (7) - 20 freq alignment (7) - 2 freq segment (7) - 1 freq bemusement (7) - 2 freq belmont (7) - 6 freq juidgement (7) - 1 freq bluegreen (7) - 1 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 - OBLJMNT obligement - 2 freq obleegement - 2 freq obleigement - 2 freq |
OBLEEGEMENT |
| Time to execute Levenshtein function - 0.216087 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.382447 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.027698 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.037905 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.000931 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. |