| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| namaste (0) - 2 freq maste (2) - 4 freq €œnamaste (2) - 1 freq lamante (2) - 1 freq €˜namaste (2) - 1 freq ramasse (2) - 2 freq ramage (3) - 2 freq masse (3) - 1 freq nasty (3) - 27 freq nanas (3) - 1 freq tamata (3) - 8 freq faste (3) - 1 freq avast (3) - 3 freq faast (3) - 4 freq names (3) - 300 freq 'mate (3) - 4 freq amuse (3) - 8 freq amost (3) - 1 freq vacate (3) - 1 freq namesake (3) - 4 freq natale (3) - 1 freq hamster (3) - 5 freq arase (3) - 1 freq chaste (3) - 1 freq name (3) - 1202 freq |
namaste (0) - 2 freq maste (3) - 4 freq aamaist (4) - 55 freq naisty (4) - 9 freq namesake (4) - 4 freq enmaist (4) - 1 freq naist (4) - 7 freq inmaist (4) - 2 freq neast (4) - 1 freq naistie (4) - 1 freq namit (4) - 4 freq mast (4) - 20 freq names' (4) - 1 freq animate (4) - 1 freq amost (4) - 1 freq amaist (4) - 24 freq moste (4) - 1 freq nasty (4) - 27 freq namesy (4) - 1 freq €˜namaste (4) - 1 freq ramasse (4) - 2 freq names (4) - 300 freq lamante (4) - 1 freq €œnamaste (4) - 1 freq a'maist (5) - 1 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.475923 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.599198 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.027509 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.037278 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.000776 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. |