| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fragile (0) - 15 freq agile (2) - 2 freq ragie (2) - 2 freq frawil (2) - 1 freq facile (2) - 2 freq fraise (2) - 2 freq raggle (2) - 207 freq frail (2) - 18 freq fearie (3) - 2 freq fable (3) - 8 freq rails (3) - 15 freq forgie (3) - 92 freq fissile (3) - 1 freq eagle (3) - 20 freq priggle (3) - 1 freq foggie (3) - 8 freq farage (3) - 10 freq rangle (3) - 2 freq oracle (3) - 5 freq traill (3) - 2 freq fail (3) - 53 freq famine (3) - 15 freq fugie (3) - 4 freq frizzle (3) - 2 freq frame (3) - 61 freq |
fragile (0) - 15 freq frail (3) - 18 freq frawil (3) - 1 freq fregley (3) - 2 freq frugal (3) - 4 freq regale (4) - 2 freq fragility (4) - 2 freq furgive (4) - 4 freq frigate (4) - 1 freq fangle (4) - 1 freq fergie (4) - 121 freq argyle (4) - 5 freq forage (4) - 4 freq fertile (4) - 21 freq frigid (4) - 3 freq draigle (4) - 1 freq frag (4) - 1 freq forgive (4) - 16 freq foogle (4) - 1 freq froggie (4) - 3 freq raggle (4) - 207 freq firgive (4) - 2 freq fergal (4) - 1 freq forgie (4) - 92 freq friable (4) - 2 freq |
SoundEx code - F624 'freshlaid - 1 freq firsled - 1 freq furiously - 6 freq fragile - 15 freq fiercely - 6 freq freckly - 2 freq frecklit - 1 freq frock-like - 1 freq freckled - 5 freq freshly - 8 freq freckles - 17 freq frizzle - 2 freq fair-isle - 1 freq frugal - 4 freq fregley - 2 freq fregley's - 1 freq fragility - 2 freq frazzelt - 1 freq fierce-lukkan - 1 freq faircelins - 1 freq faercly - 1 freq fork-lift - 1 freq friesland - 8 freq fryslan - 1 freq fair-shelled - 1 freq frizzled - 1 freq fierce-like - 1 freq forcie-like - 1 freq frazzled - 1 freq firuswal - 1 freq frizzel - 13 freq frizell - 1 freq fairce-leukin - 1 freq faur-skailed - 1 freq frkzlvmy - 1 freq fergal - 1 freq frxlltgdnh - 1 freq fairisle - 2 freq furseals - 1 freq freegellybhoy - 1 freq fergalmckinney - 1 freq |
MetaPhone code - FRJL fragile - 15 freq virgil - 1 freq |
FRAGILE |
| Time to execute Levenshtein function - 0.194361 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.339852 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.027232 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.036678 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.000837 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. |