| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fortuitously (0) - 1 freq fortuitous (2) - 2 freq portentously (3) - 1 freq ferociously (4) - 2 freq ruinously (4) - 1 freq voraciously (4) - 1 freq furiously (4) - 6 freq fruitful (5) - 2 freq foretoul (5) - 3 freq consiously (5) - 1 freq studiously (5) - 2 freq consciously (5) - 3 freq ominously (5) - 2 freq variously (5) - 2 freq fortunately (5) - 10 freq seriously (5) - 72 freq cautiously (5) - 13 freq egregiously (5) - 1 freq courteously (5) - 1 freq perilously (5) - 1 freq obviously (5) - 110 freq foriornly (5) - 1 freq continuously (5) - 1 freq previously (5) - 3 freq 'obviously (5) - 1 freq |
fortuitously (0) - 1 freq fortuitous (3) - 2 freq portentously (5) - 1 freq furiously (6) - 6 freq ferociously (6) - 2 freq fortunately (7) - 10 freq foretoul (7) - 3 freq courteously (7) - 1 freq fortitude (7) - 3 freq voraciously (7) - 1 freq fruitful (7) - 2 freq ruinously (7) - 1 freq curiously (8) - 6 freq forties (8) - 5 freq graciously (8) - 5 freq portysoul (8) - 5 freq fortunes (8) - 7 freq fortrose (8) - 2 freq forritsum (8) - 3 freq pretentiously (8) - 1 freq forfeits (8) - 2 freq forgetful (8) - 2 freq fruits (8) - 18 freq torturous (8) - 2 freq forrits (8) - 17 freq |
SoundEx code - F633 forty-two - 4 freq forty-twae - 2 freq feartit - 1 freq frithat - 7 freq fortuitous - 2 freq 'forty-three' - 1 freq fortitude - 3 freq frettit - 1 freq frothed - 4 freq fowertie-thrie - 1 freq fowertie-twa - 1 freq farted - 3 freq fowerty-twa - 1 freq fartet - 2 freq fortiet - 2 freq furthettins - 1 freq fair-heidit - 2 freq fairdit - 1 freq fower-toed - 1 freq fretted - 1 freq forty-odd - 1 freq forty-twa - 2 freq fortieth - 1 freq fortuitously - 1 freq forty-three - 1 freq |
MetaPhone code - FRTTSL fortuitously - 1 freq |
FORTUITOUSLY |
| Time to execute Levenshtein function - 0.235996 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.412925 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.028311 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.037919 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.000969 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. |