| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| prattle (0) - 29 freq brattle (1) - 10 freq trattle (1) - 1 freq sprattle (1) - 2 freq pattle (1) - 1 freq rattle (1) - 35 freq pattie (2) - 2 freq pratt (2) - 1 freq prattlin (2) - 1 freq sattle (2) - 21 freq battle (2) - 125 freq prattle's (2) - 1 freq pratie (2) - 1 freq brittle (2) - 9 freq cattle (2) - 26 freq boattle (2) - 41 freq rettle (2) - 1 freq tattle (2) - 3 freq rattlet (2) - 1 freq crottle (2) - 7 freq pratta (2) - 1 freq seattle (2) - 3 freq brattled (2) - 3 freq rattlt (2) - 1 freq peattie (2) - 5 freq |
prattle (0) - 29 freq pattle (2) - 1 freq sprattle (2) - 2 freq rattle (2) - 35 freq trattle (2) - 1 freq brattle (2) - 10 freq rettle (3) - 1 freq crottle (3) - 7 freq prattik (3) - 4 freq prettie (3) - 1 freq drittle (3) - 1 freq pratta (3) - 1 freq brittle (3) - 9 freq pratt (3) - 1 freq prattlin (3) - 1 freq craitle (4) - 1 freq prittas (4) - 8 freq partly (4) - 10 freq brattles (4) - 2 freq 'brattle (4) - 4 freq pritty (4) - 2 freq prettea (4) - 1 freq prettier (4) - 2 freq prittier (4) - 1 freq brattil (4) - 1 freq |
SoundEx code - P634 proodly - 39 freq prattle - 29 freq portal - 3 freq pairtly - 15 freq portling - 1 freq pairtylowse - 1 freq proudly - 12 freq partially - 10 freq partial - 8 freq partly - 10 freq parteelcar - 1 freq prood-lookin - 1 freq porthole - 1 freq portals - 1 freq prattle's - 1 freq proodlie - 2 freq pairtlie - 2 freq pairtial - 1 freq proudlie - 1 freq prood-like - 1 freq portaloo - 1 freq pairtlt - 1 freq pertlie - 1 freq pairtially - 2 freq portland - 13 freq proodlik - 1 freq €˜partial - 1 freq portlethen - 1 freq prattlin - 1 freq portaloos - 1 freq |
MetaPhone code - PRTL proodly - 39 freq prattle - 29 freq portal - 3 freq pairtly - 15 freq proudly - 12 freq partly - 10 freq proodlie - 2 freq pairtlie - 2 freq proudlie - 1 freq portaloo - 1 freq pertlie - 1 freq |
PRATTLE |
| Time to execute Levenshtein function - 0.185558 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.334832 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.028166 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.037207 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.000933 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. |