| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bisexuality (0) - 1 freq sexuality (2) - 2 freq inequality (3) - 7 freq biscuity (4) - 1 freq bi-sexual (4) - 1 freq equality (4) - 34 freq homosexuality (4) - 2 freq sexually (4) - 1 freq disparity (5) - 2 freq uisually (5) - 3 freq liminality (5) - 1 freq speciality (5) - 1 freq high-quality (5) - 1 freq civeelity (5) - 1 freq legality (5) - 2 freq equality' (5) - 1 freq insecurity (5) - 2 freq inequalitie (5) - 1 freq illegality (5) - 1 freq casualty (5) - 13 freq hospitality (5) - 13 freq tap-quality (5) - 2 freq banality (5) - 1 freq sexual (5) - 21 freq disabeelity (5) - 1 freq |
bisexuality (0) - 1 freq sexuality (3) - 2 freq homosexuality (6) - 2 freq bi-sexual (6) - 1 freq sexually (6) - 1 freq biscuity (6) - 1 freq inequality (6) - 7 freq banality (7) - 1 freq musicality (7) - 2 freq casualty (7) - 13 freq sexual (7) - 21 freq disabeelity (7) - 1 freq bekalite (7) - 1 freq biscuit (7) - 36 freq disability (7) - 5 freq basalt (7) - 2 freq visibility (7) - 4 freq visability (7) - 2 freq asexual (7) - 2 freq brutality (7) - 4 freq equality (7) - 34 freq iseult (7) - 1 freq brexit (8) - 69 freq basically (8) - 35 freq salty (8) - 11 freq |
SoundEx code - B224 basically - 35 freq bicycle - 8 freq bi-sexual - 1 freq bicycles - 1 freq bisexuality - 1 freq bbchighlands - 1 freq beckyexcell - 1 freq buckiehighlib - 1 freq |
MetaPhone code - BSKSLT bisexuality - 1 freq |
BISEXUALITY |
| Time to execute Levenshtein function - 0.315567 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.491974 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.030293 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.039559 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.000991 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. |