| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elaine (0) - 12 freq plaine (1) - 1 freq alaine (1) - 1 freq kline (2) - 1 freq elite (2) - 21 freq klaize (2) - 1 freq plain (2) - 174 freq plaise (2) - 10 freq ellie (2) - 7 freq staine (2) - 2 freq blaise (2) - 1 freq plane (2) - 68 freq elaine's (2) - 1 freq elsie (2) - 62 freq line (2) - 479 freq clane (2) - 4 freq slain (2) - 9 freq plains (2) - 4 freq paine (2) - 5 freq elbain (2) - 1 freq alpine (2) - 2 freq ermine (2) - 7 freq verlaine (2) - 2 freq clain (2) - 13 freq elaiss (2) - 1 freq |
elaine (0) - 12 freq alaine (1) - 1 freq lane (2) - 240 freq lain (2) - 18 freq line (2) - 479 freq plaine (2) - 1 freq alain (2) - 8 freq alane (2) - 267 freq equine (3) - 3 freq lin (3) - 10 freq elide (3) - 1 freq 'lain (3) - 1 freq laive (3) - 3 freq erline (3) - 1 freq aine (3) - 4 freq alana (3) - 12 freq eltin (3) - 1 freq feline (3) - 16 freq elfin (3) - 5 freq eine (3) - 1 freq elie (3) - 1 freq layin (3) - 45 freq elkie (3) - 1 freq alaen (3) - 10 freq lan (3) - 138 freq |
SoundEx code - E450 ellan - 2 freq elaine - 12 freq ellen - 28 freq elm - 3 freq eileen - 18 freq ell-wan - 1 freq eilean - 1 freq ellon - 19 freq eelyin - 1 freq elon - 1 freq |
MetaPhone code - ELN ellan - 2 freq elaine - 12 freq ellen - 28 freq eileen - 18 freq ae-lane - 2 freq eilean - 1 freq ellon - 19 freq elon - 1 freq |
ELAINE |
| Time to execute Levenshtein function - 0.169413 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.321804 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.027191 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.038014 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. |