| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jamstane (0) - 1 freq sanstane (2) - 1 freq capstane (2) - 1 freq gemstane (2) - 2 freq ramstam (3) - 10 freq drystane (3) - 5 freq flagstane (3) - 1 freq castan (3) - 1 freq chestane (3) - 1 freq jamlang (3) - 11 freq patane (3) - 1 freq hailstane (3) - 1 freq afaistane (3) - 5 freq keystane (3) - 3 freq gemstone (3) - 1 freq justine (3) - 33 freq sandstane (3) - 6 freq 'astana (3) - 1 freq hambane (3) - 1 freq dunstane (3) - 1 freq limestane (3) - 1 freq lairstane (3) - 3 freq brimstane (3) - 4 freq wastage (3) - 3 freq jamsie (3) - 3 freq |
jamstane (0) - 1 freq gemstane (3) - 2 freq gemstone (4) - 1 freq limestane (4) - 1 freq justine (4) - 33 freq sanstane (4) - 1 freq capstane (4) - 1 freq ramstein (5) - 1 freq lairstane (5) - 3 freq jamsie (5) - 3 freq brimstane (5) - 4 freq stane (5) - 414 freq jmsn (5) - 1 freq saunstane (5) - 1 freq justyna (5) - 1 freq jamesina (5) - 7 freq lampstan (5) - 1 freq wastan (5) - 1 freq gemstanes (5) - 1 freq 'astana (5) - 1 freq castan (5) - 1 freq chestane (5) - 1 freq justin (5) - 6 freq drystane (5) - 5 freq ramstam (5) - 10 freq |
SoundEx code - J523 jinkwhit - 1 freq jinked - 8 freq johnston - 18 freq junction - 11 freq junctien's - 1 freq joanstoon - 1 freq johnston' - 1 freq johnstone - 35 freq jinged - 1 freq jinkit - 7 freq jaunched - 1 freq jinxed - 2 freq jensdóttir - 1 freq jamstane - 1 freq junkit - 1 freq jensdottir - 2 freq janeygodley - 50 freq janegotagun - 1 freq jmacdeee - 1 freq jamestudhope - 2 freq johnmcd - 2 freq joewhimster - 7 freq jamieeast - 2 freq jamesaithie - 3 freq jamesdoleman - 4 freq janeygodley's - 1 freq jomcd - 3 freq johnwest - 4 freq jamesedwinmusic - 1 freq jwmmctykzk - 1 freq jmscd - 1 freq jonstackpool - 1 freq |
MetaPhone code - JMSTN gemstone - 1 freq gemstane - 2 freq jamstane - 1 freq |
JAMSTANE |
| Time to execute Levenshtein function - 0.609252 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.582616 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.027375 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.043396 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.000780 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. |