| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ravenin (0) - 1 freq ravelin (1) - 3 freq ranin (2) - 1 freq apenin (2) - 10 freq ragein (2) - 1 freq ravin (2) - 10 freq raivelin (2) - 2 freq raven (2) - 12 freq haverin (2) - 25 freq 'evenin (2) - 1 freq ripenin (2) - 5 freq kaenin (2) - 2 freq javelin (2) - 1 freq raverie (2) - 1 freq avengin (2) - 1 freq rage-in (2) - 2 freq travelin (2) - 1 freq waverin (2) - 1 freq lave-in (2) - 1 freq ravelins (2) - 1 freq raedin (2) - 1 freq ravens (2) - 5 freq raepin (2) - 3 freq rainin (2) - 41 freq rivening (2) - 1 freq |
ravenin (0) - 1 freq ravelin (2) - 3 freq ripenin (3) - 5 freq rivening (3) - 1 freq 'evenin (3) - 1 freq ravens (3) - 5 freq rainin (3) - 41 freq evenin (3) - 133 freq ravin (3) - 10 freq ranin (3) - 1 freq raivelin (3) - 2 freq raven (3) - 12 freq ravan (4) - 2 freq roonin (4) - 1 freq reponin (4) - 2 freq evinin (4) - 1 freq raivern (4) - 1 freq rivened (4) - 1 freq revenge (4) - 23 freq rationin (4) - 3 freq ravines (4) - 1 freq reconin (4) - 1 freq reasonin (4) - 5 freq rainan (4) - 1 freq renn (4) - 9 freq |
SoundEx code - R155 repeyment - 1 freq refinement - 3 freq ripenin - 5 freq reponin - 2 freq ravenin - 1 freq refinin - 2 freq reponents - 1 freq ruifmemmers - 1 freq rpmmomthvo - 1 freq rivening - 1 freq robbiemenzies - 8 freq |
MetaPhone code - RFNN ravenin - 1 freq refinin - 2 freq |
RAVENIN |
| Time to execute Levenshtein function - 0.216443 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.441141 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.060456 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.037231 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.000922 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. |