| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rear (0) - 29 freq reer (1) - 1 freq reak (1) - 1 freq gear (1) - 237 freq 'ear (1) - 25 freq ream (1) - 4 freq pear (1) - 9 freq wear (1) - 162 freq rea (1) - 1 freq reir (1) - 1 freq dear (1) - 425 freq reap (1) - 10 freq drear (1) - 10 freq year (1) - 2070 freq rar (1) - 1 freq reat (1) - 1 freq reaf (1) - 1 freq read (1) - 958 freq ear (1) - 143 freq rhar (1) - 1 freq lear (1) - 107 freq re'r (1) - 1 freq tear (1) - 103 freq real (1) - 592 freq near (1) - 1175 freq |
rear (0) - 29 freq reer (1) - 1 freq reir (1) - 1 freq roar (1) - 81 freq rar (1) - 1 freq rer (1) - 3 freq rears (2) - 2 freq sear (2) - 2 freq real (2) - 592 freq near (2) - 1175 freq hear (2) - 1399 freq fear (2) - 429 freq rerr (2) - 21 freq bear (2) - 217 freq rior (2) - 1 freq err (2) - 40 freq ruary (2) - 1 freq rr (2) - 1 freq rair (2) - 30 freq tear (2) - 103 freq rare (2) - 301 freq mear (2) - 3 freq rur (2) - 3 freq pear (2) - 9 freq rea (2) - 1 freq |
SoundEx code - R600 rair - 30 freq rerr - 21 freq rare - 301 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 - 21 freq rare - 301 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.212237 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.323436 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.029243 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.039862 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.000956 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. |