| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| finking (0) - 1 freq finding (1) - 16 freq jinking (1) - 1 freq sinking (1) - 5 freq finkin (1) - 8 freq hinking (1) - 7 freq linking (1) - 2 freq tinking (1) - 1 freq filing (2) - 1 freq funding (2) - 5 freq singing (2) - 29 freq banking (2) - 3 freq firming (2) - 1 freq drinking (2) - 18 freq kicking (2) - 6 freq fucking (2) - 39 freq fencing (2) - 1 freq winkin (2) - 16 freq inkling (2) - 1 freq winding (2) - 2 freq sinkin' (2) - 2 freq firkins (2) - 2 freq fingin (2) - 1 freq tinkling (2) - 1 freq fitting (2) - 9 freq |
finking (0) - 1 freq tinking (2) - 1 freq finding (2) - 16 freq hinking (2) - 7 freq linking (2) - 2 freq finkin (2) - 8 freq sinking (2) - 5 freq jinking (2) - 1 freq flaking (3) - 1 freq fooking (3) - 1 freq fecking (3) - 4 freq lionking (3) - 1 freq funning (3) - 1 freq fking (3) - 7 freq finng (3) - 1 freq honking (3) - 6 freq faking (3) - 1 freq fencing (3) - 1 freq banking (3) - 3 freq fucking (3) - 39 freq funding (3) - 5 freq binkin (4) - 1 freq risking (4) - 3 freq ticking (4) - 1 freq minding (4) - 7 freq |
SoundEx code - F525 feeneeshin - 3 freq finnegan - 21 freq finnegan's - 4 freq 'finnegan - 1 freq feenishin - 22 freq finishin - 16 freq fancyin - 3 freq finnishin - 1 freq finishing - 1 freq finzean - 8 freq fincana - 1 freq fine-smellin - 1 freq finesmellin - 1 freq fancyman - 1 freq finkin - 8 freq feeneesheen - 1 freq foungin - 1 freq fancyan - 1 freq finishan - 1 freq fanzine - 1 freq fungin - 1 freq feinishin - 3 freq faimishin - 1 freq fencin - 1 freq fencing - 1 freq finneganing - 1 freq fionasnp - 1 freq fingin - 1 freq fanquine - 1 freq fingan - 1 freq fmnkm - 1 freq fmsnewmedia - 1 freq finking - 1 freq |
MetaPhone code - FNKNK finking - 1 freq |
FINKING |
| Time to execute Levenshtein function - 0.233715 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.401053 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.027542 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.042978 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.000995 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. |