| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| patients (0) - 29 freq patient's (1) - 5 freq patient' (1) - 1 freq patient (1) - 59 freq patents (1) - 3 freq patientfu (2) - 2 freq paurents (2) - 27 freq patience (2) - 45 freq payments (2) - 3 freq pairents (2) - 1 freq parents (2) - 173 freq paints (2) - 2 freq patent (2) - 39 freq pawrents (2) - 6 freq pacient (2) - 3 freq patiently (2) - 27 freq paerts (3) - 1 freq ratten's (3) - 1 freq gradients (3) - 1 freq pyements (3) - 1 freq potions (3) - 11 freq paurent (3) - 4 freq parents' (3) - 12 freq intments (3) - 1 freq sapiens (3) - 2 freq |
patients (0) - 29 freq patents (1) - 3 freq patient' (2) - 1 freq patient's (2) - 5 freq patient (2) - 59 freq paints (3) - 2 freq patent (3) - 39 freq patiently (3) - 27 freq parents (3) - 173 freq pairents (3) - 1 freq paurents (3) - 27 freq payments (3) - 3 freq patientfu (3) - 2 freq pents (4) - 5 freq preints (4) - 2 freq patently (4) - 6 freq points (4) - 74 freq pautent (4) - 1 freq tints (4) - 3 freq patties (4) - 2 freq pints (4) - 78 freq tents (4) - 22 freq prints (4) - 12 freq parentis (4) - 6 freq panties (4) - 2 freq |
SoundEx code - P353 patiently - 27 freq patient - 59 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 - PTNTS patients - 29 freq patient's - 5 freq patents - 3 freq |
PATIENTS |
| Time to execute Levenshtein function - 0.212101 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.328603 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.027193 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.036622 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.000783 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. |