| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| namaste (0) - 2 freq maste (2) - 4 freq €˜namaste (2) - 1 freq lamante (2) - 1 freq ramasse (2) - 2 freq €œnamaste (2) - 1 freq masse (3) - 1 freq maasie (3) - 1 freq vacate (3) - 1 freq amaze (3) - 4 freq animate (3) - 1 freq master (3) - 21 freq namit (3) - 4 freq faste (3) - 1 freq aste (3) - 1 freq matte (3) - 1 freq laste (3) - 2 freq negate (3) - 2 freq masie (3) - 3 freq amassed (3) - 2 freq amaist (3) - 24 freq abase (3) - 1 freq neast (3) - 1 freq faaster (3) - 6 freq samanth (3) - 1 freq |
namaste (0) - 2 freq maste (3) - 4 freq naistie (4) - 1 freq inmaist (4) - 2 freq nasty (4) - 27 freq naist (4) - 7 freq amaist (4) - 24 freq namesy (4) - 1 freq naisty (4) - 10 freq amost (4) - 1 freq mast (4) - 21 freq moste (4) - 1 freq neast (4) - 1 freq enmaist (4) - 1 freq €œnamaste (4) - 1 freq ramasse (4) - 2 freq lamante (4) - 1 freq €˜namaste (4) - 1 freq namesake (4) - 4 freq aamaist (4) - 56 freq animate (4) - 1 freq names' (4) - 1 freq namit (4) - 4 freq names (4) - 304 freq neist (5) - 561 freq |
SoundEx code - N523 non-stop - 5 freq newington - 3 freq non-starter - 1 freq non-shaetlan - 1 freq non-gà idhealtachd - 1 freq nimsht - 1 freq nonstop - 1 freq non-scots-speakers - 1 freq namaste - 2 freq €˜namaste - 1 freq non-standard - 2 freq non-standardness - 1 freq €œnamaste - 1 freq non-scots - 3 freq nine-stanza - 1 freq nuanced - 2 freq nanicht - 1 freq nonstandard - 1 freq |
MetaPhone code - NMST namaste - 2 freq €˜namaste - 1 freq €œnamaste - 1 freq |
NAMASTE |
| Time to execute Levenshtein function - 0.213432 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.388139 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.027444 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.037830 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.000859 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. |