| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nominations (0) - 5 freq nomination (1) - 1 freq domination (2) - 1 freq denominations (2) - 5 freq combinations (2) - 5 freq nominatin (2) - 1 freq abomination (3) - 5 freq lamination (3) - 1 freq dominating (3) - 1 freq imitations (3) - 3 freq limitations (3) - 2 freq abomination's (3) - 1 freq denomination (3) - 1 freq dominatin (3) - 6 freq examinations (3) - 1 freq motivations (3) - 2 freq dominions (3) - 1 freq commination (3) - 2 freq inclinations (3) - 1 freq nominatit (3) - 1 freq combination (3) - 22 freq novations (3) - 1 freq donations (3) - 2 freq non-nation (3) - 1 freq dominatit (4) - 1 freq |
nominations (0) - 5 freq nomination (2) - 1 freq denominations (3) - 5 freq nominatin (3) - 1 freq examinations (4) - 1 freq combinations (4) - 5 freq domination (4) - 1 freq novations (5) - 1 freq nomintes (5) - 1 freq nominatit (5) - 1 freq insinuations (5) - 1 freq donations (5) - 2 freq mintins (5) - 3 freq nomentanus (5) - 1 freq mentions (5) - 20 freq inclinations (5) - 1 freq munitions (5) - 2 freq dominions (5) - 1 freq imitations (5) - 3 freq dominating (5) - 1 freq lamination (5) - 1 freq abomination (5) - 5 freq limitations (5) - 2 freq abomination's (5) - 1 freq admonitions (5) - 1 freq |
SoundEx code - N553 nomentanus - 1 freq new-naemed - 1 freq niemand - 1 freq nominate - 1 freq nominated - 2 freq nomintes - 1 freq nominations - 5 freq nominatit - 1 freq nomination - 1 freq nominatin - 1 freq |
MetaPhone code - NMNXNS nominations - 5 freq |
NOMINATIONS |
| Time to execute Levenshtein function - 0.244370 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.405239 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.029535 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.047576 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.000889 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. |