| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leevin (0) - 195 freq leeving (1) - 1 freq eleevin (1) - 4 freq leevit (1) - 4 freq reevin (1) - 3 freq leein (1) - 29 freq eevin (1) - 5 freq leeven (1) - 2 freq seevin (1) - 27 freq jleevin (1) - 1 freq leivin (1) - 62 freq levin (1) - 1 freq leerin (1) - 5 freq lee'in (1) - 1 freq meevin (1) - 17 freq aleevin (1) - 1 freq leetin (1) - 5 freq leenin (1) - 8 freq leavin (1) - 187 freq deevin (1) - 4 freq leevin' (1) - 1 freq heevin (1) - 9 freq laevin (1) - 12 freq fleecin (2) - 2 freq keelin (2) - 1 freq |
leevin (0) - 195 freq leivin (1) - 62 freq leeven (1) - 2 freq aleevin (1) - 1 freq levin (1) - 1 freq leavin (1) - 187 freq laevin (1) - 12 freq eleevin (1) - 4 freq eleivin (2) - 1 freq lovin (2) - 52 freq eleevan (2) - 1 freq leavan (2) - 2 freq livin (2) - 336 freq eleeven (2) - 35 freq lavin (2) - 2 freq luvin (2) - 26 freq laevan (2) - 15 freq leven (2) - 17 freq leaven (2) - 1 freq laivin (2) - 2 freq heevin (2) - 9 freq jleevin (2) - 1 freq leevin' (2) - 1 freq leerin (2) - 5 freq seevin (2) - 27 freq |
SoundEx code - L150 lippen - 69 freq lowpin - 91 freq leivin - 62 freq livin - 336 freq leavin - 187 freq lovin - 52 freq leevin - 195 freq lappin - 20 freq lupine - 1 freq louvain - 1 freq luvin - 26 freq loupin - 38 freq lavin - 2 freq lavein - 1 freq leven - 17 freq laevan - 15 freq loupan - 2 freq liveen - 5 freq livin' - 13 freq leavin' - 3 freq laipin - 1 freq lippin - 9 freq loupen - 1 freq leeven - 2 freq leppin - 7 freq lippn - 1 freq loopin - 3 freq livvin - 3 freq leapin - 6 freq lobbin - 4 freq livan - 6 freq lave-in - 1 freq laupin - 2 freq lovin' - 2 freq leapin' - 1 freq leaven - 1 freq laevin - 12 freq loveen - 1 freq lovan - 3 freq livveen - 1 freq lafan - 1 freq lapin - 1 freq lepan - 1 freq laffin - 7 freq laivin - 2 freq lowpan - 2 freq laffan - 1 freq leavan - 2 freq laufan - 1 freq lopin - 1 freq lÃvin - 4 freq leafin - 3 freq lippan - 1 freq 'loupin' - 1 freq loafin - 1 freq libyan - 1 freq €œleven - 1 freq lobbyin - 2 freq levin - 1 freq loupin' - 2 freq lappan - 1 freq laepin - 1 freq lhhfhni - 1 freq leevin' - 1 freq lauwfnw - 1 freq lafn - 1 freq lifenew - 1 freq lfn - 1 freq lipn - 1 freq livinÂ’ - 2 freq |
MetaPhone code - LFN leivin - 62 freq livin - 336 freq laughin - 149 freq leavin - 187 freq hlivvin - 1 freq lovin - 52 freq leevin - 195 freq laughin' - 4 freq louvain - 1 freq luvin - 26 freq lavin - 2 freq lavein - 1 freq leven - 17 freq laevan - 15 freq liveen - 5 freq livin' - 13 freq leavin' - 3 freq leeven - 2 freq livvin - 3 freq livan - 6 freq lave-in - 1 freq lovin' - 2 freq leaven - 1 freq laevin - 12 freq loveen - 1 freq lovan - 3 freq laughan - 4 freq laaghan - 1 freq livveen - 1 freq laaghin - 1 freq lafan - 1 freq laffin - 7 freq laivin - 2 freq laffan - 1 freq leavan - 2 freq laufan - 1 freq laigh-in - 1 freq lÃvin - 4 freq leafin - 3 freq loafin - 1 freq €œleven - 1 freq levin - 1 freq lhhfhni - 1 freq leevin' - 1 freq lauwfnw - 1 freq lafn - 1 freq lifenew - 1 freq lfn - 1 freq livinÂ’ - 2 freq |
LEEVIN |
| Time to execute Levenshtein function - 0.205181 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.381688 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.028189 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.037826 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.000956 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. |