| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| patient (0) - 60 freq pacient (1) - 3 freq patients (1) - 29 freq patent (1) - 39 freq patient' (1) - 1 freq payment (2) - 4 freq pattet (2) - 2 freq patents (2) - 3 freq patternt (2) - 1 freq patina (2) - 1 freq potent (2) - 6 freq paurent (2) - 4 freq paint (2) - 62 freq impatient (2) - 16 freq pautent (2) - 1 freq paument (2) - 1 freq patten (2) - 3 freq patient's (2) - 5 freq patiently (2) - 28 freq patientfu (2) - 2 freq parent (2) - 23 freq attent (2) - 1 freq salient (2) - 2 freq paarent (2) - 1 freq patren (2) - 3 freq |
patient (0) - 60 freq patent (1) - 39 freq pautent (2) - 1 freq potent (2) - 6 freq patient' (2) - 1 freq patients (2) - 29 freq pacient (2) - 3 freq patientfu (3) - 2 freq paument (3) - 1 freq patience (3) - 46 freq paarent (3) - 1 freq attent (3) - 1 freq parent (3) - 23 freq patiently (3) - 28 freq patina (3) - 1 freq patents (3) - 3 freq impatient (3) - 16 freq payment (3) - 4 freq paurent (3) - 4 freq pattet (3) - 2 freq paint (3) - 62 freq pant (4) - 3 freq peyment (4) - 6 freq pitit (4) - 5 freq pent (4) - 39 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 - PTNT patient - 60 freq patent - 39 freq potent - 6 freq pittin't - 1 freq pedant - 3 freq patient' - 1 freq pautent - 1 freq |
PATIENT |
| Time to execute Levenshtein function - 0.199091 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.381412 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.027534 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.037598 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.001025 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. |