Concept
Probabilistic context-free grammar
Related lectures (16)
Syntax Trees: Parse vs AST
Explains syntax trees, parse vs AST, while language syntax, AST classes, and grammar ambiguities.
CYK Parsing Algorithm for General Grammars
Introduces the CYK parsing algorithm for context-free grammars, explaining its handling of ambiguity and importance in parsing general grammars.
Chemical Reactions: Transformer Architecture
Explores atom mapping in chemical reactions and the transition to reaction grammar using the transformer architecture.
Introduction to Grammars
Introduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.
CYK Algorithm for Parsing General Grammars
Explores parsing general grammars using the CYK algorithm and Chomsky Normal Form.
Knowledge Inference for Graphs
Explores knowledge inference for graphs, discussing label propagation, optimization objectives, and probabilistic behavior.
Chomsky Normal Form Transformation
Explains the steps to convert a grammar into Chomsky Normal Form.
Parsing with Combinators
Explores parsing text into trees using parser combinators in Scala, covering filtering, transforming, sequencing, alternatives, recursion, spaces handling, lexing, monadic nature, and for-notation.