| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fishy-faced (0) - 2 freq aissy-faced (2) - 1 freq fite-faced (3) - 1 freq fresh-faced (3) - 3 freq sham-faced (4) - 1 freq ridd-faced (4) - 2 freq fair-faced (4) - 3 freq fish-food (4) - 1 freq fitefaced (4) - 1 freq din-faced (4) - 1 freq frug-faced (4) - 1 freq fitshisface (4) - 1 freq bricht-faced (4) - 1 freq rid-faced (4) - 4 freq fish-tumed (4) - 1 freq fishwifie (5) - 1 freq hingit-faced (5) - 1 freq fished (5) - 20 freq fishwifes (5) - 2 freq faust-face (5) - 1 freq green-faced (5) - 1 freq resurfaced (5) - 2 freq tippy-taed (5) - 3 freq toarn-faced (5) - 1 freq fresh-baked (5) - 1 freq |
fishy-faced (0) - 2 freq aissy-faced (4) - 1 freq fresh-faced (4) - 3 freq fish-food (5) - 1 freq fite-faced (5) - 1 freq frug-faced (6) - 1 freq fair-faced (6) - 3 freq fish-tumed (6) - 1 freq sham-faced (6) - 1 freq fish-scale (7) - 1 freq fisherfock (7) - 1 freq shame-faced (7) - 2 freq soor-faced (7) - 4 freq faust-face (7) - 1 freq fause-faces (7) - 1 freq fause-face (7) - 4 freq fitshisface (7) - 1 freq fitefaced (7) - 1 freq ridd-faced (7) - 2 freq rid-faced (7) - 4 freq din-faced (7) - 1 freq reid-faced (8) - 3 freq blae-faced (8) - 2 freq fishwife (8) - 2 freq lyart-faced (8) - 1 freq |
SoundEx code - F212 facebuik - 7 freq facebook - 60 freq fishwife's - 1 freq fish-wives - 1 freq fishy-faced - 2 freq facebox - 2 freq fag-packet - 1 freq fuseboxes - 1 freq fishwifes - 2 freq fishwives - 2 freq fsbusiness - 1 freq fehjvxigas - 1 freq fzwpzyglp - 1 freq fgwbzz - 1 freq fjzfssie - 1 freq fvhejvyzsk - 1 freq fhcipc - 1 freq fxbz - 1 freq fspk - 1 freq fause-face - 4 freq fause-faces - 1 freq fvwsopqk - 1 freq fuckpig - 1 freq fspoysqn - 1 freq fgjypaqbu - 1 freq fwcvqtd - 1 freq fkkxbusm - 1 freq fzbixj - 1 freq fspsejf - 1 freq 'facebook - 1 freq fqyfcbcgyi - 1 freq |
MetaPhone code - FXFST fishy-faced - 2 freq |
FISHY-FACED |
| Time to execute Levenshtein function - 0.312542 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.674178 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.067050 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.037497 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.000898 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. |