| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urjent (0) - 1 freq urgent (1) - 16 freq greent (2) - 1 freq orient (2) - 1 freq current (2) - 91 freq furnent (2) - 1 freq unkent (2) - 52 freq burdent (2) - 1 freq unjest (2) - 1 freq rent (2) - 48 freq unjynt (2) - 1 freq furrent (2) - 2 freq uwjenc (2) - 1 freq ardent (2) - 2 freq prent (2) - 42 freq brent (2) - 17 freq preent (2) - 2 freq prsent (2) - 1 freq mament (3) - 14 freq friens (3) - 50 freq irene (3) - 56 freq entent (3) - 1 freq reut (3) - 1 freq haurdent (3) - 1 freq frownt (3) - 1 freq |
urjent (0) - 1 freq urgent (2) - 16 freq ardent (3) - 2 freq rent (3) - 48 freq orient (3) - 1 freq rejynt (3) - 1 freq unjynt (3) - 1 freq jjnt (4) - 1 freq ruint (4) - 7 freq bejant (4) - 4 freq rant (4) - 26 freq yarbent (4) - 2 freq iront (4) - 1 freq junt (4) - 1 freq errant (4) - 2 freq relent (4) - 5 freq runt (4) - 7 freq recent (4) - 72 freq jant (4) - 2 freq repent (4) - 17 freq jint (4) - 6 freq jynt (4) - 45 freq rodent (4) - 4 freq regent (4) - 6 freq rint (4) - 4 freq |
SoundEx code - U625 urgency - 9 freq urchin - 2 freq urgent - 16 freq urgently - 7 freq urchins - 2 freq urjent - 1 freq urging - 1 freq urzum - 1 freq |
MetaPhone code - URJNT urgent - 16 freq urjent - 1 freq |
URJENT |
| Time to execute Levenshtein function - 0.186682 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.372149 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.027921 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.037265 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.000873 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. |