| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yrviq (0) - 1 freq arvie (2) - 1 freq trvin (2) - 1 freq yvio (2) - 1 freq wyvin (3) - 15 freq yeir (3) - 253 freq rail (3) - 30 freq govit (3) - 1 freq devil (3) - 35 freq iris (3) - 3 freq evil (3) - 90 freq ytri (3) - 2 freq ivvir (3) - 6 freq govin (3) - 9 freq yerkin (3) - 4 freq cravin (3) - 5 freq syria (3) - 12 freq yawin (3) - 1 freq ruik (3) - 1 freq dovin (3) - 2 freq luvit (3) - 1 freq envie (3) - 2 freq ruim (3) - 73 freq vix (3) - 1 freq surviv (3) - 1 freq |
yrviq (0) - 1 freq arvie (3) - 1 freq nvq (4) - 6 freq vq (4) - 6 freq rq (4) - 1 freq rlq (4) - 1 freq sovq (4) - 1 freq ervo (4) - 2 freq rvus (4) - 1 freq ervine (4) - 1 freq vvq (4) - 1 freq ratq (4) - 1 freq rve (4) - 1 freq rv (4) - 2 freq erved (4) - 1 freq xvq (4) - 1 freq iraq (4) - 9 freq ravis (4) - 1 freq rwq (4) - 2 freq rovin (4) - 6 freq rivin (4) - 28 freq ravin (4) - 10 freq riv (4) - 5 freq rivit (4) - 2 freq yrivvi (4) - 1 freq |
SoundEx code - Y612 yearbeuk - 1 freq yerbs - 2 freq yearbuik - 1 freq yerbaws - 1 freq yrwuvgvi - 1 freq yrfyyujirw - 1 freq yyyurhuifc - 1 freq yrviq - 1 freq |
MetaPhone code - RFK rfc - 1 freq yrviq - 1 freq rfk - 1 freq |
YRVIQ |
| Time to execute Levenshtein function - 0.265225 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.402931 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.029700 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.037764 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.000909 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. |