| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| locusts (0) - 6 freq locust (1) - 2 freq focuses (2) - 2 freq lotuses (2) - 1 freq locus (2) - 3 freq loused (3) - 5 freq bicuss (3) - 1 freq brusts (3) - 2 freq losses (3) - 15 freq bouts (3) - 2 freq lockups (3) - 1 freq mouses (3) - 1 freq rockets (3) - 9 freq focused (3) - 26 freq lufts (3) - 2 freq lots (3) - 76 freq lasts (3) - 14 freq posts (3) - 45 freq laists (3) - 1 freq ochts (3) - 3 freq sockets (3) - 8 freq cuts (3) - 44 freq lochs (3) - 30 freq lockis (3) - 1 freq loupt (3) - 2 freq |
locusts (0) - 6 freq locust (2) - 2 freq lichts (4) - 178 freq 'costs (4) - 1 freq laists (4) - 1 freq lacoste (4) - 6 freq coasts (4) - 3 freq casts (4) - 17 freq ootcasts (4) - 1 freq costs (4) - 45 freq lists (4) - 19 freq racists (4) - 6 freq lasts (4) - 14 freq lests (4) - 3 freq locus (4) - 3 freq lotuses (4) - 1 freq focuses (4) - 2 freq busts (5) - 2 freq lofts (5) - 1 freq loch's (5) - 1 freq cunts (5) - 193 freq lotus (5) - 8 freq hoasts (5) - 8 freq accuses (5) - 1 freq loasst (5) - 1 freq |
SoundEx code - L223 lochside - 10 freq locusts - 6 freq locust - 2 freq lacoste - 6 freq laziest - 1 freq loch-sides - 1 freq luckiest - 2 freq logistic - 1 freq lcukit - 1 freq laighest - 1 freq loch-side - 1 freq laichest - 2 freq logistical - 1 freq lichchtliein - 1 freq laich-shuts - 1 freq liguistically - 1 freq logistics - 3 freq lokiscottishrap - 15 freq luyzogtp - 1 freq leicester - 2 freq lucozade - 1 freq louisestewartls - 6 freq lsicat - 1 freq lizacatz - 3 freq lukazade - 1 freq |
MetaPhone code - LKSTS locusts - 6 freq |
LOCUSTS |
| Time to execute Levenshtein function - 0.576157 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.923743 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.088849 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.101706 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.000787 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. |