| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lauch-lauchin (0) - 1 freq hauf-lauchin (3) - 1 freq hauf-lachin (4) - 1 freq hauf-souchin (5) - 1 freq quick-lachin (5) - 1 freq laich-liggin (5) - 1 freq claichin (6) - 1 freq pleuch-laund (6) - 1 freq fauchlin (6) - 1 freq pauchlin (6) - 17 freq wauchlin (6) - 1 freq caur-racin (6) - 1 freq lang-lastin (6) - 1 freq schauchlin (6) - 1 freq sauchiehauch (6) - 1 freq clauchan (6) - 1 freq bauchlin (6) - 1 freq squallachin (6) - 2 freq hauchue-pauchtie (6) - 1 freq haud-gauin (6) - 2 freq lachlan (6) - 1 freq lauchan (6) - 2 freq laich-in (6) - 1 freq laachin (6) - 27 freq launchin (6) - 4 freq |
lauch-lauchin (0) - 1 freq hauf-lauchin (6) - 1 freq laich-liggin (7) - 1 freq quick-lachin (7) - 1 freq hauf-lachin (7) - 1 freq laich-in (9) - 1 freq lachlan (9) - 1 freq laich-doun (9) - 1 freq claichin (9) - 1 freq hauchue-pauchtie (9) - 1 freq clauchan (9) - 1 freq hauf-souchin (9) - 1 freq much-lauded (10) - 1 freq clatchin (10) - 1 freq mauchlin (10) - 13 freq lauchin (10) - 99 freq clauchtin (10) - 5 freq heech-kickin (10) - 1 freq clachan (10) - 101 freq lauchabil (10) - 2 freq scrauchin (10) - 2 freq mauchhin (10) - 1 freq south-facin (10) - 1 freq clauchit (10) - 1 freq lamp-licht (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 - LXLXN lauch-lauchin - 1 freq |
LAUCH-LAUCHIN |
| Time to execute Levenshtein function - 0.227219 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.421362 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.032261 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.045489 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.001056 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. |