| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fag-packet (0) - 1 freq wage-packet (2) - 1 freq flat-packed (3) - 1 freq hard-packed (4) - 1 freq han-pickit (4) - 1 freq packet (4) - 62 freq backpacker (4) - 3 freq faw-back (4) - 2 freq massackert (5) - 1 freq mid-paced (5) - 1 freq packt (5) - 2 freq attackit (5) - 2 freq crag-face (5) - 1 freq packets (5) - 20 freq lifejacket (5) - 1 freq hacket (5) - 1 freq fag-en (5) - 1 freq re-pack (5) - 1 freq baw-faced (5) - 1 freq apache (5) - 2 freq sky-rocket (5) - 3 freq ransacked (5) - 2 freq a-paece (5) - 1 freq hapshacklet (5) - 1 freq placket (5) - 1 freq |
fag-packet (0) - 1 freq wage-packet (3) - 1 freq han-pickit (6) - 1 freq flat-packed (6) - 1 freq faw-back (7) - 2 freq packet (7) - 62 freq poacket (8) - 37 freq fackit (8) - 1 freq 'pocket (8) - 1 freq fairtricket (8) - 1 freq sky-rocket (8) - 3 freq blae-backit (8) - 1 freq six-packs (8) - 1 freq face-paint (8) - 2 freq fair-tricket (8) - 2 freq pocket (8) - 94 freq six-pack (8) - 4 freq fecket (8) - 1 freq spicket (8) - 1 freq packt (8) - 2 freq unpackit (8) - 1 freq backpacker (8) - 3 freq hard-packed (8) - 1 freq re-pack (8) - 1 freq picket (8) - 24 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 - FKPKT fag-packet - 1 freq |
FAG-PACKET |
| Time to execute Levenshtein function - 0.593708 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 - 1.022992 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.077971 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.077827 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.001182 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. |