| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| regairds (0) - 15 freq rewairds (1) - 1 freq regaird (1) - 39 freq regards (1) - 11 freq regard (2) - 16 freq regairdit (2) - 33 freq gairds (2) - 16 freq rewards (2) - 6 freq regairdin (2) - 7 freq regairded (2) - 1 freq repairs (2) - 6 freq recaird (2) - 1 freq rewaird (2) - 8 freq recairts (2) - 2 freq reagaird (2) - 1 freq retards (2) - 1 freq eairds (2) - 2 freq remairks (2) - 3 freq retails (3) - 1 freq rewaard (3) - 2 freq regaled (3) - 2 freq rendirs (3) - 2 freq rears (3) - 2 freq resairch (3) - 12 freq bairds (3) - 3 freq |
regairds (0) - 15 freq regards (1) - 11 freq regaird (2) - 39 freq rewairds (2) - 1 freq reagaird (3) - 1 freq retards (3) - 1 freq regairded (3) - 1 freq regairdin (3) - 7 freq regairdit (3) - 33 freq gairds (3) - 16 freq regard (3) - 16 freq rewards (3) - 6 freq guairds (4) - 21 freq records (4) - 34 freq regardit (4) - 1 freq girds (4) - 5 freq regarded (4) - 5 freq regardin (4) - 2 freq recoards (4) - 1 freq recaird (4) - 1 freq rewaird (4) - 8 freq eairds (4) - 2 freq remairks (4) - 3 freq repairs (4) - 6 freq recairts (4) - 2 freq |
SoundEx code - R263 recorder - 8 freq recordins - 11 freq resoart - 1 freq regrets - 12 freq records - 34 freq regret - 50 freq recordin - 21 freq regaird - 39 freq regairdit - 33 freq required - 28 freq record - 99 freq recordit - 27 freq re-creaatit - 1 freq ricardo - 6 freq requirit - 1 freq richard - 71 freq regardless - 24 freq resorted - 3 freq reguerdon - 1 freq regairdless - 12 freq regrettin - 7 freq regard - 16 freq regardin - 2 freq regretted - 4 freq recorded - 15 freq richard's - 2 freq recordeen - 1 freq re-creatin - 1 freq richert - 2 freq regarding - 5 freq reassured - 9 freq recording - 8 freq recordings - 3 freq rose-rid - 1 freq recruits - 6 freq regards - 11 freq rogart - 1 freq resortin - 3 freq recairts - 2 freq regrettit - 3 freq regairds - 15 freq regrettable - 1 freq regairdin - 7 freq resort - 8 freq regretfully - 1 freq record' - 1 freq records' - 1 freq recruitit - 3 freq recreative - 1 freq recreate - 1 freq recaird - 1 freq regretin - 1 freq recowert - 1 freq recreatit - 1 freq requered - 1 freq racords - 4 freq regrettible - 1 freq recruitment - 8 freq recruit - 2 freq recordin' - 1 freq recruitin' - 2 freq reek-raddled - 1 freq recreational - 7 freq recorders - 2 freq rizzert - 1 freq reco'ered - 1 freq recoardeens - 1 freq requerit - 1 freq regarded - 5 freq riksråd - 1 freq regairded - 1 freq regardit - 1 freq ragwort - 1 freq rosehearty - 4 freq razored - 1 freq requeired - 1 freq regrate - 1 freq regrait - 1 freq racord - 2 freq racordins - 1 freq recruitin - 1 freq requirt - 1 freq recoards - 1 freq recruited - 2 freq recreation - 5 freq recreatifinally - 1 freq reassuret - 2 freq raicord - 1 freq reassurit - 1 freq rekordid - 1 freq recordan - 1 freq richardosman - 1 freq richardhammond - 1 freq recruiting - 1 freq richardtuck - 1 freq richardjobson - 1 freq reeksarito - 1 freq richardwilkinsz - 1 freq regerdless - 1 freq richardlochhead - 1 freq recordj - 1 freq recordstoliveby - 1 freq rayshard - 1 freq richardsalphd - 1 freq regretting - 1 freq richardmcinto - 1 freq richardlylesnp - 1 freq reagaird - 1 freq |
MetaPhone code - RKRTS regrets - 12 freq records - 34 freq recruits - 6 freq regards - 11 freq recairts - 2 freq regairds - 15 freq records' - 1 freq racords - 4 freq recoards - 1 freq |
REGAIRDS |
| Time to execute Levenshtein function - 0.346118 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.535851 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.080038 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.087275 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. |