| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fencin (0) - 1 freq fennin (1) - 53 freq fentin (1) - 2 freq fencing (1) - 1 freq fendin (1) - 5 freq wincin (2) - 1 freq fein (2) - 3 freq dancin (2) - 138 freq denyin (2) - 21 freq kenin (2) - 2 freq tensin (2) - 1 freq fellin (2) - 3 freq finnin (2) - 40 freq fenn (2) - 1 freq becin (2) - 1 freq feein (2) - 4 freq rentin (2) - 2 freq lennin (2) - 2 freq fentit (2) - 3 freq bendin (2) - 15 freq fendan (2) - 1 freq duncin (2) - 23 freq decin (2) - 2 freq fettin (2) - 1 freq funcie (2) - 1 freq |
fencin (0) - 1 freq fendin (2) - 5 freq fancyin (2) - 3 freq fencing (2) - 1 freq fentin (2) - 2 freq fennin (2) - 53 freq fandin (3) - 1 freq funnin (3) - 7 freq finkin (3) - 14 freq fancie (3) - 17 freq fundin (3) - 62 freq fenian (3) - 3 freq mincin (3) - 2 freq fintin (3) - 1 freq fantin (3) - 20 freq fleecin (3) - 2 freq fannin (3) - 9 freq forcin (3) - 22 freq findin (3) - 71 freq feenyin (3) - 4 freq finin (3) - 3 freq poncin (3) - 1 freq fences (3) - 22 freq fancyan (3) - 1 freq fincana (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 - FNSN venison - 2 freq finzean - 8 freq fanzine - 1 freq fencin - 1 freq |
FENCIN |
| Time to execute Levenshtein function - 0.229165 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.352851 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.040077 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.047534 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.000915 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. |