| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| probably (0) - 268 freq proably (1) - 1 freq probable (1) - 4 freq prob''ly (2) - 1 freq probably (2) - 2 freq prob'ly (2) - 2 freq prubbably (2) - 1 freq probly (2) - 40 freq probably (2) - 1 freq probably (2) - 3 freq improbable (3) - 2 freq knobbly (3) - 5 freq proodly (3) - 39 freq royally (3) - 2 freq broadly (3) - 3 freq profitably (3) - 1 freq proablem (3) - 4 freq propale (3) - 1 freq prefrably (3) - 1 freq croasly (3) - 1 freq notably (3) - 7 freq promptly (3) - 12 freq paceably (3) - 1 freq probability (3) - 2 freq wobbly (3) - 6 freq |
probably (0) - 268 freq probable (1) - 4 freq proably (2) - 1 freq probly (3) - 40 freq prubbably (3) - 1 freq prubablee (3) - 1 freq prob'ly (3) - 2 freq pebbly (4) - 2 freq probability (4) - 2 freq improbable (4) - 2 freq probably (4) - 3 freq prob''ly (4) - 1 freq probably (4) - 2 freq probably (4) - 1 freq pebble (5) - 9 freq rubble (5) - 7 freq proudly (5) - 12 freq probabeelity (5) - 1 freq arguably (5) - 10 freq dribble (5) - 3 freq robby (5) - 5 freq tribble (5) - 31 freq permeable (5) - 1 freq parable (5) - 54 freq problee (5) - 1 freq |
SoundEx code - P611 probably - 268 freq probabeelity - 1 freq prubablee - 1 freq prubbably - 1 freq pre-fab - 1 freq purpie-blue - 1 freq probability - 2 freq prefabs - 2 freq prefab - 3 freq probable - 4 freq probably - 3 freq probably - 2 freq probabilities - 1 freq probably - 1 freq |
MetaPhone code - PRBBL probably - 268 freq prubablee - 1 freq prubbably - 1 freq probable - 4 freq probably - 3 freq probably - 2 freq probably - 1 freq |
PROBABLY |
| Time to execute Levenshtein function - 0.195291 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.353906 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.027149 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.037288 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.000927 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. |