| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obligin (0) - 6 freq obligan (1) - 1 freq obliged (2) - 17 freq obliges (2) - 1 freq origin (2) - 24 freq oreigin (2) - 1 freq obliyjin (2) - 1 freq oblige (2) - 2 freq obleegin (2) - 2 freq oblivion (2) - 2 freq livin (3) - 334 freq liein (3) - 3 freq blirtin (3) - 2 freq briggin (3) - 4 freq blain (3) - 2 freq beirin (3) - 4 freq bailin (3) - 3 freq elgin (3) - 24 freq oulii (3) - 1 freq obligingly (3) - 1 freq bliind (3) - 2 freq beilin (3) - 3 freq obligation (3) - 6 freq buidin (3) - 1 freq blawin (3) - 90 freq |
obligin (0) - 6 freq obligan (1) - 1 freq obleegin (2) - 2 freq obliyjin (3) - 1 freq oblivion (3) - 2 freq oblige (3) - 2 freq obliges (3) - 1 freq obliged (3) - 17 freq bulgin (3) - 6 freq blumin (4) - 1 freq ableizin (4) - 1 freq bluidin (4) - 3 freq bluimin (4) - 1 freq obleegit (4) - 1 freq baegin (4) - 2 freq bingin (4) - 1 freq blekin (4) - 1 freq belgian (4) - 8 freq boilin (4) - 5 freq blinn (4) - 20 freq blamin (4) - 6 freq malign (4) - 3 freq bargin (4) - 2 freq align (4) - 2 freq blarin (4) - 13 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 - OBLJN obligin - 6 freq obleegin - 2 freq obliyjin - 1 freq |
OBLIGIN |
| Time to execute Levenshtein function - 0.202413 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.337029 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.027370 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.037097 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.000839 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. |