| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obleiged (0) - 3 freq obleeged (1) - 6 freq obliged (1) - 17 freq obleege (2) - 2 freq obliges (2) - 1 freq oblige (2) - 2 freq obleeget (2) - 1 freq breinged (3) - 6 freq obsessed (3) - 10 freq braiged (3) - 2 freq pleised (3) - 4 freq alleged (3) - 2 freq beige (3) - 3 freq bleize (3) - 2 freq bleed (3) - 81 freq blenked (3) - 2 freq obligan (3) - 1 freq obleegit (3) - 1 freq bleated (3) - 1 freq objected (3) - 2 freq legged (3) - 10 freq obligin (3) - 6 freq ableize (3) - 1 freq gledged (3) - 1 freq bleazed (3) - 1 freq |
obleiged (0) - 3 freq obliged (1) - 17 freq obleeged (1) - 6 freq oblige (3) - 2 freq obleeget (3) - 1 freq obliges (3) - 1 freq obleege (3) - 2 freq blarged (4) - 1 freq bleezed (4) - 10 freq bleered (4) - 1 freq bleazed (4) - 1 freq obligated (4) - 1 freq bleared (4) - 7 freq obleegin (4) - 2 freq begged (4) - 30 freq obligin (4) - 6 freq bluimed (4) - 3 freq bulged (4) - 4 freq bleid (4) - 1 freq blagged (4) - 1 freq obleegit (4) - 1 freq obligan (4) - 1 freq alleged (4) - 2 freq bleed (4) - 81 freq bleated (4) - 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 - OBLJT obleeged - 6 freq obleegit - 1 freq obliged - 17 freq obleiged - 3 freq obleeget - 1 freq |
OBLEIGED |
| Time to execute Levenshtein function - 0.193154 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.345766 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.028162 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.038355 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.000888 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. |