| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peyments (0) - 5 freq payments (1) - 3 freq peyment (1) - 6 freq pennents (2) - 1 freq payment (2) - 4 freq peymint (2) - 1 freq pyements (2) - 1 freq pigments (2) - 1 freq segments (2) - 2 freq parents (3) - 180 freq weemen's (3) - 4 freq permeet (3) - 1 freq tennents (3) - 6 freq serpents (3) - 18 freq pavements (3) - 26 freq greements (3) - 1 freq regiments (3) - 12 freq helmets (3) - 9 freq resydents (3) - 1 freq prents (3) - 10 freq vestments (3) - 1 freq elements (3) - 35 freq poynts (3) - 2 freq percent (3) - 23 freq ments (3) - 1 freq |
peyments (0) - 5 freq payments (1) - 3 freq pyements (2) - 1 freq peyment (2) - 6 freq pigments (3) - 1 freq peymint (3) - 1 freq payment (3) - 4 freq waments (4) - 1 freq pairents (4) - 1 freq laments (4) - 9 freq ailments (4) - 9 freq maments (4) - 1 freq pents (4) - 5 freq peasants (4) - 11 freq paument (4) - 1 freq mauments (4) - 1 freq pynts (4) - 79 freq ments (4) - 1 freq moments (4) - 42 freq waements (4) - 1 freq patents (4) - 3 freq patients (4) - 29 freq paurents (4) - 27 freq prents (4) - 10 freq pavements (4) - 26 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.217529 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.388622 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.027280 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.037371 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.000947 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. |