| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| finkin (0) - 14 freq pinkin (1) - 1 freq inkin (1) - 1 freq tinkin (1) - 57 freq finin (1) - 3 freq jinkin (1) - 17 freq linkin (1) - 15 freq finking (1) - 1 freq binkin (1) - 1 freq fingin (1) - 1 freq findin (1) - 71 freq rinkin (1) - 1 freq winkin (1) - 16 freq hinkin (1) - 81 freq sinkin (1) - 25 freq finnin (1) - 40 freq fintin (1) - 1 freq kinkin (1) - 3 freq jinkan (2) - 1 freq tunkin (2) - 1 freq tinlin (2) - 1 freq fuckin (2) - 1032 freq finndin (2) - 11 freq sinkit (2) - 1 freq fitin (2) - 4 freq |
finkin (0) - 14 freq winkin (2) - 16 freq rinkin (2) - 1 freq findin (2) - 71 freq sinkin (2) - 25 freq finnin (2) - 40 freq kinkin (2) - 3 freq fintin (2) - 1 freq fingin (2) - 1 freq hinkin (2) - 81 freq tinkin (2) - 57 freq inkin (2) - 1 freq binkin (2) - 1 freq finin (2) - 3 freq pinkin (2) - 1 freq jinkin (2) - 17 freq linkin (2) - 15 freq finking (2) - 1 freq ponkin (3) - 1 freq fynnin (3) - 4 freq finnen (3) - 1 freq funnin (3) - 7 freq fackin (3) - 1 freq fennin (3) - 53 freq fekkin (3) - 1 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 finkin - 14 freq finnishin - 1 freq finishing - 1 freq finzean - 8 freq fincana - 1 freq fine-smellin - 1 freq finesmellin - 1 freq fancyman - 1 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 - FNKN finnegan - 21 freq 'finnegan - 1 freq finkin - 14 freq fincana - 1 freq fanquine - 1 freq fingan - 1 freq |
FINKIN |
| Time to execute Levenshtein function - 0.305483 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.531022 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.058505 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.038143 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.004000 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. |