| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nonpairlament (0) - 1 freq pairlament (3) - 180 freq €˜pairlament (3) - 2 freq pairlaments (4) - 5 freq non-paiyment (4) - 1 freq pairliament (4) - 68 freq €˜parliament (5) - 2 freq onparpent (5) - 1 freq parliament (5) - 77 freq non-violent (5) - 1 freq appairtment (5) - 1 freq depairtment (5) - 64 freq pairlament's (5) - 4 freq pairlaments' (5) - 1 freq pairliaments (5) - 7 freq pairchment (5) - 4 freq compairtments (5) - 2 freq perlament (5) - 8 freq containment (5) - 2 freq apairtment (5) - 3 freq sacrament (6) - 7 freq nonchalant (6) - 2 freq parliamint (6) - 1 freq noctilucent (6) - 2 freq gouvernament (6) - 3 freq |
nonpairlament (0) - 1 freq €˜pairlament (5) - 2 freq pairlament (5) - 180 freq pairliament (6) - 68 freq parliament (7) - 77 freq perlament (7) - 8 freq non-paiyment (7) - 1 freq pairlaments (7) - 5 freq €˜parliament (7) - 2 freq pairliaments (8) - 7 freq parliamint (8) - 1 freq apairtment (8) - 3 freq parlimint (8) - 1 freq appairtment (8) - 1 freq non-violent (8) - 1 freq depairtment (8) - 64 freq onparpent (8) - 1 freq environment (9) - 46 freq pairlementer (9) - 1 freq pairlamentary (9) - 3 freq expiriment (9) - 2 freq permament (9) - 1 freq pairlementar (9) - 5 freq concealment (9) - 1 freq paliament (9) - 1 freq |
SoundEx code - N516 number - 174 freq numbers - 65 freq nine-bars - 1 freq numbered - 6 freq non-partisan - 2 freq number-plates - 1 freq non-pairty - 1 freq nambarrie - 1 freq number'll - 1 freq nonpareil - 1 freq nanbreid - 1 freq nonpairlament - 1 freq €œnumber - 1 freq nhmbr - 1 freq |
MetaPhone code - NNPRLMNT nonpairlament - 1 freq |
NONPAIRLAMENT |
| Time to execute Levenshtein function - 0.226692 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.431168 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.029277 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.039970 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.000997 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. |