| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rear (0) - 29 freq rhar (1) - 1 freq rears (1) - 2 freq rea (1) - 1 freq mear (1) - 3 freq bear (1) - 217 freq pear (1) - 9 freq real (1) - 565 freq reak (1) - 1 freq tear (1) - 100 freq fear (1) - 415 freq near (1) - 1153 freq re'r (1) - 1 freq rer (1) - 3 freq reer (1) - 1 freq roar (1) - 81 freq drear (1) - 10 freq wear (1) - 157 freq reir (1) - 1 freq gear (1) - 228 freq 'ear (1) - 15 freq read (1) - 926 freq sear (1) - 1 freq rerr (1) - 20 freq year (1) - 2026 freq |
rear (0) - 29 freq reer (1) - 1 freq rer (1) - 3 freq roar (1) - 81 freq rar (1) - 1 freq reir (1) - 1 freq dear (2) - 419 freq rerr (2) - 20 freq year (2) - 2026 freq ear (2) - 139 freq lear (2) - 107 freq ream (2) - 4 freq rur (2) - 3 freq ruary (2) - 1 freq rior (2) - 1 freq rr (2) - 1 freq rare (2) - 296 freq reap (2) - 9 freq err (2) - 40 freq rair (2) - 30 freq sear (2) - 1 freq hear (2) - 1383 freq pear (2) - 9 freq real (2) - 565 freq reak (2) - 1 freq |
SoundEx code - R600 rair - 30 freq rerr - 20 freq rare - 296 freq rairie - 3 freq roar - 81 freq rear - 29 freq reerie - 4 freq rior - 1 freq rewire - 2 freq re-wire - 1 freq reer - 1 freq re'r - 1 freq ruary - 1 freq rhar - 1 freq rorie - 3 freq 'rare - 1 freq reir - 1 freq rora - 2 freq roarie - 2 freq 'rerr - 1 freq rar - 1 freq rower - 2 freq r'ur - 1 freq rer - 3 freq rur - 3 freq ru'r - 1 freq rory - 15 freq 'rurie - 2 freq ruairi - 1 freq rawer - 1 freq royhair - 3 freq |
MetaPhone code - RR rair - 30 freq rerr - 20 freq rare - 296 freq rairie - 3 freq roar - 81 freq rear - 29 freq reerie - 4 freq rior - 1 freq reer - 1 freq re'r - 1 freq ruary - 1 freq rorie - 3 freq 'rare - 1 freq reir - 1 freq rora - 2 freq roarie - 2 freq 'rerr - 1 freq rar - 1 freq r'ur - 1 freq rer - 3 freq rur - 3 freq ru'r - 1 freq rory - 15 freq 'rurie - 2 freq ruairi - 1 freq |
REAR |
| Time to execute Levenshtein function - 0.213045 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.346246 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.035389 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.042286 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.000967 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. |