| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pavements (0) - 26 freq pavement (1) - 54 freq muvements (2) - 3 freq avedents (2) - 1 freq waements (2) - 1 freq pyements (2) - 1 freq payments (2) - 3 freq movements (2) - 9 freq placements (2) - 5 freq moavements (2) - 1 freq garments (3) - 2 freq peyments (3) - 5 freq presents (3) - 48 freq bazement (3) - 1 freq gairments (3) - 1 freq elements (3) - 35 freq paurents (3) - 27 freq casement (3) - 3 freq agiements (3) - 1 freq patients (3) - 29 freq laments (3) - 9 freq statements (3) - 19 freq mauments (3) - 1 freq mevement (3) - 1 freq patents (3) - 3 freq |
pavements (0) - 26 freq pavement (2) - 54 freq movements (3) - 9 freq moavements (3) - 1 freq payments (3) - 3 freq pyements (3) - 1 freq muvements (3) - 3 freq muivements (4) - 8 freq meuvements (4) - 1 freq peyments (4) - 5 freq placements (4) - 5 freq pigments (4) - 1 freq avedents (4) - 1 freq waements (4) - 1 freq ailments (5) - 9 freq goverments (5) - 3 freq pairents (5) - 1 freq tenements (5) - 19 freq prevents (5) - 1 freq paument (5) - 1 freq clements (5) - 1 freq maments (5) - 1 freq muivments (5) - 1 freq pawrents (5) - 6 freq parents (5) - 173 freq |
SoundEx code - P155 pavements - 26 freq pavement - 54 freq |
MetaPhone code - PFMNTS pavements - 26 freq |
PAVEMENTS |
| Time to execute Levenshtein function - 0.214569 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.368808 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.028083 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.037464 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.000818 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. |