| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| furlin (0) - 15 freq furin (1) - 1 freq fullin (1) - 29 freq burlin (1) - 8 freq purlin (1) - 1 freq furmin (1) - 1 freq furein (1) - 1 freq furrin (1) - 7 freq surlin (1) - 1 freq fulin (1) - 2 freq curlin (1) - 17 freq furlen (1) - 1 freq hurlin (1) - 20 freq gurlin (1) - 4 freq curling (2) - 3 freq harlin (2) - 3 freq feelin (2) - 482 freq hurklin (2) - 1 freq whurlin (2) - 1 freq dublin (2) - 29 freq fertin (2) - 1 freq fallin (2) - 48 freq fushin (2) - 19 freq ferlie (2) - 96 freq butlin (2) - 2 freq |
furlin (0) - 15 freq furlen (1) - 1 freq curlin (2) - 17 freq fulin (2) - 2 freq fullin (2) - 29 freq gurlin (2) - 4 freq furin (2) - 1 freq surlin (2) - 1 freq hurlin (2) - 20 freq purlin (2) - 1 freq furrin (2) - 7 freq furmin (2) - 1 freq burlin (2) - 8 freq furein (2) - 1 freq furl (3) - 6 freq fermin (3) - 32 freq farin (3) - 10 freq hirlin (3) - 1 freq darlin (3) - 54 freq norlin (3) - 170 freq hurlan (3) - 4 freq fartin (3) - 10 freq frein (3) - 36 freq farmin (3) - 1 freq tirlin (3) - 13 freq |
SoundEx code - F645 forelands - 1 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 |
FURLIN |
| Time to execute Levenshtein function - 0.247057 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.399897 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.031746 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.037732 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.000782 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. |