| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peyment (0) - 6 freq peyments (1) - 5 freq peymint (1) - 1 freq payment (1) - 4 freq peyen (2) - 1 freq peynt (2) - 1 freq paument (2) - 1 freq cement (2) - 27 freq permeet (2) - 1 freq segment (2) - 1 freq eydent (2) - 17 freq percent (2) - 22 freq ferment (2) - 3 freq repeyment (2) - 1 freq peent (2) - 1 freq payments (2) - 3 freq herdent (3) - 1 freq peyntit (3) - 2 freq patent (3) - 39 freq memento (3) - 1 freq element (3) - 45 freq peyan (3) - 1 freq wemen (3) - 16 freq perfet (3) - 1 freq ailment (3) - 2 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 repeyment (3) - 1 freq payments (3) - 3 freq peynt (3) - 1 freq cement (3) - 27 freq meynt (4) - 4 freq aisment (4) - 1 freq piynt (4) - 2 freq pautent (4) - 1 freq pynt (4) - 276 freq ment (4) - 18 freq pedant (4) - 3 freq augment (4) - 2 freq raiment (4) - 2 freq piesient (4) - 1 freq potent (4) - 6 freq lament (4) - 21 freq waement (4) - 1 freq remeent (4) - 2 freq foment (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.213270 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.366424 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.028545 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.041381 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.000979 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. |