| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| patently (0) - 6 freq patiently (1) - 28 freq patents (2) - 3 freq pairently (2) - 1 freq intently (2) - 10 freq patent (2) - 39 freq adeptly (3) - 2 freq pageantry (3) - 1 freq eydently (3) - 22 freq patient' (3) - 1 freq patel (3) - 1 freq tentily (3) - 22 freq parent (3) - 23 freq pantry (3) - 7 freq parents (3) - 180 freq ently (3) - 2 freq pairtly (3) - 15 freq pautent (3) - 1 freq parents' (3) - 12 freq patty (3) - 3 freq paceably (3) - 1 freq lately (3) - 57 freq potent (3) - 6 freq vacantly (3) - 3 freq parentis (3) - 6 freq |
patently (0) - 6 freq patiently (1) - 28 freq intently (3) - 10 freq patent (3) - 39 freq patents (3) - 3 freq pairently (3) - 1 freq patients (4) - 29 freq pautent (4) - 1 freq patientfu (4) - 2 freq patient (4) - 60 freq parental (4) - 4 freq intantly (4) - 1 freq potent (4) - 6 freq impatiently (4) - 20 freq 'tentily (4) - 1 freq patient' (4) - 1 freq pattle (4) - 1 freq tentily (4) - 22 freq potential (4) - 90 freq raicently (5) - 20 freq apparently (5) - 85 freq dently (5) - 1 freq plenty (5) - 275 freq faintly (5) - 12 freq patient's (5) - 5 freq |
SoundEx code - P353 patiently - 28 freq patient - 60 freq patent - 39 freq potent - 6 freq potential - 90 freq patientfu - 2 freq potentate - 1 freq pittin't - 1 freq patently - 6 freq potentially - 11 freq patients - 29 freq patient's - 5 freq patents - 3 freq pittendreich - 1 freq pedant - 3 freq potentiallie - 1 freq potentials - 1 freq pudendum - 2 freq patient' - 1 freq pautent - 1 freq pitmeeden - 1 freq pitmedden - 1 freq peatanddiesel - 1 freq |
MetaPhone code - PTNTL patiently - 28 freq patently - 6 freq |
PATENTLY |
| Time to execute Levenshtein function - 0.189781 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.349197 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.027457 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.037080 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.000865 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. |