| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cattie-faces (0) - 9 freq cattie-face (1) - 14 freq €˜cattie-faces (2) - 1 freq cattyface (4) - 2 freq fause-faces (4) - 1 freq tattie-based (4) - 1 freq yatt-races (4) - 1 freq watterfaals (5) - 1 freq captivates (5) - 1 freq fair-faced (5) - 3 freq twae-faced (5) - 1 freq bare-faced (5) - 4 freq tattie-heids (5) - 1 freq catties (5) - 3 freq cantie-est (5) - 1 freq fite-faced (5) - 1 freq tattie-masher (5) - 1 freq saxtie-fyve (5) - 1 freq wart-faced (5) - 2 freq interfaces (5) - 1 freq watter-flees (5) - 1 freq battle-axe (5) - 1 freq fause-face (5) - 4 freq white-faced (5) - 8 freq partan-face (5) - 1 freq |
cattie-faces (0) - 9 freq cattie-face (2) - 14 freq €˜cattie-faces (4) - 1 freq yatt-races (6) - 1 freq cattyface (6) - 2 freq fause-faces (7) - 1 freq watter-flees (8) - 1 freq interfaces (8) - 1 freq white-faced (8) - 8 freq cattie's (8) - 1 freq cuttie-like (8) - 1 freq tattie-scones (8) - 1 freq fite-faced (8) - 1 freq wart-faced (8) - 2 freq twae-faced (8) - 1 freq tattie-heids (8) - 1 freq watterfaals (8) - 1 freq tattie-based (8) - 1 freq catties (8) - 3 freq lyart-faced (9) - 1 freq face-tae-face (9) - 2 freq cairt-fu's (9) - 1 freq steen-faced (9) - 1 freq butterflees (9) - 14 freq crag-face (9) - 1 freq |
SoundEx code - C312 cattyface - 2 freq cattie-face - 14 freq cutbacks - 1 freq city-fowk - 1 freq cuddy-back - 1 freq cheatie-pussie - 7 freq cattie-faces - 9 freq €˜cattie-faces - 1 freq catfish - 1 freq codification - 3 freq cod-fish - 1 freq catfacebatface - 1 freq cdfky - 1 freq ctypvshdg - 1 freq cdpsdg - 1 freq ctfgdel - 1 freq ctvk - 1 freq |
MetaPhone code - KTFSS cattie-faces - 9 freq €˜cattie-faces - 1 freq gdfeyzus - 1 freq |
CATTIE-FACES |
| Time to execute Levenshtein function - 0.236295 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.455158 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.027344 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.042835 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.000984 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. |