Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
olate (0) - 1 freq 'late (1) - 1 freq olite (1) - 3 freq oblate (1) - 1 freq late (1) - 496 freq slate (1) - 33 freq plate (1) - 183 freq blate (1) - 82 freq owte (2) - 2 freq onte (2) - 18 freq slade (2) - 3 freq olaf (2) - 292 freq olaf' (2) - 1 freq lame (2) - 10 freq lane (2) - 240 freq flake (2) - 7 freq slaty (2) - 1 freq tate (2) - 12 freq polatie (2) - 1 freq aplate (2) - 1 freq lace (2) - 31 freq laete (2) - 1 freq olde (2) - 1 freq plyte (2) - 1 freq clyte (2) - 1 freq |
olate (0) - 1 freq olite (1) - 3 freq late (1) - 496 freq iolite (2) - 1 freq lite (2) - 3 freq lute (2) - 8 freq lote (2) - 1 freq elite (2) - 22 freq lat (2) - 555 freq lyte (2) - 1 freq laete (2) - 1 freq plate (2) - 183 freq blate (2) - 82 freq slate (2) - 33 freq oblate (2) - 1 freq 'late (2) - 1 freq platie (3) - 2 freq ola (3) - 1 freq plato (3) - 4 freq latte (3) - 5 freq polite (3) - 56 freq ole (3) - 2 freq alane (3) - 273 freq lade (3) - 26 freq flute (3) - 16 freq |
SoundEx code - O430 old - 178 freq oolit - 2 freq owld - 166 freq 'old - 3 freq ould - 21 freq olate - 1 freq 'owld - 2 freq oiled - 1 freq owild - 3 freq olite - 3 freq olde - 1 freq €˜old - 1 freq oolt - 1 freq oleit - 1 freq ool-eed - 1 freq €œold - 1 freq €œould - 1 freq oldie - 2 freq old” - 1 freq |
MetaPhone code - OLT old - 178 freq oolit - 2 freq owld - 166 freq 'old - 3 freq ould - 21 freq olate - 1 freq 'owld - 2 freq oiled - 1 freq olite - 3 freq olde - 1 freq €˜old - 1 freq oolt - 1 freq oleit - 1 freq ool-eed - 1 freq €œold - 1 freq €œould - 1 freq oldie - 2 freq old” - 1 freq |
OLATE |
Time to execute Levenshtein function - 0.203084 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.336087 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.027939 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.037588 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.000925 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. |