| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| locusts (0) - 6 freq locust (1) - 2 freq locus (2) - 3 freq focuses (2) - 2 freq lotuses (2) - 1 freq lowest (3) - 10 freq focusit (3) - 1 freq clouts (3) - 8 freq cuits (3) - 2 freq rusts (3) - 1 freq boasts (3) - 3 freq outs (3) - 1 freq forests (3) - 9 freq lousy (3) - 2 freq blouses (3) - 2 freq bouets (3) - 1 freq lust (3) - 20 freq lusty (3) - 5 freq lofts (3) - 1 freq gtcsts (3) - 1 freq pockets (3) - 22 freq louis (3) - 30 freq luyts (3) - 1 freq costs (3) - 46 freq ootcasts (3) - 1 freq |
locusts (0) - 6 freq locust (2) - 2 freq lacoste (4) - 7 freq coasts (4) - 4 freq racists (4) - 6 freq casts (4) - 19 freq 'costs (4) - 1 freq ootcasts (4) - 1 freq costs (4) - 46 freq lists (4) - 18 freq incests (4) - 1 freq laists (4) - 1 freq lasts (4) - 17 freq lotuses (4) - 1 freq lichts (4) - 180 freq focuses (4) - 2 freq locus (4) - 3 freq lests (4) - 3 freq hosts (5) - 13 freq lunts (5) - 1 freq loasses (5) - 5 freq loats (5) - 2 freq lochans (5) - 8 freq lousers (5) - 1 freq crusts (5) - 12 freq |
SoundEx code - L223 lochside - 10 freq locusts - 6 freq locust - 2 freq lacoste - 7 freq laziest - 1 freq loch-sides - 1 freq lochyside - 1 freq lcukit - 2 freq luckiest - 2 freq logistic - 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.469947 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.637821 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.064535 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.080080 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.001267 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. |