Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fxbz (0) - 1 freq feb (2) - 7 freq fsb (2) - 1 freq xb (2) - 3 freq fibf (2) - 1 freq fkbv (2) - 3 freq xhz (2) - 1 freq fxc (2) - 1 freq obz (2) - 1 freq fx (2) - 4 freq fob (2) - 4 freq fobs (2) - 1 freq bxz (2) - 1 freq fdb (2) - 1 freq fibo (2) - 1 freq xz (2) - 4 freq dbz (2) - 1 freq xxz (2) - 1 freq bxb (2) - 1 freq fub (2) - 2 freq frz (2) - 1 freq dpbz (2) - 1 freq xbo (2) - 1 freq nxz (2) - 1 freq abz (2) - 17 freq |
fxbz (0) - 1 freq fnlz (4) - 1 freq fz (4) - 12 freq fab (4) - 18 freq fb (4) - 27 freq gxz (4) - 1 freq fiz (4) - 2 freq faz (4) - 1 freq fzbh (4) - 1 freq feba (4) - 1 freq bz (4) - 2 freq fbi (4) - 1 freq fuzz (4) - 1 freq fizz (4) - 11 freq fsz (4) - 1 freq fib (4) - 3 freq fjz (4) - 1 freq fjb (4) - 2 freq xlz (4) - 1 freq abz (4) - 17 freq pxqz (4) - 2 freq ixcz (4) - 1 freq fxlv (4) - 1 freq nxb (4) - 1 freq lxb (4) - 1 freq |
SoundEx code - F212 facebuik - 7 freq facebook - 58 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 - FKSBS fxbz - 1 freq |
FXBZ |
Time to execute Levenshtein function - 0.181374 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.345939 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.027333 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.041991 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.000790 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. |