| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cod-fish (0) - 1 freq gold-fish (2) - 5 freq coalfish (2) - 1 freq gowd-fush (3) - 2 freq scomfish (3) - 2 freq gowdfish (3) - 9 freq offish (3) - 12 freq goold-fish (3) - 2 freq cornish (3) - 48 freq ink-fish (3) - 1 freq codified (3) - 4 freq wolfish (3) - 1 freq man-fish (3) - 1 freq goldfish (3) - 17 freq catfish (3) - 1 freq monkfish (3) - 2 freq oaffish (3) - 1 freq codgie (4) - 2 freq danish (4) - 19 freq corsh (4) - 2 freq confide (4) - 4 freq waffish (4) - 2 freq coorsh (4) - 1 freq polish (4) - 69 freq conshis (4) - 1 freq |
cod-fish (0) - 1 freq coalfish (4) - 1 freq gold-fish (4) - 5 freq goold-fish (5) - 2 freq ink-fish (5) - 1 freq gowd-fush (5) - 2 freq catfish (5) - 1 freq man-fish (5) - 1 freq oaffish (6) - 1 freq wolfish (6) - 1 freq monkfish (6) - 2 freq goldfish (6) - 17 freq scomfish (6) - 2 freq codified (6) - 4 freq offish (6) - 12 freq gowdfish (6) - 9 freq cornish (6) - 48 freq daftish (7) - 2 freq stonefish (7) - 24 freq 'dish (7) - 2 freq eurofish (7) - 1 freq codlins (7) - 4 freq confaise (7) - 2 freq jeely-fish (7) - 1 freq pie-dish (7) - 3 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 - KTFX gowd-fush - 2 freq gowdfush - 1 freq gowdfish - 9 freq catfish - 1 freq cod-fish - 1 freq |
COD-FISH |
| Time to execute Levenshtein function - 0.610589 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.923831 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.074701 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.039846 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.000832 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. |