| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earls (0) - 12 freq barls (1) - 1 freq earl's (1) - 1 freq eares (1) - 1 freq earl (1) - 31 freq jarls (1) - 11 freq ear's (1) - 1 freq earns (1) - 3 freq warls (1) - 4 freq ears (1) - 111 freq farls (1) - 5 freq early (1) - 358 freq pearls (1) - 17 freq cauls (2) - 1 freq emrys (2) - 1 freq mails (2) - 3 freq cares (2) - 58 freq eels (2) - 11 freq birls (2) - 31 freq euros (2) - 7 freq easle (2) - 2 freq balls (2) - 19 freq gar's (2) - 2 freq seals (2) - 22 freq tails (2) - 53 freq |
earls (0) - 12 freq pearls (2) - 17 freq farls (2) - 5 freq erles (2) - 1 freq rails (2) - 15 freq rls (2) - 7 freq arles (2) - 5 freq ears (2) - 111 freq early (2) - 358 freq earl (2) - 31 freq eares (2) - 1 freq earl's (2) - 1 freq barls (2) - 1 freq warls (2) - 4 freq jarls (2) - 11 freq earns (2) - 3 freq ear's (2) - 1 freq peals (3) - 2 freq saels (3) - 1 freq haals (3) - 9 freq hurls (3) - 4 freq curls (3) - 36 freq sauls (3) - 14 freq fauls (3) - 2 freq eagles (3) - 11 freq |
SoundEx code - E642 earls - 12 freq earlshall - 3 freq earlshall's - 1 freq earlshaa - 1 freq earal's - 1 freq earl's - 1 freq earliest - 19 freq eerie-like - 2 freq erliest - 1 freq erles - 1 freq earls-hall - 1 freq earlyish - 1 freq earlstonloon - 2 freq |
MetaPhone code - ERLS earls - 12 freq earal's - 1 freq earl's - 1 freq erles - 1 freq |
EARLS |
| Time to execute Levenshtein function - 0.185967 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.330646 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.027133 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.036605 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.000776 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. |