Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
olate (0) - 1 freq 'late (1) - 1 freq oblate (1) - 1 freq olite (1) - 3 freq blate (1) - 82 freq late (1) - 491 freq slate (1) - 33 freq plate (1) - 180 freq plates (2) - 58 freq slated (2) - 1 freq ola (2) - 1 freq clatt (2) - 5 freq clane (2) - 4 freq blake (2) - 8 freq state (2) - 359 freq aplate (2) - 1 freq nate (2) - 9 freq slane (2) - 1 freq cate (2) - 2 freq oates (2) - 1 freq clyte (2) - 1 freq 'mate (2) - 4 freq folae (2) - 1 freq lane (2) - 240 freq sate (2) - 64 freq |
olate (0) - 1 freq olite (1) - 3 freq late (1) - 491 freq lote (2) - 1 freq lute (2) - 8 freq laete (2) - 1 freq elite (2) - 21 freq lyte (2) - 1 freq lat (2) - 551 freq iolite (2) - 1 freq lite (2) - 3 freq blate (2) - 82 freq oblate (2) - 1 freq plate (2) - 180 freq 'late (2) - 1 freq slate (2) - 33 freq irate (3) - 1 freq lace (3) - 31 freq slatie (3) - 2 freq gate (3) - 293 freq alane (3) - 267 freq fate (3) - 103 freq lait (3) - 4 freq 'lat (3) - 14 freq goate (3) - 1 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.205676 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.381439 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.027228 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.043920 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.001130 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. |