| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lunmerhaugh (0) - 1 freq limmerhaugh (2) - 1 freq langenough (5) - 1 freq whitehaugh (5) - 1 freq hunnerfaul (5) - 1 freq wunnerlaun (5) - 4 freq luapmarharg (5) - 1 freq deanbernhaugh (5) - 1 freq unnerdugs (5) - 1 freq penielheugh (5) - 2 freq umberauch (5) - 1 freq underdug (5) - 1 freq plunderbag (5) - 1 freq blairhaugh (5) - 1 freq under-age (5) - 1 freq underearth (5) - 1 freq underage (5) - 1 freq interfaith (6) - 1 freq numeracy (6) - 3 freq underway (6) - 1 freq luve-darg (6) - 1 freq lamplugh (6) - 1 freq undercut (6) - 1 freq 'unnerstaund (6) - 1 freq oniewhaur (6) - 16 freq |
lunmerhaugh (0) - 1 freq limmerhaugh (3) - 1 freq penielheugh (8) - 2 freq blairhaugh (8) - 1 freq luapmarharg (8) - 1 freq deanbernhaugh (8) - 1 freq langenough (8) - 1 freq lamplugh (9) - 1 freq knee-high (9) - 3 freq broomhaugh (9) - 1 freq ulthough (9) - 1 freq launmerks (9) - 1 freq underage (9) - 1 freq larberthigh (9) - 1 freq lingering (9) - 3 freq lanrang (9) - 2 freq underearth (9) - 1 freq unnerdugs (9) - 1 freq lonagh (9) - 1 freq whitehaugh (9) - 1 freq underdug (9) - 1 freq deanburnhaugh (9) - 18 freq under-age (9) - 1 freq plunderbag (9) - 1 freq curragh (10) - 1 freq |
SoundEx code - L562 lanarkshire - 18 freq lawnmowers - 1 freq lanark - 29 freq lunmerhaugh - 1 freq limmerhaugh - 1 freq launmerks - 1 freq limmers - 4 freq lanrick - 1 freq loners - 1 freq limerick - 7 freq limericks - 1 freq lanrik - 2 freq lanrikshire - 2 freq lamarck - 1 freq lanercost - 1 freq liners - 2 freq leonrousseau - 75 freq |
MetaPhone code - LNMRH lunmerhaugh - 1 freq |
LUNMERHAUGH |
| Time to execute Levenshtein function - 0.280200 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.466249 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.029838 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.037449 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.000906 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. |