| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lesbian (0) - 11 freq lesb-i-an (2) - 1 freq lerbin (2) - 2 freq hessian (2) - 2 freq serbian (2) - 1 freq lestin (2) - 2 freq €˜lesbian (2) - 1 freq mercian (3) - 4 freq besoin (3) - 1 freq leanan (3) - 4 freq lastin (3) - 9 freq lettin (3) - 91 freq fleshin (3) - 2 freq lee'in (3) - 1 freq eesin (3) - 1 freq weebrian (3) - 1 freq glesgan (3) - 1 freq leadan (3) - 5 freq listin (3) - 4 freq leanin (3) - 49 freq serbia (3) - 4 freq sgian (3) - 2 freq lennin (3) - 2 freq thespian (3) - 1 freq lesmit (3) - 1 freq |
lesbian (0) - 11 freq lisbon (3) - 1 freq lestin (3) - 2 freq lerbin (3) - 2 freq lesbos (4) - 2 freq lashan (4) - 1 freq lesson (4) - 107 freq losan (4) - 2 freq losin (4) - 38 freq husban (4) - 4 freq lashin (4) - 8 freq lisburn (4) - 1 freq loshan (4) - 1 freq lossin (4) - 32 freq lustin (4) - 1 freq lessen (4) - 10 freq libyan (4) - 1 freq lamban (4) - 2 freq lobbin (4) - 4 freq lustan (4) - 1 freq lambin (4) - 19 freq serbian (4) - 1 freq €˜lesbian (4) - 1 freq lastin (4) - 9 freq hessian (4) - 2 freq |
SoundEx code - L215 lggpin-in - 1 freq lesb-i-an - 1 freq lesbian - 11 freq lisbon - 1 freq €˜lesbian - 1 freq lcafmee - 1 freq lwgbmse - 1 freq lugphones - 1 freq lizbain - 1 freq lazybones - 1 freq |
MetaPhone code - LSBN lesb-i-an - 1 freq lesbian - 11 freq lisbon - 1 freq €˜lesbian - 1 freq lizbain - 1 freq |
LESBIAN |
| Time to execute Levenshtein function - 0.208877 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.358705 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.027361 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.039836 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.001019 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. |