| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urdu (0) - 17 freq du (2) - 727 freq grcu (2) - 1 freq urns (2) - 2 freq rgu (2) - 1 freq rds (2) - 1 freq murdo (2) - 18 freq rd (2) - 64 freq urge (2) - 27 freq kdu (2) - 1 freq ards (2) - 14 freq turd (2) - 3 freq 'du (2) - 8 freq bru (2) - 28 freq sru (2) - 1 freq treu (2) - 1 freq trou (2) - 39 freq urny (2) - 4 freq guru (2) - 11 freq urn (2) - 6 freq urrs (2) - 1 freq oru (2) - 1 freq ryu (2) - 1 freq urbs (2) - 1 freq wurd (2) - 191 freq |
urdu (0) - 17 freq erd (2) - 11 freq ard (2) - 4 freq rd (2) - 64 freq yrd (2) - 1 freq ird (2) - 1 freq rhu (3) - 1 freq und (3) - 12 freq ud (3) - 4 freq gurdy (3) - 2 freq url (3) - 1 freq urr (3) - 40 freq hurd (3) - 2 freq utd (3) - 11 freq rad (3) - 3 freq uydo (3) - 1 freq yerd (3) - 7 freq rede (3) - 14 freq edu (3) - 3 freq curd (3) - 5 freq aird (3) - 3 freq uid (3) - 1 freq rdf (3) - 3 freq upd (3) - 1 freq ruid (3) - 13 freq |
SoundEx code - U630 urdu - 17 freq uareyt - 1 freq uraidh - 1 freq urtw - 1 freq |
MetaPhone code - URT urdu - 17 freq uareyt - 1 freq uraidh - 1 freq urtw - 1 freq |
URDU |
| Time to execute Levenshtein function - 0.192553 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.328897 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.026915 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.039659 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.000886 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. |