| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fecker (0) - 14 freq pecker (1) - 1 freq fucker (1) - 22 freq flecker (1) - 1 freq fecket (1) - 1 freq fecked (1) - 16 freq feckers (1) - 7 freq decker (1) - 12 freq fecken (1) - 3 freq keeker (2) - 3 freq fucked (2) - 64 freq fever (2) - 37 freq ficher (2) - 4 freq packer (2) - 1 freq licker (2) - 1 freq locker (2) - 3 freq feeger (2) - 1 freq teaker (2) - 1 freq pecked (2) - 3 freq feche (2) - 1 freq seeker (2) - 2 freq fecks (2) - 3 freq secked (2) - 2 freq deckers (2) - 2 freq lecher (2) - 1 freq |
fecker (0) - 14 freq fucker (1) - 22 freq decker (2) - 12 freq pecker (2) - 1 freq feckers (2) - 7 freq fecken (2) - 3 freq flecker (2) - 1 freq fecket (2) - 1 freq fecked (2) - 16 freq zucker (3) - 1 freq feck (3) - 160 freq pucker (3) - 1 freq docker (3) - 4 freq nicker (3) - 1 freq feckin (3) - 51 freq rocker (3) - 3 freq feckle (3) - 2 freq faker (3) - 3 freq mucker (3) - 11 freq facer (3) - 2 freq ticker (3) - 3 freq wicker (3) - 2 freq cocker (3) - 1 freq icker (3) - 2 freq sicker (3) - 8 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 |
FECKER |
| Time to execute Levenshtein function - 0.259424 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.423154 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.029985 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.047563 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.001197 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. |