| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lallans (0) - 136 freq hallans (1) - 1 freq lallan (1) - 6 freq lawlans (1) - 6 freq 'lallans (1) - 1 freq lallans' (1) - 1 freq lallanses (2) - 1 freq lawlands (2) - 4 freq lellan (2) - 1 freq laggans (2) - 1 freq lowlans (2) - 1 freq willans (2) - 1 freq fallaes (2) - 1 freq callan (2) - 3 freq callant (2) - 21 freq hallan (2) - 1 freq millans (2) - 1 freq gallant (2) - 3 freq €œlallans (2) - 2 freq lapland (2) - 3 freq yalla's (2) - 1 freq lawland (2) - 20 freq ballats (2) - 1 freq ballants (2) - 15 freq albans (2) - 1 freq |
lallans (0) - 136 freq lallans' (2) - 1 freq lawlans (2) - 6 freq 'lallans (2) - 1 freq lallan (2) - 6 freq hallans (2) - 1 freq willans (3) - 1 freq gallons (3) - 14 freq millans (3) - 1 freq lowlans (3) - 1 freq lullan (3) - 1 freq lallanses (3) - 1 freq ullans (3) - 32 freq lellan (3) - 1 freq collins (4) - 3 freq lillian (4) - 1 freq lollies (4) - 2 freq hallions (4) - 51 freq millins (4) - 1 freq gallants (4) - 1 freq mallaes (4) - 1 freq lillias (4) - 1 freq ballant (4) - 11 freq fallan (4) - 4 freq lamland (4) - 1 freq |
SoundEx code - L452 lallans - 136 freq 'lallans' - 3 freq ley-lanns - 1 freq lowlans - 1 freq lee-lang - 4 freq leelang - 3 freq lallans' - 1 freq lawlans - 6 freq 'lallans - 1 freq low-lying - 1 freq lallanses - 1 freq €˜lallans - 4 freq €œlallans - 2 freq lywlnhzckw - 1 freq lulinspector - 1 freq lilyyinnes - 1 freq |
MetaPhone code - LLNS lallans - 136 freq 'lallans' - 3 freq ley-lanns - 1 freq lowlans - 1 freq lallans' - 1 freq lawlans - 6 freq 'lallans - 1 freq €˜lallans - 4 freq €œlallans - 2 freq lilyyinnes - 1 freq |
LALLANS |
| Time to execute Levenshtein function - 0.283682 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.409188 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.033221 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.038380 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.000921 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. |