| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| remeidit (0) - 1 freq remindit (2) - 7 freq reveisit (2) - 1 freq remerkit (2) - 2 freq beheidit (2) - 6 freq remeids- (2) - 1 freq remainit (2) - 1 freq reweirdit (2) - 1 freq releifit (2) - 1 freq receivit (2) - 3 freq remeid (2) - 7 freq reestit (3) - 11 freq reservit (3) - 5 freq recordit (3) - 27 freq remit (3) - 11 freq smeigit (3) - 1 freq revealit (3) - 2 freq precedit (3) - 4 freq rejectit (3) - 3 freq heedit (3) - 6 freq recedin (3) - 4 freq receipt (3) - 18 freq reipit (3) - 2 freq steidit (3) - 24 freq reikit (3) - 1 freq |
remeidit (0) - 1 freq remindit (3) - 7 freq remainit (3) - 1 freq remeid (3) - 7 freq raidit (4) - 2 freq readit (4) - 3 freq reddit (4) - 13 freq remede (4) - 1 freq remead (4) - 2 freq remaint (4) - 1 freq redit (4) - 2 freq remedies (4) - 4 freq removit (4) - 1 freq remedy (4) - 4 freq remeent (4) - 2 freq remedes (4) - 1 freq releifit (4) - 1 freq remindet (4) - 4 freq remit (4) - 11 freq remeids- (4) - 1 freq beheidit (4) - 6 freq reveisit (4) - 1 freq receivit (4) - 3 freq remerkit (4) - 2 freq reweirdit (4) - 1 freq |
SoundEx code - R533 rendeition - 1 freq roonded - 13 freq roondit - 13 freq rented - 4 freq ranted - 4 freq rentit - 6 freq roundit - 3 freq roondid - 1 freq rendition - 5 freq rantit - 1 freq reunitet - 1 freq rounded - 7 freq reunited - 1 freq runtit - 3 freq rendeitioun - 1 freq remittit - 1 freq rendeitions - 2 freq randit - 1 freq ryndit - 1 freq reunitit - 1 freq remeidit - 1 freq renditon - 1 freq reuinitit - 1 freq rendeetion - 1 freq roondheads - 1 freq |
MetaPhone code - RMTT remittit - 1 freq remeidit - 1 freq |
REMEIDIT |
| Time to execute Levenshtein function - 0.214127 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.377164 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.027756 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.037188 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.000868 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. |