| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peyments (0) - 5 freq payments (1) - 3 freq peyment (1) - 6 freq segments (2) - 2 freq peymint (2) - 1 freq pigments (2) - 1 freq pyements (2) - 1 freq pennents (2) - 1 freq payment (2) - 4 freq tenements (3) - 19 freq pynts (3) - 78 freq torments (3) - 1 freq repeyment (3) - 1 freq segment (3) - 1 freq percent (3) - 22 freq cement (3) - 27 freq permeates (3) - 3 freq weimen's (3) - 1 freq regiments (3) - 12 freq pents (3) - 5 freq permency (3) - 1 freq leemets (3) - 1 freq amenments (3) - 1 freq waments (3) - 1 freq patents (3) - 3 freq |
peyments (0) - 5 freq payments (1) - 3 freq peyment (2) - 6 freq pyements (2) - 1 freq payment (3) - 4 freq pigments (3) - 1 freq peymint (3) - 1 freq maments (4) - 1 freq pairents (4) - 1 freq mauments (4) - 1 freq paurents (4) - 27 freq parents (4) - 173 freq peasants (4) - 11 freq prents (4) - 10 freq waements (4) - 1 freq ailments (4) - 9 freq laments (4) - 9 freq poynts (4) - 2 freq elements (4) - 35 freq paument (4) - 1 freq patents (4) - 3 freq moments (4) - 40 freq patients (4) - 29 freq pavements (4) - 26 freq ments (4) - 1 freq |
SoundEx code - P553 peyments - 5 freq payment - 4 freq pneumatic - 1 freq pennants - 1 freq peyment - 6 freq peymint - 1 freq pennant - 1 freq payments - 3 freq 'pneumatic - 1 freq pennents - 1 freq pennant's - 1 freq pyements - 1 freq paument - 1 freq pan-handlin - 1 freq pyemounts - 1 freq |
MetaPhone code - PMNTS peyments - 5 freq payments - 3 freq |
PEYMENTS |
| Time to execute Levenshtein function - 0.198230 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.366021 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.027863 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.039664 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.000891 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. |