| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banalities (0) - 1 freq banties (3) - 1 freq realities (3) - 9 freq penalties (3) - 11 freq legalities (3) - 1 freq banality (3) - 1 freq barbarities (3) - 1 freq qualities (3) - 9 freq abilities (3) - 6 freq vanities (3) - 1 freq facilities (3) - 22 freq nasties (4) - 1 freq laalies (4) - 3 freq quantities (4) - 3 freq pairities (4) - 1 freq minorities (4) - 17 freq maalies (4) - 6 freq naitves (4) - 1 freq beauties (4) - 9 freq abeilities (4) - 2 freq casuities (4) - 1 freq bailies (4) - 2 freq boaties (4) - 18 freq bantie (4) - 3 freq paralytics (4) - 1 freq |
banalities (0) - 1 freq banality (4) - 1 freq penalties (4) - 11 freq abilities (4) - 6 freq banties (4) - 1 freq legalities (5) - 1 freq bandits (5) - 5 freq vanities (5) - 1 freq facilities (5) - 22 freq abeilities (5) - 2 freq qualities (5) - 9 freq realities (5) - 9 freq fankelites (6) - 4 freq amenities (6) - 4 freq faceelities (6) - 3 freq bananaes (6) - 1 freq baesties (6) - 1 freq densities (6) - 1 freq bonailie (6) - 1 freq nobilities (6) - 1 freq casualties (6) - 5 freq shelities (6) - 1 freq bandmates (6) - 1 freq nationalities (6) - 5 freq abilitie (6) - 1 freq |
SoundEx code - B543 bin-lid - 1 freq binlid - 1 freq banality - 1 freq bummeled - 1 freq bummilt - 1 freq banalities - 1 freq bummelt - 1 freq |
MetaPhone code - BNLTS banalities - 1 freq |
BANALITIES |
| Time to execute Levenshtein function - 0.207286 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.420729 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.032682 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.038620 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.001011 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. |