====== CFGs and SCFGs ======

===== Algorithms =====
  * Intersecting a CFG with a regular language
    * [[https://aclanthology.org/W11-4408.pdf|Hanneforth 2011 - A Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata]]
    * Common to use the Bar-Hillel construction, see [[https://www.cis.uni-muenchen.de/~fraser/2011_seminar/syntax_lecture1.pdf|here]]

===== Recent Applications =====
  * [[https://aclanthology.org/2021.acl-long.75.pdf|Shaw et al 2021 - Compositional Generalization and Natural Language Variation: Can a Semantic Parsing Approach Handle Both?]]. Uses NQG (Neural Quasi-Synchronous Grammar)
  * [[https://aclanthology.org/2021.emnlp-main.608.pdf|Shin et al 2021 - Constrained Language Models Yield Few-Shot Semantic Parsers]] Uses an SCFG to define a controlled language
  * [[https://arxiv.org/pdf/2009.13845.pdf|Yu et al 2020 - GraPPa: Grammar-Augmented Pre-Training for Table Semantic Parsing]]
  * [[https://arxiv.org/pdf/2105.15021.pdf|Yang et al 2021 - Neural Bi-Lexicalized PCFG Induction]]
  * [[https://aclanthology.org/2022.naacl-main.86.pdf|Yu et al 2022 - Unsupervised Slot Schema Induction for Task-oriented Dialog]]