Table of Contents
CFGs and SCFGs
Algorithms
Recent Applications
CFGs and SCFGs
Algorithms
Intersecting a CFG with a regular language
Hanneforth 2011 - A Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata
Common to use the Bar-Hillel construction, see
here
Recent Applications
Shaw et al 2021 - Compositional Generalization and Natural Language Variation: Can a Semantic Parsing Approach Handle Both?
. Uses NQG (Neural Quasi-Synchronous Grammar)
Shin et al 2021 - Constrained Language Models Yield Few-Shot Semantic Parsers
Uses an SCFG to define a controlled language
Yu et al 2020 - GraPPa: Grammar-Augmented Pre-Training for Table Semantic Parsing
Yang et al 2021 - Neural Bi-Lexicalized PCFG Induction
Yu et al 2022 - Unsupervised Slot Schema Induction for Task-oriented Dialog