Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unrichtous (0) - 1 freq uprichteous (2) - 1 freq richtous (2) - 1 freq richteous (3) - 5 freq unricht (3) - 1 freq vrichts (4) - 1 freq unxious (4) - 1 freq nichts (4) - 1 freq nichtbour (4) - 2 freq sel-richtous (4) - 1 freq pirithous (4) - 2 freq ubiqitous (4) - 1 freq frichts (4) - 2 freq insichtfu (4) - 1 freq unsichtit (4) - 1 freq insichts (4) - 8 freq richtfu' (4) - 1 freq nichts (4) - 159 freq richts (4) - 195 freq knichts (4) - 9 freq upricht (4) - 22 freq rictus (4) - 2 freq crichton (4) - 14 freq brichtens (4) - 8 freq nichols (4) - 27 freq |
unrichtous (0) - 1 freq richtous (3) - 1 freq uprichteous (3) - 1 freq unricht (4) - 1 freq richteous (4) - 5 freq richts (5) - 195 freq nichts (5) - 159 freq 'richts (5) - 1 freq insichts (5) - 8 freq vrichts (5) - 1 freq frichts (5) - 2 freq wrichts (5) - 1 freq frichtfu (6) - 1 freq richters (6) - 1 freq richtfou (6) - 2 freq richtfu (6) - 15 freq fruchts (6) - 2 freq nochts (6) - 1 freq unsichtly (6) - 1 freq unctuous (6) - 1 freq nicht's (6) - 38 freq nichols (6) - 27 freq richt's (6) - 1 freq righteous (6) - 8 freq upricht (6) - 22 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 - UNRXTS unrichtous - 1 freq |
UNRICHTOUS |
Time to execute Levenshtein function - 0.278771 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.452110 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.028113 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.046006 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.001144 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. |