Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unreservedly (0) - 1 freq unreserved (2) - 1 freq deservedly (3) - 1 freq reserved (4) - 11 freq unobserved (4) - 1 freq unresolved (4) - 1 freq preserved (4) - 7 freq unnerved (5) - 2 freq unseemly (5) - 2 freq underbelly (5) - 2 freq reserve (5) - 8 freq unsered (5) - 1 freq preserve's (5) - 1 freq unrecorded (5) - 1 freq unfreendly (5) - 1 freq undeservin (5) - 1 freq deservaidly (5) - 1 freq desarivedly (5) - 1 freq deserved (5) - 58 freq preserve (5) - 20 freq unexpectedly (5) - 4 freq reserves (5) - 4 freq undeterred (5) - 7 freq unashamedly (5) - 1 freq repeatedly (5) - 4 freq |
unreservedly (0) - 1 freq unreserved (3) - 1 freq deservedly (5) - 1 freq unresolved (6) - 1 freq preserved (6) - 7 freq unobserved (6) - 1 freq reserved (6) - 11 freq deservaidly (7) - 1 freq desarivedly (7) - 1 freq undeservin (8) - 1 freq preserve (8) - 20 freq unfreendly (8) - 1 freq reserves (8) - 4 freq deserved (8) - 58 freq unashamedly (8) - 1 freq unrecorded (8) - 1 freq unnerved (8) - 2 freq reserve (8) - 8 freq preserve's (8) - 1 freq unsered (8) - 1 freq unfriendly (9) - 1 freq preservit (9) - 2 freq reeseeved (9) - 1 freq unrestrained (9) - 1 freq unravel (9) - 1 freq |
SoundEx code - U562 unnerstaun - 207 freq unnerstaundin - 10 freq unnerstaund - 71 freq unmerkit - 2 freq unnergrund - 6 freq unner-growthe - 1 freq unnerstuid - 30 freq unnerstaunin - 32 freq unnerstaan - 15 freq unnerstaund' - 1 freq unnerstoodna - 1 freq unnerstood - 24 freq unreservedly - 1 freq unner-cloots - 1 freq unnerstaunan - 1 freq unnerstauns - 4 freq unnerstand - 5 freq unnerstuiden - 2 freq unnerx - 1 freq unrichtous - 1 freq unmarked - 1 freq unrest - 6 freq unawares - 5 freq unnerstan - 49 freq unawaurs - 2 freq unnercuts - 1 freq unreachable - 2 freq unresolved - 1 freq unawars - 1 freq unnergroond - 2 freq unrecorded - 1 freq unrestrained - 1 freq unrecognisable - 2 freq unnerestimated - 2 freq unraison - 1 freq unnérstan - 3 freq unnersteed - 3 freq unnerstandin - 3 freq unnercover - 1 freq unnergrun - 3 freq unnerstanably - 1 freq unnerstanin - 2 freq unnèrstan - 14 freq unneérstans - 2 freq unnèrstans - 1 freq unnérstud - 2 freq unnèrstannin - 6 freq unneérstannin - 1 freq unnèrstud - 2 freq umrage - 1 freq unneérstan - 2 freq unnerstan' - 1 freq unnerstannin - 16 freq unmarkt - 1 freq unreason - 1 freq unmarkit - 1 freq unreconstructit - 2 freq unorganised - 1 freq 'unnerstaund - 1 freq unregistered - 1 freq unnerstannan - 1 freq unorcadian - 2 freq unnerstans - 2 freq unnerstud - 3 freq unnirstaan - 1 freq unwrocht - 2 freq unherkent - 1 freq unnercless - 2 freq unwarkit - 1 freq unnerscores - 1 freq unnerstandable - 1 freq unricht - 1 freq unerstan - 1 freq unner-sie - 2 freq unnerstaunnin - 4 freq unnerstaundably - 1 freq unnergroun - 1 freq unnerscore - 1 freq unnergraduate - 1 freq unnerscorin - 1 freq unreserved - 1 freq unreasonably - 1 freq unnèrstaun - 4 freq unnèrstuid - 1 freq unnerside - 1 freq unnnerstaund - 1 freq uimoursome - 1 freq unreasonable - 2 freq un-resigned - 1 freq unnersung - 1 freq unnergane - 1 freq unresponsive - 1 freq un'erstn - 3 freq unerstdin - 1 freq ueneyiircn - 1 freq unnerstauning - 1 freq unerstaun - 1 freq unnerstaundable - 1 freq unrcz - 1 freq unerstood - 1 freq |
MetaPhone code - UNRSRFTL unreservedly - 1 freq |
UNRESERVEDLY |
Time to execute Levenshtein function - 0.203092 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.372575 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.035447 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.043505 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.000900 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. |