| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ferlies (0) - 61 freq ferlied (1) - 1 freq ferries (1) - 5 freq femlies (1) - 2 freq feelies (1) - 1 freq ferlie (1) - 96 freq fergies (1) - 1 freq ferlie's (1) - 3 freq folies (2) - 1 freq merles (2) - 1 freq derbies (2) - 2 freq herries (2) - 4 freq mercies (2) - 3 freq ferriers (2) - 1 freq aerliest (2) - 4 freq fearties (2) - 4 freq fergie (2) - 121 freq erlines (2) - 2 freq ferried (2) - 2 freq keelies (2) - 10 freq merries (2) - 6 freq relies (2) - 1 freq feeties (2) - 5 freq fellie (2) - 1 freq ferrier (2) - 6 freq |
ferlies (0) - 61 freq fergies (2) - 1 freq ferlie's (2) - 3 freq feelies (2) - 1 freq ferlie (2) - 96 freq ferries (2) - 5 freq femlies (2) - 2 freq ferlied (2) - 1 freq flies (3) - 32 freq marlies (3) - 1 freq ferlee (3) - 2 freq femlees (3) - 1 freq fries (3) - 3 freq ferris (3) - 1 freq faeries (3) - 13 freq ferliefu (3) - 3 freq follies (3) - 8 freq ferliein (3) - 3 freq feirlie (3) - 1 freq forliet (3) - 1 freq feres (3) - 52 freq forties (3) - 4 freq foalies (3) - 1 freq purlies (3) - 1 freq forkies (3) - 1 freq |
SoundEx code - F642 ferlies - 61 freq ferlie's - 3 freq foreleg - 1 freq furloughed - 4 freq fearlessly - 2 freq fearless - 9 freq fareweels - 1 freq farls - 5 freq fower-leggit - 2 freq four-leggit - 1 freq frail-lookin - 1 freq frolic - 1 freq fireless - 3 freq firelichtin - 1 freq frillies - 1 freq frills - 1 freq forelegs - 1 freq firelicht - 2 freq fare-ye-weills - 1 freq fareweills - 1 freq farrels - 1 freq four-legged - 1 freq frolicking - 1 freq fairlookingforwardtoit - 1 freq frolicked - 1 freq |
MetaPhone code - FRLS ferlies - 61 freq ferlie's - 3 freq fearless - 9 freq farls - 5 freq fireless - 3 freq frillies - 1 freq frills - 1 freq farrels - 1 freq |
FERLIES |
| Time to execute Levenshtein function - 0.196249 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.336157 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.027791 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.037721 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.000834 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. |