| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| factly (0) - 1 freq sactly (1) - 1 freq faitly (1) - 2 freq faemly (2) - 1 freq facts' (2) - 1 freq lastly (2) - 5 freq saftly (2) - 64 freq farty (2) - 1 freq family (2) - 329 freq facey (2) - 4 freq fact (2) - 485 freq factory (2) - 112 freq fatty (2) - 37 freq faimly (2) - 185 freq fitly (2) - 1 freq fairly (2) - 235 freq fently (2) - 1 freq factery (2) - 1 freq faculty (2) - 1 freq exactly (2) - 321 freq partly (2) - 10 freq laytly (2) - 1 freq famly (2) - 5 freq aptly (2) - 4 freq facts (2) - 46 freq |
factly (0) - 1 freq sactly (2) - 1 freq faitly (2) - 2 freq factual (3) - 9 freq facts (3) - 46 freq fently (3) - 1 freq faintly (3) - 12 freq factery (3) - 1 freq facile (3) - 2 freq factor (3) - 31 freq aaftly (3) - 1 freq fitly (3) - 1 freq facto (3) - 3 freq flatly (3) - 3 freq exactly (3) - 321 freq factory (3) - 112 freq fact (3) - 485 freq acutely (4) - 2 freq facets (4) - 2 freq fleetly (4) - 1 freq fecl (4) - 1 freq feckle (4) - 2 freq fects (4) - 5 freq ftl (4) - 2 freq focal (4) - 2 freq |
SoundEx code - F234 fashed-like - 1 freq fowk-tale - 1 freq fustle - 3 freq fustlin - 2 freq fistlin - 1 freq factually - 1 freq factual - 9 freq fistlins - 1 freq fustled - 1 freq factly - 1 freq ffxtools - 1 freq festool - 2 freq |
MetaPhone code - FKTL fowk-tale - 1 freq factually - 1 freq factual - 9 freq victual - 1 freq factly - 1 freq |
FACTLY |
| Time to execute Levenshtein function - 0.223415 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.379888 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.027930 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.038183 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.000920 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. |