| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| facsimile (0) - 2 freq faimily (3) - 189 freq faimiles (3) - 2 freq faimilie (3) - 21 freq facile (3) - 2 freq faisible (3) - 3 freq simile (3) - 3 freq factorie (4) - 2 freq simple (4) - 205 freq 'simple (4) - 2 freq facetiming (4) - 1 freq faceline (4) - 2 freq lassikie (4) - 2 freq family (4) - 329 freq facial (4) - 18 freq half-mile (4) - 1 freq smile (4) - 458 freq fasil (4) - 1 freq kamile (4) - 37 freq fairie (4) - 4 freq facials (4) - 2 freq feasible (4) - 2 freq incivile (4) - 1 freq ansible (4) - 2 freq faside (4) - 1 freq |
facsimile (0) - 2 freq simile (5) - 3 freq faisible (5) - 3 freq facile (5) - 2 freq faimily (5) - 189 freq faimilie (5) - 21 freq 'smile (6) - 1 freq feasible (6) - 2 freq fismal (6) - 1 freq familie (6) - 1 freq fusomely (6) - 1 freq five-mile (6) - 1 freq fasil (6) - 1 freq fammil (6) - 1 freq macsnail (6) - 4 freq faimilay (6) - 1 freq faimlie (6) - 140 freq smile (6) - 458 freq fausslie (6) - 1 freq fairisle (6) - 2 freq faimiles (6) - 2 freq fissile (6) - 1 freq faimly (6) - 185 freq facial (6) - 18 freq camomile (6) - 7 freq |
SoundEx code - F254 fushionless - 17 freq fismal - 1 freq facsimile - 2 freq föshionless - 1 freq føshinlis - 1 freq fusionless - 1 freq fooshunless - 1 freq fooshionless - 1 freq fooshunless-kinna - 1 freq fushionles - 1 freq fykemaleeries - 1 freq fooshinless - 1 freq fusomely - 1 freq fuckinell - 1 freq föshinless - 1 freq |
MetaPhone code - FKSML facsimile - 2 freq |
FACSIMILE |
| Time to execute Levenshtein function - 0.316389 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.527986 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.028959 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.038787 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.000917 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. |