Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fairin (0) - 13 freq rairin (1) - 22 freq fairtin (1) - 1 freq fairins (1) - 7 freq sairin (1) - 3 freq wairin (1) - 1 freq hairin (1) - 3 freq lairin (1) - 2 freq airin (1) - 4 freq flairin (1) - 2 freq fairie (1) - 4 freq failin (1) - 26 freq firin (1) - 29 freq faerin (1) - 1 freq fairmin (1) - 22 freq farin (1) - 10 freq mainin (2) - 3 freq facin (2) - 32 freq ailin (2) - 2 freq failing (2) - 2 freq sirin (2) - 1 freq mairit (2) - 11 freq ainin (2) - 1 freq earrin (2) - 1 freq faalin (2) - 12 freq |
fairin (0) - 13 freq farin (1) - 10 freq faerin (1) - 1 freq firin (1) - 29 freq failin (2) - 26 freq feerin (2) - 1 freq fearin (2) - 4 freq furin (2) - 1 freq fairnie (2) - 30 freq fairie (2) - 4 freq fairmin (2) - 22 freq sairin (2) - 3 freq fairins (2) - 7 freq fairtin (2) - 1 freq rairin (2) - 22 freq flairin (2) - 2 freq wairin (2) - 1 freq lairin (2) - 2 freq airin (2) - 4 freq hairin (2) - 3 freq freein (3) - 3 freq furein (3) - 1 freq wirin (3) - 2 freq firit (3) - 1 freq saurin (3) - 1 freq |
SoundEx code - F650 form - 288 freq from - 582 freq ferm - 340 freq firm - 67 freq freen - 218 freq freein - 3 freq frame - 61 freq frien - 61 freq fairm - 120 freq forran - 1 freq frein - 36 freq froun - 5 freq furrin - 7 freq firin - 29 freq froon - 8 freq farin - 10 freq fryin - 15 freq fairin - 13 freq form' - 2 freq 'freen' - 2 freq fern - 4 freq farm - 28 freq froin - 1 freq ferryin - 2 freq fyrein - 1 freq fearin - 4 freq 'frien - 1 freq forum - 33 freq froma - 1 freq fran - 1 freq furm - 20 freq 'freen - 1 freq frien' - 1 freq faerin - 1 freq fairm' - 1 freq frown - 5 freq feerin - 1 freq freen' - 2 freq forrin - 6 freq forenön - 1 freq 'from' - 1 freq 'frim - 1 freq foarm - 66 freq fore-en - 2 freq forehan - 4 freq far-han - 2 freq fremm - 5 freq fur'm - 1 freq fermi - 5 freq furrowin - 1 freq fram - 1 freq freehaun - 1 freq forhooiein - 2 freq fairnie - 30 freq fourmi - 1 freq fire-new - 1 freq furran - 1 freq feirm - 4 freq frem - 2 freq furein - 1 freq furin - 1 freq fore-a-haun - 1 freq franny - 3 freq furrum - 1 freq frim - 1 freq €˜from - 1 freq fuar'n - 2 freq fernie - 1 freq firinÂ’ - 1 freq foran - 1 freq ferim - 1 freq for nou - 1 freq |
MetaPhone code - FRN freen - 218 freq freein - 3 freq frien - 61 freq forran - 1 freq frein - 36 freq froun - 5 freq furrin - 7 freq firin - 29 freq froon - 8 freq farin - 10 freq fairin - 13 freq 'freen' - 2 freq fern - 4 freq foreign - 67 freq froin - 1 freq fyrein - 1 freq fearin - 4 freq 'frien - 1 freq fran - 1 freq 'freen - 1 freq frien' - 1 freq faerin - 1 freq frown - 5 freq feerin - 1 freq freen' - 2 freq forrin - 6 freq fore-en - 2 freq 'foreign' - 1 freq fairnie - 30 freq furreign - 6 freq fire-new - 1 freq furran - 1 freq furein - 1 freq furin - 1 freq franny - 3 freq €žforeign - 1 freq veerin - 1 freq fuar'n - 2 freq fernie - 1 freq firinÂ’ - 1 freq foran - 1 freq voorn - 1 freq for nou - 1 freq |
FAIRIN |
Time to execute Levenshtein function - 0.287698 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.527378 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.030054 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.046821 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.000850 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. |