| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| resaif (0) - 2 freq restis (2) - 1 freq repaid (2) - 1 freq regain (2) - 10 freq retain (2) - 8 freq reaf (2) - 1 freq restin (2) - 31 freq desair (2) - 1 freq respin (2) - 1 freq resin (2) - 6 freq resit (2) - 1 freq retail (2) - 7 freq restit (2) - 18 freq repair (2) - 15 freq remain (2) - 40 freq reif (2) - 2 freq saif (2) - 4 freq relait (2) - 1 freq respek (3) - 2 freq hesni (3) - 1 freq saig (3) - 3 freq restairt (3) - 2 freq rushit (3) - 1 freq rennin (3) - 6 freq laif (3) - 5 freq |
resaif (0) - 2 freq reaf (3) - 1 freq resit (3) - 1 freq reif (3) - 2 freq saif (3) - 4 freq resin (3) - 6 freq res (4) - 2 freq rese (4) - 1 freq risit (4) - 1 freq arisaig (4) - 1 freq raesan (4) - 1 freq rescue (4) - 41 freq relief (4) - 109 freq resty (4) - 1 freq rashie (4) - 1 freq risin (4) - 137 freq reasin (4) - 2 freq rosary (4) - 6 freq reesin (4) - 1 freq rissie (4) - 1 freq resume (4) - 6 freq rysa (4) - 1 freq rasin (4) - 1 freq resile (4) - 1 freq reset (4) - 1 freq |
SoundEx code - R210 recipe - 33 freq rugby - 49 freq receive - 21 freq rasp - 11 freq 'rugby - 1 freq 'recipe' - 1 freq rosscoff - 1 freq recap - 1 freq raspy - 3 freq recoop - 1 freq recipie - 2 freq rock-a-bye - 1 freq rspb - 11 freq rspba - 6 freq risp - 2 freq resaif - 2 freq rose-hip - 1 freq rougvie - 1 freq recoup - 3 freq rokeby - 1 freq reshape - 1 freq rkwp - 1 freq rcf - 1 freq rrrxb - 1 freq rzyebw - 1 freq rxjfb - 1 freq rgwip - 1 freq rqp - 1 freq royxf - 1 freq rwowzp - 1 freq rgohev - 1 freq |
MetaPhone code - RSF receive - 21 freq resaif - 2 freq |
RESAIF |
| Time to execute Levenshtein function - 0.196432 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.347716 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.027823 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.037087 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.000908 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. |