| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| frailty (0) - 1 freq fraility (1) - 1 freq failt (2) - 7 freq frilly (2) - 8 freq trailt (2) - 7 freq fahlty (2) - 1 freq frail (2) - 18 freq draiglty (2) - 1 freq fruity (2) - 4 freq railt (2) - 1 freq faulty (2) - 2 freq railly (2) - 1 freq fealty (2) - 4 freq failte (2) - 2 freq fragility (2) - 2 freq ailt (3) - 3 freq fronty (3) - 6 freq draint (3) - 5 freq filt (3) - 8 freq railed (3) - 2 freq frast (3) - 1 freq grail (3) - 4 freq drily (3) - 1 freq flailed (3) - 2 freq frainch (3) - 8 freq |
frailty (0) - 1 freq fraility (1) - 1 freq faulty (3) - 2 freq fealty (3) - 4 freq fragility (3) - 2 freq railt (3) - 1 freq failte (3) - 2 freq fruity (3) - 4 freq frilly (3) - 8 freq failt (3) - 7 freq trailt (3) - 7 freq fahlty (3) - 1 freq frail (3) - 18 freq frint (4) - 1 freq foarty (4) - 1 freq faalt (4) - 4 freq faculty (4) - 1 freq futility (4) - 3 freq farty (4) - 1 freq cruelty (4) - 14 freq flait (4) - 1 freq furlt (4) - 1 freq fairley (4) - 1 freq realty (4) - 1 freq facility (4) - 9 freq |
SoundEx code - F643 forleit - 13 freq forleitit - 7 freq firlot - 2 freq fower-letter - 1 freq firlots - 2 freq furl't - 1 freq furrult - 1 freq fraility - 1 freq frailty - 1 freq furled - 11 freq frailties - 1 freq ferlied - 1 freq fowr-lettered - 1 freq freehauld - 1 freq furlt - 1 freq ferlie't - 1 freq forleetit - 1 freq frehaldair - 1 freq forlaithie - 1 freq forewaelit - 1 freq frehaldris - 1 freq frehalder - 1 freq frehalders - 2 freq forliet - 1 freq forleitin - 2 freq |
MetaPhone code - FRLT forleit - 13 freq firlot - 2 freq furl't - 1 freq furrult - 1 freq fraility - 1 freq frailty - 1 freq furled - 11 freq ferlied - 1 freq furlt - 1 freq ferlie't - 1 freq forliet - 1 freq virrelt - 1 freq |
FRAILTY |
| Time to execute Levenshtein function - 0.270305 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.515159 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.068073 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.041774 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.000984 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. |