| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quotations (0) - 12 freq quotation' (1) - 1 freq quotation (1) - 19 freq rotations (2) - 1 freq questions (3) - 193 freq quaistions (3) - 5 freq conotations (3) - 4 freq quistions (3) - 1 freq equations (3) - 5 freq locations (3) - 9 freq imitations (3) - 3 freq fundations (3) - 1 freq denotations (3) - 2 freq donations (3) - 2 freq notation (3) - 1 freq stations (3) - 10 freq rotation (3) - 1 freq citations (3) - 3 freq queestions (3) - 4 freq mutation (3) - 1 freq novations (3) - 1 freq questiont (4) - 1 freq oration (4) - 1 freq quotin (4) - 9 freq quittin (4) - 1 freq |
quotations (0) - 12 freq quotation (2) - 19 freq quotation' (2) - 1 freq rotations (3) - 1 freq queestions (4) - 4 freq equations (4) - 5 freq imitations (4) - 3 freq citations (4) - 3 freq quaistions (4) - 5 freq questions (4) - 193 freq stations (4) - 10 freq quistions (4) - 1 freq wuttins (5) - 1 freq quaistins (5) - 1 freq questiouns (5) - 1 freq buttons (5) - 57 freq questiones (5) - 1 freq suttins (5) - 2 freq quaistiouns (5) - 2 freq situations (5) - 20 freq quastiouns (5) - 4 freq equaetions (5) - 2 freq staetions (5) - 4 freq petitions (5) - 1 freq questins (5) - 1 freq |
SoundEx code - Q335 quotation - 19 freq quait-waitin - 1 freq quotations - 12 freq quotation' - 1 freq quotidian - 1 freq |
MetaPhone code - KTXNS quotations - 12 freq |
QUOTATIONS |
| Time to execute Levenshtein function - 0.216383 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.385382 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.029808 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.039682 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.000929 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. |