| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obleegements (0) - 6 freq obleegement (1) - 2 freq obleigement (2) - 2 freq obligement (3) - 2 freq obleeget (4) - 1 freq clements (5) - 1 freq obleege (5) - 2 freq achievements (5) - 7 freq jeedgement (5) - 4 freq enlargement (5) - 1 freq arreengement (5) - 1 freq battlements (5) - 4 freq obleegit (5) - 1 freq obleeged (5) - 6 freq 'greements (5) - 2 freq arrangements (5) - 18 freq leemets (5) - 1 freq obleegin (5) - 2 freq commeetments (5) - 1 freq agreements (5) - 2 freq placements (5) - 5 freq engagements (5) - 3 freq plaessments (5) - 2 freq bellement (5) - 3 freq greements (5) - 1 freq |
obleegements (0) - 6 freq obleegement (2) - 2 freq obleigement (3) - 2 freq obligement (4) - 2 freq engagements (7) - 3 freq bellement (7) - 3 freq abuliments (7) - 1 freq elements (7) - 35 freq placements (7) - 5 freq segments (7) - 2 freq regiments (7) - 12 freq clements (7) - 1 freq obleeget (7) - 1 freq allotments (8) - 1 freq leemeets (8) - 1 freq fragments (8) - 6 freq argiements (8) - 11 freq airguments (8) - 2 freq agiements (8) - 1 freq arguments (8) - 23 freq pigments (8) - 1 freq filaments (8) - 1 freq realignments (8) - 1 freq ailments (8) - 9 freq airgiements (8) - 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 - OBLJMNTS obleegements - 6 freq |
OBLEEGEMENTS |
| Time to execute Levenshtein function - 0.231893 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.423024 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.038061 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.037185 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.000920 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. |