| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lallans (0) - 129 freq lallan (1) - 6 freq hallans (1) - 1 freq lallans' (1) - 1 freq lawlans (1) - 6 freq 'lallans (1) - 1 freq alans (2) - 2 freq lamland (2) - 1 freq balkans (2) - 4 freq fallan (2) - 4 freq lellan (2) - 1 freq lowlans (2) - 1 freq lullan (2) - 1 freq pallas (2) - 2 freq ballats (2) - 1 freq lawland (2) - 20 freq lawlands (2) - 3 freq €œlallans (2) - 2 freq dallas (2) - 1 freq 'lallans' (2) - 3 freq ballants (2) - 15 freq €˜lallans (2) - 4 freq mallaes (2) - 1 freq allan (2) - 91 freq allays (2) - 1 freq |
lallans (0) - 129 freq lawlans (2) - 6 freq lallans' (2) - 1 freq 'lallans (2) - 1 freq hallans (2) - 1 freq lallan (2) - 6 freq millans (3) - 1 freq lallanses (3) - 1 freq ullans (3) - 32 freq lullan (3) - 1 freq willans (3) - 1 freq gallons (3) - 13 freq lellan (3) - 1 freq lowlans (3) - 1 freq collins (4) - 3 freq lillian (4) - 1 freq balloons (4) - 16 freq galileans (4) - 3 freq killins (4) - 1 freq lulls (4) - 1 freq balkans (4) - 4 freq lapland (4) - 3 freq gallas (4) - 1 freq callants (4) - 7 freq alans (4) - 2 freq |
SoundEx code - L452 lallans - 129 freq 'lallans' - 3 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 - 129 freq 'lallans' - 3 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.188165 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.351688 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.027158 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.049903 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.001105 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. |