| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| probably (0) - 254 freq proably (1) - 1 freq probable (1) - 4 freq probly (2) - 40 freq probably (2) - 2 freq prob'ly (2) - 1 freq prubbably (2) - 1 freq probably (2) - 3 freq probably (2) - 1 freq prolly (3) - 8 freq robby (3) - 5 freq proodly (3) - 38 freq properly (3) - 51 freq royally (3) - 2 freq profitably (3) - 1 freq proablem (3) - 4 freq peacably (3) - 1 freq probability (3) - 2 freq arguably (3) - 10 freq paceably (3) - 1 freq pebbly (3) - 2 freq wobbly (3) - 5 freq improbable (3) - 2 freq proudly (3) - 12 freq broadly (3) - 2 freq |
probably (0) - 254 freq probable (1) - 4 freq proably (2) - 1 freq prubbably (3) - 1 freq prob'ly (3) - 1 freq prubablee (3) - 1 freq probly (3) - 40 freq improbable (4) - 2 freq pebbly (4) - 2 freq probably (4) - 1 freq probability (4) - 2 freq probably (4) - 2 freq probably (4) - 3 freq problee (5) - 1 freq drebble (5) - 1 freq parable (5) - 54 freq dribble (5) - 3 freq portable (5) - 9 freq tribble (5) - 31 freq rabble (5) - 10 freq permeable (5) - 1 freq propale (5) - 1 freq trubble (5) - 2 freq probabeelity (5) - 1 freq pebble (5) - 9 freq |
SoundEx code - P611 probably - 254 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 - 254 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.220840 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.348425 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.027585 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.037087 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.000886 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. |