| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obligation (0) - 6 freq obligations (1) - 5 freq irrigation (3) - 1 freq litigation (3) - 1 freq abdication (3) - 1 freq obligatory (3) - 3 freq publication (3) - 42 freq navigation (3) - 2 freq oxidation (3) - 1 freq obligated (3) - 1 freq obligan (3) - 1 freq oblivion (3) - 2 freq mitigation (3) - 2 freq delegation (3) - 7 freq obligin (3) - 6 freq pollination (3) - 1 freq validation (3) - 2 freq relegation (3) - 4 freq toleration (4) - 2 freq occupation (4) - 14 freq bloviation (4) - 1 freq culmination (4) - 3 freq location (4) - 35 freq implication (4) - 3 freq citation (4) - 2 freq |
obligation (0) - 6 freq obligations (2) - 5 freq relegation (4) - 4 freq obligated (4) - 1 freq obligan (4) - 1 freq delegation (4) - 7 freq obligatory (4) - 3 freq obligin (4) - 6 freq bloviation (5) - 1 freq bloatin (5) - 1 freq bigton (5) - 1 freq ablution (5) - 2 freq brigton (5) - 2 freq delegatin (5) - 1 freq bleatin (5) - 7 freq blirtin (5) - 2 freq obligaotry (5) - 1 freq validation (5) - 2 freq oblivion (5) - 2 freq publication (5) - 42 freq abdication (5) - 1 freq irrigation (5) - 1 freq litigation (5) - 1 freq mitigation (5) - 2 freq navigation (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 - OBLKXN obligation - 6 freq |
OBLIGATION |
| Time to execute Levenshtein function - 0.198047 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.392080 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.027774 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.038098 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.000861 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. |