Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fushionless (0) - 17 freq fushionles (1) - 1 freq fusionless (1) - 1 freq föshionless (2) - 1 freq fooshionless (2) - 1 freq föshinless (3) - 1 freq fushmongers (3) - 1 freq fooshlonless (3) - 1 freq fooshinless (3) - 1 freq frienless (4) - 1 freq fushmonger (4) - 1 freq fashions (4) - 3 freq pushionous (4) - 1 freq muinless (4) - 4 freq shitless (4) - 1 freq fashioned (4) - 18 freq fusomeness (4) - 1 freq shoeless (4) - 1 freq motionless (4) - 4 freq furgivness (4) - 1 freq pushion-gas (4) - 1 freq fathomless (4) - 1 freq soonless (4) - 2 freq fooshunless (4) - 1 freq fushion (4) - 30 freq |
fushionless (0) - 17 freq fooshionless (2) - 1 freq fusionless (2) - 1 freq fushionles (2) - 1 freq fooshinless (3) - 1 freq fooshlonless (4) - 1 freq föshionless (4) - 1 freq fooshunless (4) - 1 freq föshinless (5) - 1 freq fathomless (6) - 1 freq soonless (6) - 2 freq fouthiness (6) - 1 freq fusomeness (6) - 1 freq fauchieness (6) - 1 freq shoeless (6) - 1 freq frienless (6) - 1 freq fashions (6) - 3 freq fushmongers (6) - 1 freq shitless (6) - 1 freq sunless (7) - 1 freq tashless (7) - 3 freq faithless (7) - 5 freq haanless (7) - 1 freq fashiuss (7) - 1 freq fashionistas (7) - 1 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 - FXNLS fushionless - 17 freq föshionless - 1 freq føshinlis - 1 freq fusionless - 1 freq fooshunless - 1 freq fooshionless - 1 freq fushionles - 1 freq fooshinless - 1 freq föshinless - 1 freq |
FUSHIONLESS |
Time to execute Levenshtein function - 0.202958 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.417446 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.027622 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.072066 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.000896 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. |