| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twa-hunner (0) - 1 freq twa-hauner (2) - 1 freq ewanhunter (3) - 1 freq ahunner (3) - 1 freq yearhunner (3) - 8 freq thunner (3) - 74 freq thunners (4) - 3 freq twa-tumes (4) - 1 freq a-dunder (4) - 1 freq tanner (4) - 10 freq anunner (4) - 1 freq thunnert (4) - 2 freq thunnery (4) - 1 freq twa-fower (4) - 1 freq twa-haundit (4) - 3 freq five-hunner (4) - 1 freq waunners (4) - 2 freq year-hunder (4) - 2 freq asunner (4) - 1 freq waunnert (4) - 6 freq roadrunner (4) - 9 freq threehunner (4) - 1 freq twa-handit (4) - 1 freq 'hunner (4) - 2 freq shunner (4) - 2 freq |
twa-hunner (0) - 1 freq twa-hauner (3) - 1 freq thunner (5) - 74 freq five-hunner (6) - 1 freq twa-haundit (6) - 3 freq thinner (6) - 14 freq twa-handit (6) - 1 freq threehunner (6) - 1 freq thunnery (6) - 1 freq thonner (6) - 45 freq yearhunner (6) - 8 freq ahunner (6) - 1 freq ewanhunter (6) - 1 freq whinner (6) - 1 freq twa-horse (7) - 1 freq thunder (7) - 37 freq non-runner (7) - 1 freq twa-pun (7) - 1 freq hunner (7) - 442 freq shunner (7) - 2 freq wunner (7) - 282 freq twae-haundid (7) - 1 freq two-penny (7) - 1 freq wanner (7) - 18 freq tammhunter (7) - 1 freq |
SoundEx code - T560 thunner - 74 freq thinner - 14 freq the-morra - 2 freq tanner - 10 freq tomorrow - 41 freq timmer - 80 freq tenure - 4 freq tumour - 6 freq themorra - 24 freq tenner - 25 freq thonner - 45 freq 'thonner - 1 freq thonner' - 1 freq toner - 1 freq timer - 6 freq tamar - 2 freq ten'er - 1 freq 'tamara - 1 freq tamara - 16 freq tamer - 2 freq themarra - 1 freq thoner - 2 freq tenor - 4 freq tuner - 1 freq tomorrow' - 1 freq twa-hunner - 1 freq tonner - 1 freq thoumire - 2 freq thunnery - 1 freq to-morrow - 1 freq €˜thonner - 1 freq tinner - 1 freq €œtomorrow - 1 freq tenior - 1 freq tommorrow - 1 freq twa-hauner - 1 freq tamhere - 1 freq timor - 1 freq |
MetaPhone code - TWHNR twa-hunner - 1 freq twa-hauner - 1 freq |
TWA-HUNNER |
| Time to execute Levenshtein function - 0.218000 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.374155 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.032462 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.037125 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.000840 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. |