| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snaw-mannie (0) - 1 freq snawmannies (2) - 1 freq spacemannie (3) - 1 freq tax-mannie (3) - 3 freq caw-cannie (3) - 3 freq 'caw-cannie (3) - 1 freq pack-mannie (4) - 1 freq gran-minnie (4) - 1 freq snaw-happit (4) - 2 freq cawd-cannie (4) - 1 freq taxmannie (4) - 1 freq tax-mannies (4) - 3 freq supermannie (4) - 3 freq snawman (4) - 10 freq nannie (5) - 4 freq jaw-bane (5) - 1 freq aul'mannie (5) - 1 freq snawinan (5) - 1 freq i'mannie (5) - 6 freq 'mannie (5) - 1 freq sannie (5) - 6 freq snaw-white (5) - 13 freq on-mannan (5) - 1 freq slamannan (5) - 1 freq stanthemannie (5) - 1 freq |
snaw-mannie (0) - 1 freq snawmannies (4) - 1 freq snawman (6) - 10 freq 'caw-cannie (6) - 1 freq caw-cannie (6) - 3 freq tax-mannie (6) - 3 freq spacemannie (6) - 1 freq snawmen (7) - 1 freq supermannie (7) - 3 freq snowman (7) - 2 freq gran-minnie (7) - 1 freq pack-mannie (7) - 1 freq snawinan (7) - 1 freq on-mannan (8) - 1 freq snaw-white (8) - 13 freq new-made (8) - 1 freq spae-man (8) - 1 freq gentlemannie (8) - 1 freq stanthemannie (8) - 1 freq snawline (8) - 1 freq taxmannie (8) - 1 freq cawd-cannie (8) - 1 freq snaw-happit (8) - 2 freq tax-mannies (8) - 3 freq sing-sangie (8) - 1 freq |
SoundEx code - S555 synonyms - 3 freq snawmen - 1 freq summonin - 1 freq samen-nems - 1 freq summonan - 1 freq snowmen - 1 freq snawman - 10 freq €˜snawmen - 1 freq snawmannies - 1 freq snawinan - 1 freq snaw-mannie - 1 freq synonymous - 2 freq semi-anonymously - 2 freq someman - 1 freq snowman - 2 freq shonamain - 8 freq simonmount - 3 freq |
MetaPhone code - SNMN snawmen - 1 freq cinnamon - 5 freq snowmen - 1 freq snawman - 10 freq €˜snawmen - 1 freq snaw-mannie - 1 freq snowman - 2 freq |
SNAW-MANNIE |
| Time to execute Levenshtein function - 0.247766 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.417435 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.029808 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.076280 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.001327 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. |