| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obligingly (0) - 1 freq obligin (3) - 6 freq grudgingly (4) - 1 freq blindly (4) - 1 freq luvingly (4) - 1 freq obliviously (4) - 2 freq blinninly (4) - 2 freq longingly (4) - 1 freq diligently (4) - 5 freq blinly (4) - 2 freq originals (4) - 3 freq lovingly (4) - 9 freq willingly (4) - 2 freq strikingly (4) - 2 freq invitingly (4) - 1 freq obligan (4) - 1 freq oreiginal (4) - 27 freq original (4) - 117 freq obligaotry (4) - 1 freq tellingly (4) - 1 freq originally (4) - 26 freq obligatory (4) - 3 freq gangly (5) - 2 freq bairnly (5) - 1 freq briggsy (5) - 1 freq |
obligingly (0) - 1 freq obligin (5) - 6 freq lovingly (6) - 9 freq willingly (6) - 2 freq bulging (6) - 1 freq obligan (6) - 1 freq blinly (6) - 2 freq diligently (6) - 5 freq blindly (6) - 1 freq luvingly (6) - 1 freq tellingly (6) - 1 freq blinninly (6) - 2 freq longingly (6) - 1 freq bluntly (7) - 3 freq boiling (7) - 2 freq blaring (7) - 2 freq banging (7) - 10 freq blawing (7) - 3 freq blaaing (7) - 1 freq oblong (7) - 4 freq bilingual (7) - 38 freq oblongs (7) - 1 freq bla'ing (7) - 1 freq blatantly (7) - 3 freq fleetingly (7) - 3 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 - OBLJNKL obligingly - 1 freq |
OBLIGINGLY |
| Time to execute Levenshtein function - 0.262664 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.381288 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.031033 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.038925 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.000971 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. |