| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reiver (0) - 22 freq reider (1) - 5 freq reever (1) - 2 freq river (1) - 264 freq reive (1) - 5 freq reived (1) - 5 freq reivers (1) - 17 freq neiver (1) - 1 freq rekiver (1) - 1 freq reives (1) - 2 freq dreiver (1) - 1 freq screiver (2) - 8 freq driver (2) - 89 freq neiper (2) - 6 freq recover (2) - 7 freq leived (2) - 11 freq rover (2) - 12 freq leive (2) - 25 freq lever (2) - 2 freq deived (2) - 1 freq raver (2) - 4 freq rider (2) - 10 freq raiser (2) - 2 freq preived (2) - 1 freq rimer (2) - 1 freq |
reiver (0) - 22 freq river (1) - 264 freq reever (1) - 2 freq revere (2) - 1 freq ryver (2) - 1 freq raver (2) - 4 freq riever (2) - 2 freq dreiver (2) - 1 freq rover (2) - 12 freq reives (2) - 2 freq reived (2) - 5 freq reive (2) - 5 freq reider (2) - 5 freq reivers (2) - 17 freq neiver (2) - 1 freq rekiver (2) - 1 freq revoir (3) - 5 freq reir (3) - 1 freq rive (3) - 18 freq reeve (3) - 1 freq reer (3) - 1 freq siver (3) - 2 freq hever (3) - 2 freq reader (3) - 89 freq riper (3) - 4 freq |
SoundEx code - R160 river - 264 freq reappear - 6 freq rubber - 54 freq riper - 4 freq reverie - 2 freq referee - 15 freq 'rubber - 1 freq repair - 15 freq rapier - 2 freq rover - 12 freq reiver - 22 freq refer - 37 freq revoir - 5 freq raver - 4 freq rapper - 4 freq raverie - 1 freq ripper - 10 freq reaper - 16 freq riever - 2 freq robbery - 8 freq reviewer - 2 freq rubbery - 7 freq rïver - 5 freq robber - 3 freq ryver - 1 freq reveiry - 1 freq reapir - 1 freq reever - 2 freq re-fere - 1 freq rubbir - 1 freq rpr - 2 freq revere - 1 freq re-appear - 1 freq riviera - 1 freq robfray - 1 freq |
MetaPhone code - RFR river - 264 freq reverie - 2 freq referee - 15 freq rover - 12 freq reiver - 22 freq refer - 37 freq revoir - 5 freq raver - 4 freq raverie - 1 freq riever - 2 freq rougher - 1 freq rïver - 5 freq ryver - 1 freq reveiry - 1 freq reever - 2 freq re-fere - 1 freq revere - 1 freq riviera - 1 freq |
REIVER |
| Time to execute Levenshtein function - 0.222086 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.335325 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.027949 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.038279 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.000847 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. |