Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
feisant (0) - 1 freq versant (2) - 2 freq heisan (2) - 1 freq feint (2) - 5 freq peasant (2) - 12 freq feilan (2) - 2 freq paisant (2) - 1 freq pleisant (2) - 2 freq heilant (2) - 1 freq sensan (3) - 1 freq reidan (3) - 1 freq praisant (3) - 2 freq fesht (3) - 2 freq fiat (3) - 3 freq fesst (3) - 1 freq pedant (3) - 3 freq feisty (3) - 1 freq flist (3) - 8 freq yeusan (3) - 1 freq weiman (3) - 1 freq friesans (3) - 5 freq beilan (3) - 1 freq arisan (3) - 1 freq sant (3) - 5 freq flint (3) - 8 freq |
feisant (0) - 1 freq peasant (3) - 12 freq feint (3) - 5 freq paisant (3) - 1 freq fisht (4) - 2 freq frint (4) - 1 freq seasont (4) - 1 freq faant (4) - 1 freq faist (4) - 29 freq foistit (4) - 1 freq isnt (4) - 2 freq fient (4) - 6 freq fishnet (4) - 1 freq fawsont (4) - 1 freq fist (4) - 56 freq faint (4) - 35 freq fint (4) - 2 freq fessit (4) - 2 freq fest (4) - 54 freq lisent (4) - 1 freq fant (4) - 2 freq fassont (4) - 1 freq deesint (4) - 2 freq daesant (4) - 1 freq fsnet (4) - 1 freq |
SoundEx code - F253 fozie-moothed - 1 freq fashioned - 18 freq facinatit - 1 freq fascinatit - 4 freq fashiont - 5 freq fassont - 1 freq fishnets - 2 freq fascinated - 9 freq fascination - 7 freq fozent - 2 freq fascinatin - 16 freq fessened - 1 freq fescination - 1 freq fescinatin - 1 freq faushiont - 1 freq fishnet - 1 freq fascinating - 6 freq feigned-deefniss - 1 freq fascinatan - 1 freq faushioned - 3 freq fashion'd - 1 freq fag-ends - 1 freq 'feigned - 1 freq fsnet - 1 freq faushent - 1 freq fawsont - 1 freq feisant - 1 freq facinates - 1 freq €˜facund - 1 freq fashont - 2 freq fassiont - 1 freq fcnwd - 1 freq facundosavala - 2 freq fzwndv - 1 freq feismother - 1 freq fihjoomdrz - 1 freq |
MetaPhone code - FSNT vicinity - 8 freq fassont - 1 freq fozent - 2 freq fessened - 1 freq visand - 1 freq pheasant - 6 freq fsnet - 1 freq fawsont - 1 freq feisant - 1 freq fassiont - 1 freq |
FEISANT |
Time to execute Levenshtein function - 0.204278 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.374270 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.030037 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.038148 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.000944 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. |