| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| luminatus (0) - 1 freq luminous (2) - 5 freq luminate (2) - 1 freq ruminants (3) - 1 freq laminatit (3) - 1 freq quintus (3) - 1 freq illuminates (3) - 2 freq eliminates (3) - 1 freq laminated (3) - 5 freq ruminate (3) - 1 freq lum-hats (3) - 1 freq dominates (3) - 2 freq laminate (3) - 2 freq luminaries (3) - 2 freq mints (4) - 41 freq dominatit (4) - 1 freq dominated (4) - 3 freq eemitates (4) - 1 freq culminated (4) - 1 freq urinal's (4) - 1 freq nominatit (4) - 1 freq illuminatit (4) - 2 freq facinates (4) - 1 freq lamingoes (4) - 1 freq germinates (4) - 1 freq |
luminatus (0) - 1 freq luminate (3) - 1 freq eliminates (3) - 1 freq luminous (3) - 5 freq dominates (4) - 2 freq laminate (4) - 2 freq luminaries (4) - 2 freq laminated (4) - 5 freq elemints (4) - 1 freq laminatit (4) - 1 freq laments (4) - 9 freq illuminates (4) - 2 freq ailmints (5) - 1 freq laminit (5) - 1 freq lumpots (5) - 1 freq lamingoes (5) - 1 freq elements (5) - 35 freq eliminate (5) - 2 freq emanates (5) - 1 freq nomintes (5) - 1 freq minutes (5) - 205 freq limits (5) - 15 freq lum-hats (5) - 1 freq ruminate (5) - 1 freq quintus (5) - 1 freq |
SoundEx code - L553 lowmond - 3 freq lament - 22 freq lamont - 8 freq laments - 9 freq lamond - 1 freq lemonade - 13 freq lomond - 17 freq lamentatiouns - 2 freq lamentin - 7 freq laminated - 5 freq lamentation - 4 freq lenient - 2 freq lamentit - 1 freq lunnonderrie - 1 freq lamentable - 1 freq laminit - 1 freq leenyint - 1 freq lamented - 2 freq laminatit - 1 freq leemonade - 2 freq lemonades - 1 freq lamantation - 1 freq lamentations - 1 freq laminate - 2 freq lamination - 1 freq limonade - 1 freq luminatus - 1 freq lamante - 1 freq 'lament - 3 freq luminatescot - 5 freq luminate - 1 freq |
MetaPhone code - LMNTS laments - 9 freq lemonades - 1 freq luminatus - 1 freq |
LUMINATUS |
| Time to execute Levenshtein function - 0.399981 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.696768 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.039384 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.083268 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.000960 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. |