☆22Jan 22, 2026Updated last month
Alternatives and similar repositories for glt-grounded-latent-trees-qa
Users that are interested in glt-grounded-latent-trees-qa are comparing it to the libraries listed below
Sorting:
- Fast and Modularized CFG-focused Models☆23Nov 8, 2023Updated 2 years ago
- Recursive Bayesian Networks☆11May 11, 2025Updated 9 months ago
- X (weighted / probabilistic) Context-Free Grammars☆25Jan 30, 2024Updated 2 years ago
- Author implementation of the paper "Span-based Semantic Parsing for Compositional Generalization"☆17Aug 29, 2021Updated 4 years ago
- ☆17Oct 4, 2020Updated 5 years ago
- The Return of Lexical Dependencies: Neural Lexicalized PCFGs (TACL)☆33Sep 22, 2025Updated 5 months ago
- ☆17Nov 10, 2021Updated 4 years ago
- Compositional generalization through meta sequence-to-sequence learning☆83Jan 7, 2020Updated 6 years ago
- source code for NAACL2022 main conference "Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGs"☆10Sep 26, 2022Updated 3 years ago
- Advanced Formal Language Theory (263-5352-00L; Frühjahr 2023)☆10Feb 21, 2023Updated 3 years ago
- Neural Logic Inductive Learning☆44Aug 6, 2022Updated 3 years ago
- Official PyTorch (Lightning) implementation of the NeurIPS 2020 paper "Efficient Marginalization of Discrete and Structured Latent Variab…☆27May 3, 2021Updated 4 years ago
- ☆29Nov 30, 2021Updated 4 years ago
- Humans understand novel sentences by composing meanings and roles of core language components. In contrast, neural network models for nat…☆27Apr 23, 2020Updated 5 years ago
- Differentiable Perturb-and-Parse operator☆25Mar 7, 2019Updated 7 years ago
- Code for the ICLR 2019 paper "Learning to Represent Edits"☆13Dec 8, 2022Updated 3 years ago
- ☆14Feb 1, 2024Updated 2 years ago
- Code for the paper "Understanding the Mechanics of SPIGOT: Surrogate Gradients for Latent Structure Learning"☆11May 5, 2021Updated 4 years ago
- source code of NAACL2021 "PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbols“ and ACL2021 main conferenc…☆52Mar 28, 2025Updated 11 months ago
- Leveraging Recursive Gumbel-Max Trick for Approximate Inference in Combinatorial Spaces, NeurIPS 2021☆14Dec 11, 2021Updated 4 years ago
- ☆13Feb 7, 2023Updated 3 years ago
- Easy trees in LaTeX and TikZ☆14Dec 16, 2022Updated 3 years ago
- Fine-Tuning Pre-trained Transformers into Decaying Fast Weights☆19Oct 9, 2022Updated 3 years ago
- ☆54Nov 7, 2020Updated 5 years ago
- Web page for our tutorial on latent structure for NLP☆47Sep 1, 2019Updated 6 years ago
- Data and Code Release for "On the Potential of Lexico-logical Alignments for Semantic Parsing to SQL Queries"☆55Nov 9, 2020Updated 5 years ago
- Reranking-based dependency parsing with inside-outside recursive neural network☆21Oct 11, 2014Updated 11 years ago
- The substitution of qsub.☆12Jan 25, 2019Updated 7 years ago
- Systematic generalization test for CLEVR☆15Mar 11, 2020Updated 5 years ago
- ☆18Mar 10, 2023Updated 3 years ago
- [ICML 2023] "Data Efficient Neural Scaling Law via Model Reusing" by Peihao Wang, Rameswar Panda, Zhangyang Wang☆14Jan 4, 2024Updated 2 years ago
- Implementation and experiments for Partially Supervised NER via Expected Entity Ratio in TACL 2022☆14Nov 7, 2022Updated 3 years ago
- Paper: Lexicon Learning for Few-Shot Neural Sequence Modeling☆16Jan 8, 2022Updated 4 years ago
- A PyTorch Implementation of Neural Symbolic Machines by Liang et al. (2018)☆63Aug 19, 2020Updated 5 years ago
- ☆15Mar 22, 2023Updated 2 years ago
- Zero-Shot Cross-Lingual Semantic Parsing (Sherborne & Lapata, ACL 2022)☆17May 16, 2022Updated 3 years ago
- ☆14Nov 20, 2022Updated 3 years ago
- Implementation of fast algorithms for Maximum Spanning Tree (MST) parsing that includes fast ArcMax+Reweighting+Tarjan algorithm for sing…☆16Aug 9, 2023Updated 2 years ago
- ☆15Jul 14, 2022Updated 3 years ago