| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foyleflyer (0) - 1 freq follyen (4) - 2 freq follyers (4) - 1 freq follaer (4) - 10 freq fameelyer (4) - 1 freq folleyed (4) - 2 freq forgether (5) - 3 freq fyfer (5) - 1 freq fore'er (5) - 1 freq follaes (5) - 58 freq fooever (5) - 1 freq goller (5) - 7 freq follyin (5) - 4 freq foxley (5) - 2 freq fleeter (5) - 1 freq solemly (5) - 2 freq follys (5) - 1 freq follien (5) - 1 freq foveoles (5) - 1 freq meyfloer (5) - 1 freq folloers (5) - 1 freq forefinger (5) - 8 freq foallie (5) - 5 freq fullyery (5) - 1 freq poller (5) - 1 freq |
foyleflyer (0) - 1 freq follaer (5) - 10 freq filler (6) - 2 freq fuller (6) - 3 freq fullyery (6) - 1 freq feller (6) - 1 freq flaffer (6) - 3 freq fluffer (6) - 3 freq fameelyer (6) - 1 freq folleyed (6) - 2 freq follyers (6) - 1 freq follyen (6) - 2 freq fellar (7) - 1 freq follaet (7) - 6 freq firefly (7) - 1 freq follaed (7) - 159 freq golfer (7) - 1 freq holler (7) - 2 freq fleer (7) - 124 freq voller (7) - 2 freq efler (7) - 1 freq fireflies (7) - 1 freq yellaer (7) - 1 freq foallied (7) - 1 freq filever (7) - 1 freq |
SoundEx code - F414 fulfilled - 3 freq fulfil - 6 freq flip-floppin - 1 freq fulfilit - 1 freq feelfeel - 1 freq flip-flops - 3 freq full-blown - 2 freq fülfill - 1 freq filfill - 1 freq fullfill - 3 freq fullfilled - 1 freq fulfillin - 4 freq fuul-bladderdly - 1 freq full-blawn - 1 freq fluffy-luggit - 2 freq full-bluidit - 2 freq fulfilment - 1 freq fulfillment - 1 freq foyleflyer - 1 freq fluffballs - 1 freq |
MetaPhone code - FLFLYR foyleflyer - 1 freq |
FOYLEFLYER |
| Time to execute Levenshtein function - 0.243672 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.482408 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.038399 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.081270 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.001108 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. |