| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oboils (0) - 1 freq boils (1) - 4 freq ooirs (2) - 2 freq bols (2) - 1 freq spoils (2) - 2 freq fooils (2) - 1 freq boily (2) - 1 freq coils (2) - 11 freq boil (2) - 19 freq ooies (2) - 1 freq boiys (2) - 1 freq boits (2) - 10 freq bools (2) - 23 freq onkils (2) - 1 freq bouls (2) - 2 freq oils (2) - 2 freq bowls (2) - 20 freq ochils (2) - 8 freq bogils (2) - 2 freq boies (2) - 1 freq hobbies (3) - 8 freq fools (3) - 12 freq oogly (3) - 2 freq tuils (3) - 13 freq crowls (3) - 1 freq |
oboils (0) - 1 freq boils (1) - 4 freq bools (2) - 23 freq bouls (2) - 2 freq bols (2) - 1 freq blis (3) - 1 freq boies (3) - 1 freq baals (3) - 2 freq bogils (3) - 2 freq beals (3) - 1 freq bolas (3) - 4 freq blois (3) - 5 freq buls (3) - 1 freq bowls (3) - 20 freq boles (3) - 1 freq biles (3) - 14 freq boiys (3) - 1 freq coils (3) - 11 freq boily (3) - 1 freq oils (3) - 2 freq fooils (3) - 1 freq boil (3) - 19 freq boits (3) - 10 freq bots (4) - 4 freq ails (4) - 9 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 - OBLS oboils - 1 freq |
OBOILS |
| Time to execute Levenshtein function - 0.211763 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.380173 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.036169 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.036819 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.000941 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. |