| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ferliein (0) - 3 freq kerriein (2) - 1 freq ferlie't (2) - 1 freq forgiein (2) - 3 freq ferlie (2) - 96 freq fliein (2) - 4 freq ferliefu (2) - 3 freq ferlies (2) - 61 freq ferlied (2) - 1 freq herriein (2) - 1 freq ferlie's (2) - 3 freq folliein (2) - 2 freq ferlielan (2) - 1 freq furlen (3) - 1 freq freitin (3) - 2 freq realizin (3) - 1 freq fellen (3) - 1 freq fraisin (3) - 1 freq furein (3) - 1 freq fergie (3) - 122 freq fermin (3) - 32 freq feein (3) - 4 freq fergie's (3) - 4 freq forgien (3) - 42 freq femlie (3) - 25 freq |
ferliein (0) - 3 freq folliein (3) - 2 freq ferlielan (3) - 1 freq furlen (3) - 1 freq furlin (3) - 15 freq ferlied (3) - 1 freq ferlies (3) - 61 freq forgiein (3) - 3 freq feorlean (3) - 3 freq ferlie (3) - 96 freq fliein (3) - 4 freq ferliefu (3) - 3 freq derlin (4) - 1 freq forgein (4) - 1 freq fyrein (4) - 1 freq berlin (4) - 14 freq feeleen (4) - 3 freq merlin (4) - 6 freq forleit (4) - 13 freq fertin (4) - 1 freq frein (4) - 36 freq follaein (4) - 171 freq fermeen (4) - 1 freq frien (4) - 61 freq fernie (4) - 1 freq |
SoundEx code - F645 forelands - 2 freq fur-lined - 2 freq furlin - 15 freq furlongs - 2 freq furlen - 1 freq freelance - 6 freq fairlan' - 1 freq fairyland - 1 freq farland - 1 freq ferliein - 3 freq faireland - 1 freq feorlean - 3 freq |
MetaPhone code - FRLN furlin - 15 freq furlen - 1 freq fairlan' - 1 freq ferliein - 3 freq verlaine - 2 freq feorlean - 3 freq |
FERLIEIN |
| Time to execute Levenshtein function - 0.239610 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.431052 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.027417 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.037740 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.000918 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. |