| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peyment (0) - 6 freq peyments (1) - 5 freq peymint (1) - 1 freq payment (1) - 4 freq payments (2) - 3 freq ferment (2) - 4 freq peynt (2) - 1 freq permeet (2) - 1 freq repeyment (2) - 1 freq segment (2) - 1 freq cement (2) - 27 freq peent (2) - 1 freq percent (2) - 23 freq paument (2) - 1 freq eydent (2) - 20 freq peyen (2) - 1 freq weyert (3) - 1 freq ternent (3) - 1 freq meent (3) - 22 freq reprent (3) - 2 freq leavent (3) - 1 freq patent (3) - 39 freq festent (3) - 1 freq resent (3) - 3 freq eyven (3) - 10 freq |
peyment (0) - 6 freq peymint (1) - 1 freq payment (1) - 4 freq paument (2) - 1 freq peyments (2) - 5 freq peent (3) - 1 freq payments (3) - 3 freq repeyment (3) - 1 freq cement (3) - 27 freq peynt (3) - 1 freq pynt (4) - 277 freq pedant (4) - 3 freq paurent (4) - 4 freq pavement (4) - 55 freq piesient (4) - 1 freq wament (4) - 1 freq meynt (4) - 4 freq aisment (4) - 1 freq prent (4) - 42 freq memento (4) - 1 freq pacient (4) - 3 freq mament (4) - 14 freq remant (4) - 1 freq lament (4) - 22 freq piynt (4) - 2 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 - PMNT payment - 4 freq peyment - 6 freq peymint - 1 freq paument - 1 freq |
PEYMENT |
| Time to execute Levenshtein function - 0.225126 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.389500 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.028568 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.040949 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. |