| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| proudly (0) - 12 freq proodly (1) - 38 freq prob'ly (2) - 1 freq proddy (2) - 2 freq probly (2) - 40 freq proud (2) - 150 freq proudlie (2) - 1 freq prolly (2) - 8 freq proably (2) - 1 freq broadly (2) - 2 freq piously (2) - 3 freq loudly (2) - 27 freq poodle (3) - 3 freq propale (3) - 1 freq braidly (3) - 8 freq trolly (3) - 1 freq croudin (3) - 1 freq croudit (3) - 4 freq rowdy (3) - 1 freq primly (3) - 1 freq crousely (3) - 8 freq croodle (3) - 1 freq pully (3) - 2 freq croudie (3) - 2 freq proile (3) - 1 freq |
proudly (0) - 12 freq proodly (1) - 38 freq proudlie (2) - 1 freq prolly (3) - 8 freq proodlie (3) - 2 freq broadly (3) - 2 freq proably (3) - 1 freq proddy (3) - 2 freq proud (3) - 150 freq probly (3) - 40 freq crudely (4) - 3 freq presly (4) - 2 freq poorly (4) - 5 freq erdly (4) - 1 freq prodigy (4) - 2 freq proil (4) - 1 freq propel (4) - 2 freq prood (4) - 194 freq proddie (4) - 2 freq prod (4) - 3 freq profile (4) - 52 freq proodlik (4) - 1 freq parody (4) - 5 freq hordly (4) - 1 freq rudely (4) - 3 freq |
SoundEx code - P634 proodly - 38 freq prattle - 29 freq portal - 3 freq pairtly - 15 freq portling - 1 freq pairtylowse - 1 freq proudly - 12 freq partly - 10 freq partial - 7 freq parteelcar - 1 freq prood-lookin - 1 freq porthole - 1 freq partially - 9 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 - 38 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 |
PROUDLY |
| Time to execute Levenshtein function - 0.195980 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.361093 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.027530 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.037535 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.000908 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. |