mlsanityData to 7 Oct 2026

A Pipeline For Discourse Circuits From CCG

arXiv 2311.17892 ↗First posted 29 Nov 2023cs.CL cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

There is a significant disconnect between linguistic theory and modern NLP practice, which relies heavily on inscrutable black-box architectures. DisCoCirc is a newly proposed model for meaning that aims to bridge this divide, by providing neuro-symbolic models that incorporate linguistic structure. DisCoCirc represents natural language text as a `circuit' that captures the core semantic information of the text. These circuits can then be interpreted as modular machine learning models. Additionally, DisCoCirc fulfils another major aim of providing an NLP model that can be implemented on near-term quantum computers. In this paper we describe a software pipeline that converts English text to its DisCoCirc representation. The pipeline achieves coverage over a large fragment of the English language. It relies on Combinatory Categorial Grammar (CCG) parses of the input text as well as coreference resolution information. This semantic and syntactic information is used in several steps to convert the text into a simply-typed λ-calculus term, and then into a circuit diagram. This pipeline will enable the application of the DisCoCirc framework to NLP tasks, using both classical and quantum approaches.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 63 references that are in the map. First posted on arXiv 29 Nov 2023.

Builds on

29 of 63 references.

References · 29

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  4. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  5. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,579
  6. 2022LaMDA: Language Models for Dialog Applicationscited by 1,218
  7. 2023Faith and Fate: Limits of Transformers on Compositionalitycited by 496
  8. 2023Is ChatGPT a General-Purpose Natural Language Processing Task Solver?cited by 486
  9. 2023The Reversal Curse: LLMs trained on "A is B" fail to learn "B is A"cited by 399
  10. 2019The Neuro-Symbolic Concept Learner: Interpreting Scenes, Words, and Sentences From Natural Supervisioncited by 369
  11. 2023Inverse Scaling: When Bigger Isn't Bettercited by 205
  12. 2017Neural-Symbolic Learning and Reasoning: A Survey and Interpretationcited by 195
17 more
  1. 2020Compositional Generalization via Neural-Symbolic Stack Machinescited by 80
  2. 2023ChatGPT is a Knowledgeable but Inexperienced Solver: An Investigation of Commonsense Problem in Large Language Modelscited by 63
  3. 2021lambeq: An Efficient High-Level Python Library for Quantum NLPcited by 43
  4. 2017The Parallel Meaning Bank: Towards a Multilingual Corpus of Translations Annotated with Compositional Meaning Representationscited by 41
  5. 2014The Frobenius anatomy of word meanings I: subject and object relative pronounscited by 24
  6. 2016Quantum Algorithms for Compositional Natural Language Processingcited by 24
  7. 2019The Mathematics of Text Structurecited by 24
  8. 2020Grammar-aware sentence classification on quantum computerscited by 16
  9. 2023Humans in Humans Out: On GPT Converging Toward Common Sense in both Success and Failurecited by 10
  10. 2021Conversational Negation using Worldly Context in Compositional Distributional Semanticscited by 9
  11. 2019Just Add Functions: A Neural-Symbolic Language Modelcited by 8
  12. 2021Grammar Equationscited by 7
  13. 2021Composing Conversational Negationcited by 7
  14. 2023Distilling Text into Circuitscited by 7
  15. 2021Something Old, Something New: Grammar-based CCG Parsing with Transformer Modelscited by 6
  16. 2022Language-independence of DisCoCirc's Text Circuits: English and Urducited by 5
  17. 2021Talking Space: inference from spatial linguistic meaningscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.