| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yirp (0) - 1 freq yip (1) - 3 freq yird (1) - 206 freq yir (1) - 1409 freq yirs (1) - 4 freq yirn (1) - 3 freq irp (1) - 2 freq wirh (2) - 1 freq irk (2) - 2 freq giro (2) - 12 freq wisp (2) - 7 freq hir (2) - 1279 freq yasp (2) - 1 freq ying (2) - 46 freq eire (2) - 3 freq diep (2) - 3 freq tipp (2) - 1 freq birl (2) - 93 freq aire (2) - 61 freq wiry (2) - 11 freq zip (2) - 10 freq birt (2) - 1 freq efrp (2) - 1 freq airy (2) - 4 freq yirþ (2) - 1 freq |
yirp (0) - 1 freq irp (1) - 2 freq rip (2) - 57 freq irip (2) - 1 freq arp (2) - 1 freq rp (2) - 8 freq yirn (2) - 3 freq yir (2) - 1409 freq yird (2) - 206 freq yirs (2) - 4 freq yip (2) - 3 freq airs (3) - 38 freq yirdy (3) - 6 freq yry (3) - 1 freq yr (3) - 16 freq ir' (3) - 4 freq nip (3) - 119 freq corp (3) - 51 freq tarp (3) - 1 freq warp (3) - 9 freq aip (3) - 10 freq airk (3) - 3 freq yarl (3) - 18 freq yup (3) - 5 freq ip (3) - 15 freq |
SoundEx code - Y610 yerb - 1 freq yirp - 1 freq yrivvi - 1 freq yoruba - 1 freq yyrof - 1 freq |
MetaPhone code - YRP yirp - 1 freq |
YIRP |
| Time to execute Levenshtein function - 0.215384 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.408758 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.028855 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.037733 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.000841 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. |