Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eraiters (0) - 2 freq craiters (1) - 19 freq eraiturs (1) - 1 freq gaiters (2) - 1 freq trailers (2) - 1 freq paiters (2) - 1 freq trainers (2) - 48 freq craitters (2) - 1 freq craeters (2) - 1 freq waiters (2) - 8 freq scaiters (2) - 1 freq 'waiters (2) - 1 freq slaiters (2) - 1 freq crafters (2) - 1 freq baiters (2) - 2 freq raiders (2) - 5 freq tracters (2) - 1 freq eaters (2) - 2 freq grafters (2) - 3 freq rafters (2) - 11 freq traitors (2) - 6 freq craiter (2) - 27 freq craters (2) - 24 freq craiter's (2) - 1 freq writers (2) - 92 freq |
eraiters (0) - 2 freq eraiturs (1) - 1 freq craiters (2) - 19 freq craters (3) - 24 freq traitors (3) - 6 freq eaters (3) - 2 freq writers (3) - 92 freq rafters (3) - 11 freq eraitur (3) - 1 freq rioters (3) - 1 freq reuters (3) - 6 freq ritirs (3) - 1 freq maiters (3) - 28 freq raiders (3) - 5 freq craiturs (3) - 96 freq arbiters (3) - 1 freq craeters (3) - 1 freq waiters (3) - 8 freq paiters (3) - 1 freq gaiters (3) - 1 freq baiters (3) - 2 freq loiters (4) - 1 freq riter (4) - 1 freq haters (4) - 1 freq riders (4) - 8 freq |
SoundEx code - E636 ereatures - 1 freq eraitur - 1 freq eraiturs - 1 freq eraiters - 2 freq ear-tae-ear - 1 freq earthworms - 1 freq earthwarks - 2 freq |
MetaPhone code - ERTRS ereatures - 1 freq eraiturs - 1 freq eraiters - 2 freq |
ERAITERS |
Time to execute Levenshtein function - 0.221888 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.375627 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.027539 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.037618 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.001065 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. |