| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fascists (0) - 4 freq fascist (1) - 4 freq fascism (2) - 4 freq assists (2) - 1 freq racists (2) - 6 freq fists (3) - 21 freq bastirts (3) - 1 freq florists (3) - 1 freq facts (3) - 45 freq fashit (3) - 3 freq facials (3) - 2 freq laists (3) - 1 freq waists (3) - 3 freq faiss (3) - 7 freq faist (3) - 29 freq fashions (3) - 3 freq fantises (3) - 1 freq fancit (3) - 1 freq facets (3) - 2 freq oasis's (3) - 1 freq fadista (3) - 1 freq fashious (3) - 20 freq baists (3) - 22 freq fashiuss (3) - 1 freq insists (3) - 5 freq |
fascists (0) - 4 freq fascist (2) - 4 freq assists (4) - 1 freq racists (4) - 6 freq fascism (4) - 4 freq insists (5) - 5 freq fashiuss (5) - 1 freq fanciest (5) - 2 freq forecasts (5) - 4 freq fastest (5) - 13 freq fasces (5) - 1 freq facets (5) - 2 freq fists (5) - 21 freq florists (5) - 1 freq facts (5) - 45 freq focuses (6) - 2 freq asbestos (6) - 9 freq foosts (6) - 2 freq locusts (6) - 6 freq assets (6) - 14 freq faistest (6) - 1 freq scotts (6) - 11 freq fassons (6) - 1 freq scairts (6) - 1 freq forscots (6) - 1 freq |
SoundEx code - F223 foggiest - 8 freq fykiest - 2 freq focused - 26 freq fokest - 1 freq focussit - 1 freq feughside - 1 freq fish-guts - 1 freq focusit - 1 freq focussed - 8 freq fascist - 4 freq fascists - 4 freq fuyksgysid - 1 freq fwaxysdjvy - 1 freq fxcxczgekd - 1 freq |
MetaPhone code - FSSTS fascists - 4 freq |
FASCISTS |
| Time to execute Levenshtein function - 0.197806 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.354057 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.029538 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.037561 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.000841 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. |