Mestrado: Computação, Lógica e Teoria dos Conjuntos - Aula 02
Explore formal languages, register machines, decidability, algorithmic complexity, first-order logic, and set theory in this advanced mathematics lecture.
Probabilistic Models for Learning a Semantic Parser Lexicon
Probabilistic models for learning semantic parser lexicons from question/answer pairs, improving accuracy and efficiency without extensive human input or dataset-specific engineering.
Chomsky Normal Form and Conversion of CFG to CNF in Automata Theory
Learn to convert Context-Free Grammars to Chomsky Normal Form, a standardized format for simplifying and analyzing grammars in automata theory. Understand the steps and rules for this important transformation.
Exploring Formal-Language Syntax with Multiway Systems
Explore computational dynamics of formal-language syntax using multiway systems, focusing on substitution rules and visualization of various grammar types.
Weak and Strong Learning of Context-Free Grammars - 2012
Explore recent advancements in unsupervised learning of context-free grammars and the transition from weak to strong learning algorithms for accurate syntactic structure prediction.
Eliminating Input-Based Attacks by Deriving Automated Encoders and Decoders from Context-Free Grammars
Learn to derive automated encoders and decoders from context-free grammars to eliminate input-based attacks, enhancing security in complex language communication systems.
Compile-time Reparsing - C++Now 2012
Explore compile-time parsing techniques in C++ for creating embedded domain-specific languages, including runtime expressions, compile-time strings, and angle-bracket expressions.
Learn from LL-1 to PEG Parser the Hard Way
Explore parser evolution from LL(1) to PEG, covering compiler fundamentals, traditional techniques, and CPython's implementation. Gain insights into parsing concepts and their practical applications.
Automated Ambiguity Detection in Layout-Sensitive Grammars
Explore automated ambiguity detection in layout-sensitive grammars using SMT solving. Learn about local ambiguity, reachability conditions, and their application to language design.
Elimination of Left Recursion in Compiler Design - Examples and Explanation
Explore left recursion in compiler design, its impact on parsing, and techniques for elimination. Learn to identify and resolve left-recursive grammars for efficient parsing.
Left Factoring in Compiler Design - Elimination of Left Factored Grammar
Explore left factoring in compiler design, including left factored grammar and elimination techniques. Learn to optimize grammar for efficient parsing and reduce ambiguity in language processing.
Deep CPCFG for Information Extraction
Explore deep learning techniques for information extraction using Conditional Probabilistic Context-Free Grammars. Learn about document parsing, schema representation, and handling noisy data in this advanced lecture.
Modelling Human Syntax by Means of Probabilistic Dependency Grammars - 2007
Explore probabilistic dependency grammars for modeling human syntax, addressing linguistic phenomena beyond context-free grammars and discussing generative models and parsing algorithms.