| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laich-liggin (0) - 1 freq law-liggin (3) - 1 freq lang-liggit (4) - 1 freq laich-in (4) - 1 freq hie-liggit (5) - 1 freq out-liggin (5) - 1 freq gainbiggin (5) - 1 freq lauch-lauchin (5) - 1 freq laich-doun (5) - 1 freq tail-waggin (5) - 1 freq air-biggit (5) - 1 freq search-ingin (5) - 1 freq hairt-liftin (5) - 1 freq nip-luggin (5) - 1 freq laigh-in (5) - 1 freq hairt-likin (5) - 1 freq ear-wiggin (5) - 1 freq pairt-singin (5) - 1 freq lang-luggit (5) - 3 freq grave-diggin (6) - 1 freq tail-light (6) - 1 freq lichchtliein (6) - 1 freq hauf-biggit (6) - 2 freq pauchlin (6) - 17 freq chaingin (6) - 9 freq |
laich-liggin (0) - 1 freq law-liggin (5) - 1 freq lauch-lauchin (7) - 1 freq laich-in (7) - 1 freq lang-liggit (7) - 1 freq laich-doun (8) - 1 freq nip-luggin (8) - 1 freq lang-luggit (8) - 3 freq hie-liggit (8) - 1 freq out-liggin (8) - 1 freq ear-wiggin (9) - 1 freq lang-legged (9) - 1 freq loch-lilies (9) - 1 freq lang-lugged (9) - 2 freq laigh-in (9) - 1 freq chuggin (9) - 4 freq search-ingin (9) - 1 freq cloggin (9) - 2 freq lachlan (9) - 1 freq tail-waggin (9) - 1 freq ash-light (10) - 1 freq laich-shuts (10) - 1 freq wauchlin (10) - 1 freq water-loggit (10) - 1 freq lauching (10) - 1 freq |
SoundEx code - L242 locals - 39 freq locals' - 1 freq lochalsh - 1 freq laich-liggin - 1 freq lookalike - 2 freq localised - 8 freq localism - 1 freq lookalikie - 1 freq look-alikes - 1 freq lugholes - 1 freq legless - 3 freq locails - 2 freq luckless - 2 freq lauch-lauchin - 1 freq less-weil-kent - 1 freq lassie-like - 1 freq lowe-clok - 1 freq localspace - 1 freq localisation - 4 freq luik-alike - 1 freq lokals - 1 freq lzals - 1 freq lclq - 1 freq lqlg - 1 freq leakylike - 1 freq ljeeulgf - 1 freq |
MetaPhone code - LXLKN laich-liggin - 1 freq latchie-like-an - 1 freq |
LAICH-LIGGIN |
| Time to execute Levenshtein function - 0.224800 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.391232 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.028240 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.036881 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.000878 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. |