| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| riever (0) - 2 freq reever (1) - 2 freq rieve (1) - 1 freq rievers (1) - 1 freq siever (1) - 2 freq river (1) - 264 freq rived (2) - 20 freq reeved (2) - 2 freq 'never (2) - 14 freq reer (2) - 1 freq sever (2) - 3 freq richer (2) - 15 freq silver (2) - 120 freq nivver (2) - 976 freq aiver (2) - 3 freq rover (2) - 12 freq wiver (2) - 1 freq yivver (2) - 4 freq filever (2) - 1 freq lever (2) - 2 freq grieved (2) - 3 freq bieber (2) - 1 freq nieves (2) - 15 freq grieves (2) - 2 freq finever (2) - 2 freq |
riever (0) - 2 freq reever (1) - 2 freq river (1) - 264 freq rover (2) - 12 freq ryver (2) - 1 freq reiver (2) - 22 freq raver (2) - 4 freq revere (2) - 1 freq rievers (2) - 1 freq siever (2) - 2 freq rieve (2) - 1 freq reeder (3) - 3 freq rider (3) - 10 freq raeler (3) - 1 freq riper (3) - 4 freq firever (3) - 3 freq fiver (3) - 46 freq revert (3) - 4 freq avever (3) - 1 freq reeves (3) - 5 freq ivver (3) - 275 freq rimer (3) - 1 freq hever (3) - 2 freq fever (3) - 37 freq refer (3) - 37 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 |
RIEVER |
| Time to execute Levenshtein function - 0.198759 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.365669 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.028190 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.037688 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.000895 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. |