| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laichest (0) - 2 freq laighest (1) - 1 freq lairgest (2) - 9 freq latches (2) - 2 freq lauches (2) - 1 freq lichtest (2) - 1 freq heichest (2) - 24 freq laichit (2) - 1 freq taiches (2) - 1 freq laicher (2) - 5 freq daiches (2) - 2 freq laichs (2) - 1 freq richest (2) - 7 freq laithes (2) - 1 freq dairkest (3) - 3 freq laached (3) - 22 freq quickest (3) - 9 freq juiciest (3) - 2 freq mairches (3) - 30 freq laziest (3) - 1 freq airches (3) - 12 freq hatchet (3) - 1 freq lichen- (3) - 1 freq lances (3) - 1 freq saicret (3) - 37 freq |
laichest (0) - 2 freq laighest (2) - 1 freq laichit (3) - 1 freq heichest (3) - 24 freq laichs (3) - 1 freq richest (3) - 7 freq lichtest (3) - 1 freq lauches (3) - 1 freq lacht (4) - 1 freq leaches (4) - 3 freq lachs (4) - 3 freq lauchsm (4) - 1 freq lauchs (4) - 21 freq lauchit (4) - 3 freq licht (4) - 886 freq lauch't (4) - 1 freq chest (4) - 97 freq lichtit (4) - 64 freq laucht (4) - 21 freq laichmaist (4) - 1 freq leicht (4) - 2 freq lichtet (4) - 2 freq liicht (4) - 1 freq 'chest (4) - 1 freq laacht (4) - 6 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 - LXST lochside - 10 freq loch-side - 1 freq laichest - 2 freq |
LAICHEST |
| Time to execute Levenshtein function - 0.353147 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.609702 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.033030 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.081631 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.001218 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. |