Spelling Error CorrectionExplores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.
Constructing a Lexer: First SymbolsCovers the computation of 'nullable' and 'first' for regular expressions, converting expressions into a lexer, and handling token priorities.
Context-Free GrammarsCovers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.
Lexicons, n-grams and Language ModelsExplores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.
