| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| letsspeak (0) - 1 freq bespeak (3) - 1 freq nedspeak (3) - 5 freq weanspeak (3) - 1 freq bespak (4) - 1 freq 'speak (4) - 8 freq letsmake (4) - 1 freq lessens (4) - 1 freq €œspeak (4) - 2 freq lessen (4) - 10 freq speak (4) - 551 freq retrospeck (4) - 3 freq lesser (4) - 29 freq letsmelt (4) - 1 freq respeck (4) - 77 freq respek (4) - 2 freq lea-perk (4) - 2 freq scotspeak (4) - 2 freq €˜speak (4) - 1 freq yessers (5) - 2 freq let-up (5) - 1 freq detested (5) - 1 freq leesed (5) - 1 freq leesure (5) - 4 freq besseen (5) - 1 freq |
letsspeak (0) - 1 freq weanspeak (6) - 1 freq letsmake (6) - 1 freq nedspeak (6) - 5 freq bespeak (6) - 1 freq respek (7) - 2 freq scotspeak (7) - 2 freq €˜speak (7) - 1 freq lassock (7) - 2 freq ill-spak (7) - 2 freq lotuses (7) - 1 freq letsmelt (7) - 1 freq suspek (7) - 2 freq retrospeck (7) - 3 freq lessens (7) - 1 freq 'speak (7) - 8 freq bespak (7) - 1 freq €œspeak (7) - 2 freq lessen (7) - 10 freq lesser (7) - 29 freq speak (7) - 551 freq lue-seek (8) - 1 freq speik (8) - 52 freq lesslie (8) - 1 freq lesson (8) - 107 freq |
SoundEx code - L321 lithosphere - 1 freq leddyship - 2 freq loodspikkers - 2 freq lood-speaker - 1 freq ldship - 1 freq lood-spikker - 1 freq loudspikker - 1 freq letsspeak - 1 freq ltqxpat - 1 freq ldzib - 1 freq ladyship - 1 freq loudspeaker - 1 freq lutwkhfgwr - 1 freq |
MetaPhone code - LTSPK letsspeak - 1 freq |
LETSSPEAK |
| Time to execute Levenshtein function - 0.203866 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.384436 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.032566 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.038490 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.000814 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. |