| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fardins (0) - 1 freq fardin (1) - 1 freq farins (1) - 1 freq darlins (2) - 4 freq fairins (2) - 7 freq martins (2) - 2 freq farting (2) - 3 freq gairdins (2) - 2 freq bardies (2) - 1 freq wirdins (2) - 1 freq fadin (2) - 20 freq firkins (2) - 2 freq freins (2) - 45 freq tardis (2) - 2 freq farin (2) - 10 freq markins (2) - 4 freq findins (2) - 4 freq jardin (2) - 2 freq failins (2) - 1 freq parkins (2) - 1 freq forkins (2) - 1 freq waddins (2) - 10 freq arins (2) - 1 freq margins (2) - 3 freq haudins (2) - 4 freq |
fardins (0) - 1 freq farins (2) - 1 freq fardin (2) - 1 freq freins (3) - 45 freq firkins (3) - 2 freq farden (3) - 1 freq sardines (3) - 3 freq forkins (3) - 1 freq herdins (3) - 3 freq findins (3) - 4 freq wirdins (3) - 1 freq farns (3) - 2 freq gardens (3) - 10 freq wardens (3) - 2 freq gairdins (3) - 2 freq fundins (3) - 1 freq fairins (3) - 7 freq forderins (4) - 3 freq gairdens (4) - 91 freq farming (4) - 7 freq wardin (4) - 1 freq warkins (4) - 1 freq fartin's (4) - 1 freq barins (4) - 4 freq farmin (4) - 1 freq |
SoundEx code - F635 fourteenth - 6 freq freedom's - 3 freq feartiness - 1 freq fortnight - 17 freq fortune - 87 freq fourteen - 47 freq freedom - 111 freq fortnicht - 24 freq fire-tongs - 1 freq fortun's - 1 freq furtunit - 1 freq fortnat - 1 freq fartin - 10 freq fowreteen - 1 freq fortunate - 9 freq farden - 1 freq fortnicht's - 2 freq fortoun - 1 freq fortuin - 3 freq frothin - 3 freq fortnecht - 1 freq freedoms - 13 freq free-thinkin - 1 freq fowerteen - 46 freq fortun - 5 freq fartin' - 1 freq foryatten - 5 freq fortune' - 1 freq fourteen-year-auld - 1 freq frettin - 2 freq furthieness - 1 freq fortunately - 10 freq fortynine - 1 freq four-times - 1 freq f-f-fourteen - 1 freq freitin - 2 freq fowerteen-ear-aul - 2 freq fowrteenth - 1 freq furtune - 1 freq fowerteenth - 2 freq ferdinand - 5 freq fortunes - 7 freq fourteen' - 1 freq forty-wan - 1 freq foartune - 1 freq farthin - 5 freq freedman's - 1 freq 'freedoms' - 1 freq 'fortunate' - 1 freq fruition - 2 freq fortin - 1 freq forteent - 2 freq 'farton' - 1 freq fourteen-inch - 1 freq 'fowerteen - 2 freq friedome - 5 freq fowerteen-year-aulds - 1 freq fartin's - 1 freq forteen - 3 freq fertin - 1 freq froadin - 1 freq fair-daein - 1 freq fredome - 1 freq fire-aeting - 1 freq fairdie-maet - 1 freq freithin - 1 freq freithin't - 1 freq fordoun - 3 freq fourdin - 1 freq freedom-hunger - 1 freq furthmair - 1 freq fortunat - 1 freq friedomes - 1 freq fortean - 5 freq fruit-maele - 1 freq fardins - 1 freq freudian - 1 freq €œfreedom - 1 freq €˜freedom - 1 freq fowrteent - 1 freq fowerteent - 2 freq forthink - 1 freq froathin - 1 freq fardin - 1 freq fortnight's - 1 freq firritin - 1 freq forty-nine - 1 freq farting - 3 freq fourdon - 1 freq fredmacaulay - 5 freq fairtin - 1 freq forthemanynott - 3 freq fairydeanrovers - 3 freq fortnite - 2 freq |
MetaPhone code - FRTNS feartiness - 1 freq fortun's - 1 freq fortunes - 7 freq fartin's - 1 freq vreetins - 1 freq fardins - 1 freq |
FARDINS |
| Time to execute Levenshtein function - 0.210573 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.349792 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.027537 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.037518 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.000929 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. |