| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| facebuik (0) - 7 freq facebook (2) - 60 freq facebox (3) - 2 freq haunbuik (3) - 2 freq facefu (3) - 2 freq 'facebook (3) - 1 freq sangbuik (3) - 1 freq notebuik (3) - 1 freq facetit (3) - 1 freq facemask (3) - 1 freq buik (4) - 415 freq fateful (4) - 3 freq jacquie (4) - 1 freq sae-lik (4) - 2 freq sac-lik (4) - 1 freq hamewurk (4) - 1 freq nate-lik (4) - 1 freq cuik (4) - 4 freq faerdie (4) - 2 freq faceility (4) - 1 freq faestin (4) - 2 freq fack (4) - 182 freq facultie (4) - 1 freq laebrir (4) - 1 freq macduie (4) - 1 freq |
facebuik (0) - 7 freq facebook (2) - 60 freq 'facebook (4) - 1 freq facebox (4) - 2 freq fcuk (5) - 2 freq facemask (5) - 1 freq fack (5) - 182 freq facetit (5) - 1 freq facefu (5) - 2 freq notebuik (5) - 1 freq haunbuik (5) - 2 freq cbbuk (6) - 1 freq fabbie (6) - 2 freq facees (6) - 1 freq faces (6) - 230 freq freebie (6) - 2 freq face (6) - 1711 freq fackfu (6) - 1 freq fackit (6) - 1 freq faced (6) - 69 freq factorie (6) - 2 freq fonetik (6) - 2 freq wycelik (6) - 1 freq facets (6) - 2 freq faceelity (6) - 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 - FSBK facebuik - 7 freq facebook - 60 freq 'facebook - 1 freq |
FACEBUIK |
| Time to execute Levenshtein function - 0.230568 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.372488 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.027741 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.038340 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.001108 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. |