| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unnerneath (0) - 25 freq underneath (1) - 22 freq underneat (2) - 2 freq undurneath (2) - 1 freq unnernathe (2) - 1 freq underearth (3) - 1 freq unnerwent (3) - 1 freq unnerfelt (3) - 1 freq unnerwear (3) - 1 freq unnerpeyed (4) - 1 freq undervest (4) - 1 freq unnercuts (4) - 1 freq unnerved (4) - 2 freq unherkent (4) - 1 freq unnertak (4) - 4 freq unnerstaan (4) - 15 freq unnerstan' (4) - 1 freq hunneryear (4) - 1 freq unnerfuit (4) - 1 freq internet (4) - 77 freq unnerstans (4) - 2 freq unnerfit (4) - 5 freq unnerstand (4) - 5 freq understate (4) - 1 freq unnerpass (4) - 2 freq |
unnerneath (0) - 25 freq underneath (2) - 22 freq unnernathe (2) - 1 freq undurneath (3) - 1 freq underneat (4) - 2 freq unnerthe (5) - 1 freq underearth (5) - 1 freq unnerwent (5) - 1 freq nineteenth (6) - 13 freq unnerstaun (6) - 207 freq internet (6) - 77 freq unnerstan (6) - 49 freq innerness (6) - 1 freq unnerteuk (6) - 1 freq unnerfuit (6) - 1 freq unnertaen (6) - 3 freq unnerratit (6) - 2 freq internett (6) - 1 freq unnerfit (6) - 5 freq unnercuts (6) - 1 freq unnerwear (6) - 1 freq unnertak (6) - 4 freq unnerfelt (6) - 1 freq unnerstaan (6) - 15 freq noerth (7) - 1 freq |
SoundEx code - U565 unerrinly - 1 freq unnerneath - 25 freq unreined - 1 freq unoorament - 1 freq unarmed - 5 freq unourament - 1 freq unnermine - 3 freq unairmed - 1 freq unromantic - 2 freq unhermed - 4 freq 'unhermed - 1 freq unhairmin - 1 freq unrimed - 1 freq unrantered - 1 freq unrunklin - 1 freq unrounded - 9 freq unroonded - 1 freq unremarkable - 2 freq unrung - 1 freq unnerin - 1 freq unharnessed - 1 freq unnerwent - 1 freq unnermines - 1 freq unremittin - 1 freq unrenewable - 2 freq unnerminin - 1 freq unhairmed - 1 freq unnernathe - 1 freq |
MetaPhone code - UNRN0 unnerneath - 25 freq unnernathe - 1 freq |
UNNERNEATH |
| Time to execute Levenshtein function - 0.201679 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.362929 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.027290 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.036896 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.001098 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. |