| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pavement (0) - 54 freq pavements (1) - 26 freq bazement (2) - 1 freq payment (2) - 4 freq cavemen (2) - 1 freq basement (2) - 9 freq easement (2) - 9 freq waement (2) - 1 freq paument (2) - 1 freq casement (2) - 3 freq muvement (2) - 4 freq placement (2) - 6 freq movement (2) - 67 freq mevement (2) - 1 freq havent (3) - 3 freq muivement (3) - 36 freq enagement (3) - 1 freq pautent (3) - 1 freq parent (3) - 21 freq avedents (3) - 1 freq aisement (3) - 2 freq abatement (3) - 1 freq govrement (3) - 1 freq mazerment (3) - 1 freq paarent (3) - 1 freq |
pavement (0) - 54 freq pavements (2) - 26 freq muvement (3) - 4 freq mevement (3) - 1 freq paument (3) - 1 freq movement (3) - 67 freq payment (3) - 4 freq muivement (4) - 36 freq easement (4) - 9 freq bazement (4) - 1 freq peyment (4) - 6 freq paliament (4) - 1 freq pliament (4) - 1 freq meevement (4) - 3 freq basement (4) - 9 freq waement (4) - 1 freq cavemen (4) - 1 freq placement (4) - 6 freq casement (4) - 3 freq maument (5) - 9 freq cement (5) - 27 freq pyements (5) - 1 freq 'movement (5) - 1 freq moavements (5) - 1 freq pacient (5) - 3 freq |
SoundEx code - P155 pavements - 26 freq pavement - 54 freq |
MetaPhone code - PFMNT pavement - 54 freq |
PAVEMENT |
| Time to execute Levenshtein function - 0.175890 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.336309 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.027997 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.037391 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.000821 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. |