| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ruifs (0) - 9 freq ruits (1) - 41 freq ruims (1) - 9 freq ruids (1) - 4 freq ruffs (1) - 1 freq huifs (1) - 7 freq luifs (1) - 5 freq reifs (1) - 1 freq pruifs (1) - 5 freq rufs (1) - 1 freq ruif (1) - 77 freq ruins (1) - 26 freq cuifs (1) - 1 freq luift (2) - 3 freq duis (2) - 23 freq ruifed (2) - 1 freq tuils (2) - 13 freq rails (2) - 15 freq ruill (2) - 2 freq runts (2) - 1 freq runes (2) - 6 freq ruft (2) - 1 freq glifs (2) - 1 freq duirs (2) - 5 freq rugs (2) - 9 freq |
ruifs (0) - 9 freq rufs (1) - 1 freq reifs (1) - 1 freq ruif (2) - 77 freq cuifs (2) - 1 freq rufus (2) - 5 freq roofs (2) - 11 freq refs (2) - 6 freq reefs (2) - 6 freq ruins (2) - 26 freq ruits (2) - 41 freq pruifs (2) - 5 freq ruids (2) - 4 freq ruims (2) - 9 freq ruffs (2) - 1 freq huifs (2) - 7 freq luifs (2) - 5 freq russ (3) - 2 freq ruives (3) - 2 freq ruts (3) - 3 freq riff (3) - 1 freq turfs (3) - 1 freq ruses (3) - 1 freq rims (3) - 3 freq ruff (3) - 12 freq |
SoundEx code - R120 ruifs - 9 freq reap's - 1 freq refuge - 6 freq 'reviews - 2 freq rubbish - 67 freq raips - 7 freq roofs - 11 freq ribs - 33 freq robes - 7 freq rab's - 9 freq rubs - 9 freq ropes - 21 freq rubbage - 4 freq revise - 6 freq raves - 5 freq refuse - 24 freq revs - 1 freq rabbie's - 5 freq robbie's - 5 freq rivvies - 1 freq rebuke - 3 freq rebecca - 16 freq rubies - 4 freq raipes - 1 freq reifs - 1 freq rbs - 1 freq rips - 9 freq reviews - 19 freq ravish - 1 freq rfc - 1 freq rabies - 2 freq rope's - 1 freq robbys - 1 freq robby's - 1 freq rives - 4 freq roves - 1 freq rebekah - 3 freq refugee - 5 freq ravsie - 2 freq ruives - 2 freq rufus - 5 freq rufus's - 1 freq rüfs - 2 freq reeves - 5 freq rebigg - 1 freq reeboks - 1 freq reives - 2 freq reefs - 6 freq rps - 17 freq 'reviews' - 1 freq rupes - 1 freq ruffs - 1 freq refeese - 1 freq roups - 2 freq rapes - 1 freq raps - 1 freq refaise - 1 freq ravis - 1 freq reiffis - 1 freq rippek - 2 freq rovies - 1 freq €œrubbish - 1 freq re-pack - 1 freq rubik - 1 freq rufs - 1 freq refuise - 1 freq rob's - 1 freq rvhs - 1 freq rpcy - 1 freq reaps - 11 freq robskeeee - 1 freq rbjq - 1 freq rbj - 1 freq refs - 6 freq rpjj - 1 freq rvjo - 1 freq rvus - 1 freq reps - 1 freq repas - 1 freq rebs - 3 freq ruffage - 1 freq rfk - 1 freq |
MetaPhone code - RFS ruifs - 9 freq 'reviews - 2 freq roofs - 11 freq revise - 6 freq raves - 5 freq refuse - 24 freq revs - 1 freq rivvies - 1 freq reifs - 1 freq reviews - 19 freq rives - 4 freq roves - 1 freq ravsie - 2 freq ruives - 2 freq rufus - 5 freq rüfs - 2 freq reeves - 5 freq reives - 2 freq reefs - 6 freq 'reviews' - 1 freq ruffs - 1 freq refeese - 1 freq refaise - 1 freq ravis - 1 freq reiffis - 1 freq wrvs - 1 freq rovies - 1 freq rufs - 1 freq refuise - 1 freq rvhs - 1 freq refs - 6 freq rvus - 1 freq |
RUIFS |
| Time to execute Levenshtein function - 0.183135 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.319005 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.027211 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.037543 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.000824 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. |