| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fucker (0) - 22 freq fusker (1) - 1 freq pucker (1) - 1 freq fecker (1) - 14 freq fucked (1) - 64 freq zucker (1) - 1 freq sucker (1) - 3 freq mucker (1) - 11 freq fuckers (1) - 9 freq fuskee (2) - 2 freq fuckan (2) - 7 freq tusker (2) - 2 freq fuckit (2) - 1 freq burker (2) - 2 freq sucked (2) - 6 freq kyucker (2) - 3 freq faker (2) - 3 freq bulker (2) - 1 freq brucker (2) - 1 freq unker (2) - 4 freq fu'er (2) - 1 freq packer (2) - 1 freq fucks (2) - 11 freq fecket (2) - 1 freq licker (2) - 1 freq |
fucker (0) - 22 freq fecker (1) - 14 freq sucker (2) - 3 freq mucker (2) - 11 freq zucker (2) - 1 freq fuckers (2) - 9 freq fusker (2) - 1 freq fucked (2) - 64 freq pucker (2) - 1 freq fecked (3) - 16 freq facer (3) - 2 freq icker (3) - 2 freq pecker (3) - 1 freq locker (3) - 3 freq feckers (3) - 7 freq nicker (3) - 1 freq ticker (3) - 3 freq fuckum (3) - 1 freq flicker (3) - 13 freq decker (3) - 12 freq fuck (3) - 529 freq sicker (3) - 8 freq quicker (3) - 57 freq fecken (3) - 3 freq flecker (3) - 1 freq |
SoundEx code - F260 feigur - 16 freq figure - 106 freq fykier - 1 freq facer - 2 freq figger - 6 freq figur - 2 freq fisher - 41 freq fizzer - 6 freq ficher - 4 freq fucker - 22 freq fissure - 1 freq figir - 11 freq faker - 3 freq fasherie - 5 freq fozier - 1 freq foghar - 1 freq fusker - 1 freq figaro' - 1 freq feegur - 7 freq fisherraw - 2 freq fugiear - 1 freq figurr - 2 freq fígur - 1 freq feeger - 1 freq fâcher - 1 freq fakery - 1 freq fisherrow - 4 freq fecker - 14 freq |
MetaPhone code - FKR feigur - 16 freq figure - 106 freq vcr - 1 freq fykier - 1 freq figger - 6 freq figur - 2 freq fucker - 22 freq vigour - 6 freq viagra - 4 freq faker - 3 freq figaro' - 1 freq feegur - 7 freq figurr - 2 freq vicar - 1 freq fígur - 1 freq vogrie - 2 freq vickyra - 1 freq fakery - 1 freq vqrra - 1 freq fecker - 14 freq |
FUCKER |
| Time to execute Levenshtein function - 0.228371 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.335173 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.027392 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.037619 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.000906 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. |