| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paliament (0) - 1 freq parliament (1) - 77 freq pliament (1) - 1 freq parliamint (2) - 1 freq parliament- (2) - 1 freq parliament' (2) - 1 freq pairliament (2) - 68 freq parliaments (2) - 10 freq valiant (3) - 5 freq parchment (3) - 10 freq perliement (3) - 1 freq patient (3) - 60 freq parliamentin (3) - 1 freq parliament's (3) - 3 freq pairliaments (3) - 7 freq sacrament (3) - 7 freq ballamena (3) - 1 freq raiment (3) - 2 freq pairlament (3) - 180 freq filament (3) - 2 freq paarent (3) - 1 freq maidment (3) - 2 freq salient (3) - 2 freq pacient (3) - 3 freq ailment (3) - 2 freq |
paliament (0) - 1 freq pliament (1) - 1 freq parliament (2) - 77 freq pairliament (3) - 68 freq parliamint (3) - 1 freq pavement (4) - 55 freq 'lament (4) - 3 freq pliant (4) - 1 freq pairlament (4) - 180 freq paument (4) - 1 freq perlament (4) - 8 freq filament (4) - 2 freq ailment (4) - 2 freq perliement (4) - 1 freq lament (4) - 22 freq parliaments (4) - 10 freq payment (4) - 4 freq parliament- (4) - 1 freq parlimint (4) - 1 freq parliament' (4) - 1 freq palming (5) - 1 freq plaisent (5) - 1 freq rolment (5) - 1 freq clamant (5) - 1 freq pleumen (5) - 1 freq |
SoundEx code - P455 plannin - 54 freq plooman's - 1 freq pliament - 1 freq planun - 1 freq planning - 14 freq plannin' - 2 freq plooman - 8 freq planneen - 1 freq plannan - 2 freq plumman - 1 freq plennin - 11 freq pleumen - 1 freq pleenin - 1 freq pelmanism - 1 freq palming - 1 freq philomena - 3 freq plumin - 1 freq paliament - 1 freq |
MetaPhone code - PLMNT pliament - 1 freq paliament - 1 freq |
PALIAMENT |
| Time to execute Levenshtein function - 0.259843 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.470655 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.051110 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.039103 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.000898 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. |