| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| raxan (0) - 3 freq raxin (1) - 59 freq ra'an (1) - 1 freq ragan (1) - 1 freq ravan (1) - 2 freq raxd (2) - 1 freq bakan (2) - 1 freq acan (2) - 1 freq brahan (2) - 3 freq rainan (2) - 1 freq rannan (2) - 1 freq saxon (2) - 6 freq rashan (2) - 2 freq alan (2) - 148 freq aman (2) - 2 freq rapin (2) - 2 freq rax (2) - 79 freq relaxan (2) - 2 freq raa (2) - 38 freq roaran (2) - 4 freq aran (2) - 5 freq wavan (2) - 9 freq hixan (2) - 1 freq bradan (2) - 1 freq laan (2) - 9 freq |
raxan (0) - 3 freq raxin (1) - 59 freq ragan (2) - 1 freq ravan (2) - 2 freq ra'an (2) - 1 freq coaxan (3) - 3 freq rxau (3) - 1 freq rovan (3) - 1 freq waxin (3) - 4 freq rakin (3) - 27 freq ragin (3) - 65 freq risan (3) - 7 freq regan (3) - 1 freq rasin (3) - 1 freq raxed (3) - 103 freq roman (3) - 76 freq ranin (3) - 1 freq taxin (3) - 8 freq rypan (3) - 1 freq roan (3) - 4 freq rain (3) - 672 freq ran (3) - 448 freq ryaan (3) - 8 freq rarin (3) - 5 freq rearan (3) - 1 freq |
SoundEx code - R250 risin - 136 freq reason - 315 freq rizzon - 8 freq rackin - 8 freq roseanna - 2 freq reachin - 32 freq raisin - 32 freq raikin - 14 freq risen - 17 freq ruggin - 15 freq resume - 6 freq recaain - 1 freq raison - 51 freq ragin - 65 freq reckon - 68 freq riggin - 20 freq russian - 37 freq raxin - 59 freq raeson - 28 freq reekin - 45 freq racin - 43 freq rakin - 27 freq reign - 15 freq rooshian - 1 freq region - 27 freq reikin - 2 freq rockin - 18 freq riskin - 4 freq racin' - 3 freq reekin' - 2 freq ragin' - 3 freq raiken - 1 freq reesen - 3 freq regime - 10 freq regain - 10 freq ruggin' - 1 freq rushin - 16 freq rijn - 1 freq rashan - 2 freq 'rogan - 1 freq raxxin - 13 freq rousin - 5 freq rage-in - 2 freq recon - 1 freq risan - 7 freq ragein - 1 freq rïggin - 1 freq raisin' - 2 freq rushin' - 1 freq rikkin - 3 freq risin' - 1 freq row-chowin - 1 freq rizzin - 1 freq reesin - 1 freq reckin - 5 freq rockeen - 1 freq rochian - 1 freq rasin - 1 freq raxan - 3 freq rescuin - 1 freq rekkin - 2 freq riseen - 2 freq raechan - 1 freq raesan - 1 freq raceen - 1 freq rejoin - 3 freq riggeen - 1 freq raisan - 3 freq requiem - 1 freq resin - 6 freq reasin - 2 freq reachan - 3 freq roussian - 1 freq reukin - 1 freq raign - 3 freq ruisan - 1 freq rauchan - 1 freq ruisin - 2 freq reezin - 1 freq regÃna - 2 freq regan - 1 freq rösin - 1 freq rejyne - 2 freq rauchen - 1 freq racine - 3 freq ragan - 1 freq rasmie - 10 freq rig-on - 1 freq rayson - 1 freq rougin - 1 freq roakin - 1 freq €˜regime - 1 freq roushian - 1 freq regina - 1 freq reakin' - 1 freq rockin' - 1 freq roqccym - 1 freq raecomm - 2 freq reken - 1 freq reckn - 1 freq rai-con - 1 freq roughin - 1 freq rgm - 1 freq rajamie - 1 freq rzm - 1 freq rowson - 2 freq rhhyjuan - 1 freq ryzm - 1 freq rycammy - 13 freq reekan - 1 freq |
MetaPhone code - RKSN raxin - 59 freq raxxin - 13 freq raxan - 3 freq |
RAXAN |
| Time to execute Levenshtein function - 0.171368 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.330131 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.031622 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.037086 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.000845 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. |