| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| probability (0) - 2 freq probabeelity (2) - 1 freq probabilities (3) - 1 freq notability (3) - 1 freq probably (3) - 268 freq fragility (4) - 2 freq capability (4) - 1 freq proximity (4) - 3 freq readability (4) - 1 freq volatility (4) - 1 freq stability (4) - 3 freq proably (4) - 1 freq visability (4) - 2 freq fraility (4) - 1 freq employability (4) - 1 freq credibility (4) - 3 freq profanity (4) - 2 freq usability (4) - 1 freq inability (4) - 6 freq disability (4) - 5 freq viability (4) - 1 freq probable (4) - 4 freq possibility (4) - 19 freq nobility (4) - 12 freq liability (4) - 5 freq |
probability (0) - 2 freq probabeelity (2) - 1 freq probably (4) - 268 freq probabilities (4) - 1 freq probable (5) - 4 freq oonprobabeelity (6) - 2 freq credibility (6) - 3 freq prubablee (6) - 1 freq proably (6) - 1 freq tribbilt (6) - 2 freq possibility (6) - 19 freq aplicability (6) - 1 freq notability (6) - 1 freq readability (6) - 1 freq proablem (7) - 4 freq variabeility (7) - 1 freq probly (7) - 40 freq troublit (7) - 2 freq dribblet (7) - 1 freq problim (7) - 10 freq personality (7) - 23 freq posseebility (7) - 1 freq prubbably (7) - 1 freq possiebility (7) - 1 freq plausibility (7) - 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 - PRBBLT probabeelity - 1 freq probability - 2 freq |
PROBABILITY |
| Time to execute Levenshtein function - 0.496131 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.976775 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.032031 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.116799 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.038352 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. |