| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rover (0) - 12 freq dover (1) - 16 freq lover (1) - 27 freq sover (1) - 1 freq roves (1) - 1 freq rove (1) - 2 freq mover (1) - 1 freq ryver (1) - 1 freq drover (1) - 1 freq rower (1) - 2 freq roger (1) - 5 freq rovers (1) - 23 freq river (1) - 270 freq raver (1) - 4 freq hover (1) - 9 freq over (1) - 340 freq cover (1) - 147 freq roe (2) - 15 freq never (2) - 1661 freq overs (2) - 2 freq hooer (2) - 2 freq joker (2) - 7 freq move (2) - 314 freq goves (2) - 2 freq novel (2) - 65 freq |
rover (0) - 12 freq ryver (1) - 1 freq raver (1) - 4 freq river (1) - 270 freq hover (2) - 9 freq over (2) - 340 freq cover (2) - 147 freq revere (2) - 1 freq reever (2) - 2 freq riever (2) - 2 freq rovers (2) - 23 freq reiver (2) - 22 freq lover (2) - 27 freq roger (2) - 5 freq sover (2) - 1 freq roves (2) - 1 freq dover (2) - 16 freq rove (2) - 2 freq mover (2) - 1 freq rower (2) - 2 freq drover (2) - 1 freq ruler (3) - 10 freq riper (3) - 4 freq rider (3) - 10 freq iver (3) - 312 freq |
SoundEx code - R160 river - 270 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 - 20 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 - 270 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 |
ROVER |
| Time to execute Levenshtein function - 0.253379 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.467802 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.029421 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.036853 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.000932 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. |