| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reekiewar (0) - 1 freq reekied (3) - 1 freq reekie (3) - 27 freq seekitar (3) - 1 freq reekie's (3) - 5 freq reviewer (3) - 2 freq reekiebraes (4) - 1 freq regiar (4) - 1 freq review (4) - 71 freq leeterar (4) - 14 freq reekan (4) - 1 freq renewal (4) - 4 freq keeker (4) - 3 freq review' (4) - 1 freq reappear (4) - 6 freq reekin (4) - 45 freq seeker (4) - 2 freq peerier (4) - 17 freq retriever (4) - 2 freq peekie (4) - 1 freq reedware (4) - 1 freq reviewers (4) - 3 freq heedgear (4) - 1 freq reeking (4) - 1 freq lenziepar (4) - 1 freq |
reekiewar (0) - 1 freq reviewer (4) - 2 freq reekied (5) - 1 freq reidware (5) - 1 freq reedware (5) - 1 freq reekie (5) - 27 freq rekiver (5) - 1 freq seekitar (5) - 1 freq reekie's (5) - 5 freq reekit (6) - 3 freq reikie (6) - 10 freq reever (6) - 2 freq retenar (6) - 1 freq reekin' (6) - 2 freq rentier (6) - 1 freq skewer (6) - 5 freq regilar (6) - 1 freq reviewed (6) - 7 freq yerker (6) - 1 freq kawar (6) - 1 freq raker (6) - 2 freq reeder (6) - 3 freq reepepr (6) - 1 freq reviews (6) - 19 freq reeked (6) - 6 freq |
SoundEx code - R260 razer - 1 freq richer - 15 freq reassuir - 2 freq reassure - 12 freq razzor - 2 freq razor - 14 freq rugger - 2 freq rocker - 3 freq rosary - 6 freq rigger - 2 freq rocher - 5 freq require - 10 freq racer - 1 freq racherie - 1 freq rosario - 1 freq rougher - 1 freq roger - 5 freq rockery - 1 freq regiar - 1 freq rigor - 1 freq rasher - 1 freq roeckir - 1 freq rouchir - 1 freq raigiar - 1 freq roucher - 2 freq recur - 1 freq €œroger - 3 freq raiser - 2 freq rougier - 2 freq rosr - 1 freq rsyry - 1 freq rigeur - 1 freq raker - 2 freq reekiewar - 1 freq rzr - 1 freq |
MetaPhone code - RKWR reekiewar - 1 freq |
REEKIEWAR |
| Time to execute Levenshtein function - 0.228072 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.385599 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.027928 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.038857 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.000950 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. |