---
title: "Transforming Dependency Structures to Logical Forms for"
description: "Reddy and colleagues propose DepLambda, a lambda-calculus framework that turns a dependency… 65 references, cited by 53 papers here."
authors: ["Siva Reddy", "Oscar Täckström", "Michael Collins", "Tom Kwiatkowski", "Dipanjan Das", "Mark Steedman", "Mirella Lapata"]
year: 2016
venue: "Transactions of the Association for Computational Linguistics"
source: "https://aclanthology.org/Q16-1010/"
doi: "10.1162/tacl_a_00088"
licence: "CC BY 4.0 (ACL Anthology)"
licence_url: "https://creativecommons.org/licenses/by/4.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/reddy-2016-transforming-dependency-structures-logical-forms/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/reddy-2016-transforming-dependency-structures-logical-forms/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2016](https://md.research.elamur.ai/free/en/papers/2016/page/3/) / Transforming Dependency Structures to Logical Forms for Semantic Parsing

# Transforming Dependency Structures to Logical Forms for Semantic Parsing

**Authors:** [Siva Reddy](https://md.research.elamur.ai/free/en/authors/siva-reddy/), [Oscar Täckström](https://md.research.elamur.ai/free/en/authors/oscar-tackstrom/), [Michael Collins](https://md.research.elamur.ai/free/en/authors/michael-collins/), [Tom Kwiatkowski](https://md.research.elamur.ai/free/en/authors/tom-kwiatkowski/), [Dipanjan Das](https://md.research.elamur.ai/free/en/authors/dipanjan-das/), [Mark Steedman](https://md.research.elamur.ai/free/en/authors/mark-steedman/) and [Mirella Lapata](https://md.research.elamur.ai/free/en/authors/mirella-lapata/) · **Year:** 2016 · **Venue:** [Transactions of the Association for Computational Linguistics](https://md.research.elamur.ai/free/en/venues/tacl/) ([Transactions of the Association for Computational Linguistics (TACL) 2016](https://md.research.elamur.ai/free/en/venues/tacl/2016/)) · **Publisher:** [The MIT Press](https://md.research.elamur.ai/free/en/publishers/the-mit-press/) · **Licence:** [CC BY 4.0 (ACL Anthology)](https://creativecommons.org/licenses/by/4.0/)

**Links:** [Publisher's page](https://aclanthology.org/Q16-1010/) · [PDF](https://aclanthology.org/Q16-1010.pdf) · [DOI 10.1162/tacl\_a\_00088](https://doi.org/10.1162/tacl_a_00088) · [OpenAlex](https://openalex.org/W2302963717)

**Citations:** 153 citations (OpenAlex, 2026-10-14) · [53](https://md.research.elamur.ai/free/en/papers/reddy-2016-transforming-dependency-structures-logical-forms/cited-by/) in our library, of the 149,439 papers whose bibliographies we read

## Summary
Dependency parsers are fast, accurate and available for many languages. However, dependency trees have no type system, so there has been no principled way to derive logical forms from them, unlike grammar formalisms such as CCG, HPSG or LFG. Reddy and colleagues propose DepLambda, a lambda-calculus framework that turns a dependency tree into a neo-Davidsonian logical form in three stages:

- the tree is binarized into an s-expression, ordering modifiers by an obliqueness hierarchy;
- every word and dependency label is replaced by a lambda term;
- beta-reduction composes these terms.

The key design choice is giving all constituents one shared type. This removes type checking and makes the procedure tolerant of parse errors. Special lexical entries and post-processing cover prepositions, coordination, relative clauses, control and wh-questions. GraphParser then grounds the resulting ungrounded forms as Freebase queries. On Free917 the method reaches the best published result at the time, and on WebQuestions it is competitive. It beats both raw dependency trees and a comparable CCG-based pipeline, showing that dependency syntax can support formal semantic parsing.

## Key points
- Every constituent, whether a word or an s-expression, has the single type Ind × Event → Bool, built from three base types: individuals, events and truth values. Spurious unused variables are simply discarded.
- Most dependency labels (e.g., nsubj → arg1, dobj → arg2) yield forms that mirror the dependency structure. Exceptions such as partmod reverse the direction for reduced relatives, and prep/pobj chains collapse into predicates like prep.in.
- Grounding to Freebase uses GraphParser, trained from question–answer pairs. Evaluation uses the Free917 and WebQuestions datasets.
- DepLambda is more robust than the CCG-based baseline (CCGGraph) on ungrammatical questions. On the WebQuestions development set, it fails to produce ungrounded graphs for only 0.9% of questions, versus 4.5% for CCGGraph.
- The paper appeared in TACL, vol. 4 (2016), pp. 127–140. It is joint work by the University of Edinburgh and Google.

*Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.*

## Institutions

- [Google](https://md.research.elamur.ai/free/en/companies/google/) — Company, Mountain View, United States · 492 works · 440,463 citations
- [University of Edinburgh](https://md.research.elamur.ai/free/en/universities/university-of-edinburgh/) — University, Edinburgh, United Kingdom · 381 works · 80,747 citations

📚 Shelves (4): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 18,614 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 17,965 works · [🎭 Arts and Humanities](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · 17,450 works · [🗣️ Language and Linguistics](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · 17,296 works

🧭 Topics (2): [📐 Syntax & grammar formalisms](https://md.research.elamur.ai/free/en/topics/syntax-grammar/) · 221 works · [🧾 Semantic parsing & meaning representation](https://md.research.elamur.ai/free/en/topics/semantic-parsing/) · 193 works

## Cite

Cite as: Siva Reddy, Oscar Täckström, Michael Collins, Tom Kwiatkowski, Dipanjan Das, Mark Steedman and Mirella Lapata. 2016. Transforming Dependency Structures to Logical Forms for Semantic Parsing. Transactions of the Association for Computational Linguistics.

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@article{reddy2016transforming,
  title = {{Transforming Dependency Structures to Logical Forms for Semantic Parsing}},
  author = {Siva Reddy, Oscar Täckström, Michael Collins, Tom Kwiatkowski, Dipanjan Das, Mark Steedman and Mirella Lapata},
  journal = {Transactions of the Association for Computational Linguistics},
  year = {2016},
  doi = {10.1162/tacl\_a\_00088},
  url = {https://doi.org/10.1162/tacl_a_00088}
}
```

- [← previous A Bayesian Model of Diachronic Meaning Change](https://md.research.elamur.ai/free/en/papers/frermann-2016-bayesian-model-diachronic-meaning-change/)
- [next → Efficient softmax approximation for GPUs](https://md.research.elamur.ai/free/en/papers/grave-2016-efficient-softmax-approximation-gpus/)
- [↑ back to papers of 2016](https://md.research.elamur.ai/free/en/papers/2016/page/3/)

## References

65 references, 22 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Jacob Andreas and Dan Klein. 2015. Alignment-Based Compositional Semantics for Instruction Following. In Proceedings of Empirical Methods on Natural Language Processing, pages 1165–1174. [find](https://scholar.google.com/scholar?q=Jacob+Andreas+and+Dan+Klein%2E+2015%2E+Alignment%2DBased+Compositional+Semantics+for+Instruction+Following%2E+In+Proceedings+of+Empirical+Methods+on+Natural+Language+Processing%2C+pages+1165%E2%80%931174%2E)
2. Yoav Artzi, Kenton Lee, and Luke Zettlemoyer. 2015. [Broad-coverage CCG Semantic Parsing with AMR](https://md.research.elamur.ai/free/en/papers/artzi-2015-broad-coverage-ccg-semantic-parsing/). In Proceedings of Empirical Methods on Natural Language Processing, pages 1699–1710.
3. Jason Baldridge and Geert-Jan Kruijff. 2002. Coupling CCG and Hybrid Logic Dependency Semantics. In Proceedings of Association for Computational Linguistics, pages 319–326. [find](https://scholar.google.com/scholar?q=Jason+Baldridge+and+Geert%2DJan+Kruijff%2E+2002%2E+Coupling+CCG+and+Hybrid+Logic+Dependency+Semantics%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+319%E2%80%93326%2E)
4. Junwei Bao, Nan Duan, Ming Zhou, and Tiejun Zhao. 2014. Knowledge-Based Question Answering as Machine Translation. In Proceedings of Association for Computational Linguistics, pages 967–976. [find](https://scholar.google.com/scholar?q=Junwei+Bao%2C+Nan+Duan%2C+Ming+Zhou%2C+and+Tiejun+Zhao%2E+2014%2E+Knowledge%2DBased+Question+Answering+as+Machine+Translation%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+967%E2%80%93976%2E)
5. Hannah Bast and Elmar Haussmann. 2015. More Accurate Question Answering on Freebase. In Proceedings of ACM International Conference on Information and Knowledge Management, pages 1431–1440. Paul Bédaride and Claire Gardent. 2011. Deep Semantics for Dependency Structures. In Proceedings of Conferenc… [find](https://scholar.google.com/scholar?q=Hannah+Bast+and+Elmar+Haussmann%2E+2015%2E+More+Accurate+Question+Answering+on+Freebase%2E+In+Proceedings+of+ACM+International+Conference+on+Information+and+Knowledge+Management%2C+pages+1431%E2%80%931440%2E+Paul+Be%CC%81da)
6. Jonathan Berant and Percy Liang. 2014. [Semantic Parsing via Paraphrasing](https://md.research.elamur.ai/free/en/papers/berant-2014-semantic-parsing-paraphrasing/). In Proceedings of Association for Computational Linguistics, pages 1415–1425.
7. Jonathan Berant and Percy Liang. 2015. [Imitation Learning of Agenda-Based Semantic Parsers](https://md.research.elamur.ai/free/en/papers/berant-2015-imitation-learning-agenda-based-semantic/). Transactions of the Association for Computational Linguistics, 3:545–558.
8. Jonathan Berant, Andrew Chou, Roy Frostig, and Percy Liang. 2013. [Semantic Parsing on Freebase from Question-Answer Pairs](https://md.research.elamur.ai/free/en/papers/berant-2013-semantic-parsing-freebase-question-answer/). In Proceedings of Empirical Methods on Natural Language Processing, pages 1533– 1544.
9. Antoine Bordes, Sumit Chopra, and Jason Weston. 2014. Question Answering with Subgraph Embeddings. In Proceedings of Empirical Methods on Natural Language Processing, pages 615–620. [find](https://scholar.google.com/scholar?q=Antoine+Bordes%2C+Sumit+Chopra%2C+and+Jason+Weston%2E+2014%2E+Question+Answering+with+Subgraph+Embeddings%2E+In+Proceedings+of+Empirical+Methods+on+Natural+Language+Processing%2C+pages+615%E2%80%93620%2E)
10. Johan Bos, Stephen Clark, Mark Steedman, James R. Curran, and Julia Hockenmaier. 2004. Wide-Coverage Semantic Representations from a CCG Parser. In Proceedings of International Conference on Computational Linguistics, pages 1240–1246. [find](https://scholar.google.com/scholar?q=Johan+Bos%2C+Stephen+Clark%2C+Mark+Steedman%2C+James+R%2E+Curran%2C+and+Julia+Hockenmaier%2E+2004%2E+Wide%2DCoverage+Semantic+Representations+from+a+CCG+Parser%2E+In+Proceedings+of+International+Conference+on+Computati)
11. Qingqing Cai and Alexander Yates. 2013. Large-scale Semantic Parsing via Schema Matching and Lexicon Extension. In Proceedings of Association for Computational Linguistics, pages 423–433. [find](https://scholar.google.com/scholar?q=Qingqing+Cai+and+Alexander+Yates%2E+2013%2E+Large%2Dscale+Semantic+Parsing+via+Schema+Matching+and+Lexicon+Extension%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+423%E2%80%93433%2E)
12. Type-Logical Semantics. MIT Press, Cambridge, MA, USA. David L. Chen and Raymond J. Mooney. 2011. Learning to Interpret Natural Language Navigation Instructions from Observations. In Proceedings of Association for the Advancement of Artificial Intelligence, pages 1–2. [find](https://scholar.google.com/scholar?q=Type%2DLogical+Semantics%2E+MIT+Press%2C+Cambridge%2C+MA%2C+USA%2E+David+L%2E+Chen+and+Raymond+J%2E+Mooney%2E+2011%2E+Learning+to+Interpret+Natural+Language+Navigation+Instructions+from+Observations%2E+In+Proceedings+of+As)
13. Eunsol Choi, Tom Kwiatkowski, and Luke Zettlemoyer. 2015. Scalable Semantic Parsing with Partial Ontologies. In Proceedings of Association for Computational Linguistics, pages 1311–1320. [find](https://scholar.google.com/scholar?q=Eunsol+Choi%2C+Tom+Kwiatkowski%2C+and+Luke+Zettlemoyer%2E+2015%2E+Scalable+Semantic+Parsing+with+Partial+Ontologies%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+1311%E2%80%931320%2E)
14. Philipp Cimiano. 2009. Flexible Semantic Composition with DUDES. In Proceedings of International Conference on Computational Semantics, pages 272–276. [find](https://scholar.google.com/scholar?q=Philipp+Cimiano%2E+2009%2E+Flexible+Semantic+Composition+with+DUDES%2E+In+Proceedings+of+International+Conference+on+Computational+Semantics%2C+pages+272%E2%80%93276%2E)
15. Michael Collins. 2002. [Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms](https://md.research.elamur.ai/free/en/papers/collins-2002-discriminative-training-methods-hidden-markov/). In Proceedings of Empirical Methods on Natural Language Processing, pages 1–8.
16. Ann Copestake, Alex Lascarides, and Dan Flickinger. 2001. [An Algebra for Semantic Construction in Constraint-based Grammars](https://md.research.elamur.ai/free/en/papers/copestake-2001-algebra-semantic-construction-constraint-based/). In Proceedings of Association for Computational Linguistics, pages 140–147.
17. Ann Copestake, Dan Flickinger, Carl Pollard, and Ivan A. Sag. 2005. Minimal Recursion Semantics: An Introduction. Research on Language and Computation, 3(2-3):281–332. [find](https://scholar.google.com/scholar?q=Ann+Copestake%2C+Dan+Flickinger%2C+Carl+Pollard%2C+and+Ivan+A%2E+Sag%2E+2005%2E+Minimal+Recursion+Semantics%3A+An+Introduction%2E+Research+on+Language+and+Computation%2C+3%282%2D3%29%3A281%E2%80%93332%2E)
18. Mary Dalrymple, John Lamping, Fernando C. N. Pereira, and Vijay A. Saraswat. 1995. Linear Logic for Meaning Assembly. In Proceedings of Computational Logic for Natural Language Processing. [find](https://scholar.google.com/scholar?q=Mary+Dalrymple%2C+John+Lamping%2C+Fernando+C%2E+N%2E+Pereira%2C+and+Vijay+A%2E+Saraswat%2E+1995%2E+Linear+Logic+for+Meaning+Assembly%2E+In+Proceedings+of+Computational+Logic+for+Natural+Language+Processing%2E)
19. Marie-Catherine De Marneffe and Christopher D Manning. 2008. Stanford typed dependencies manual. Technical report, Stanford University. [find](https://scholar.google.com/scholar?q=Marie%2DCatherine+De+Marneffe+and+Christopher+D+Manning%2E+2008%2E+Stanford+typed+dependencies+manual%2E+Technical+report%2C+Stanford+University%2E)
20. Ralph Debusmann, Denys Duchier, Alexander Koller, Marco Kuhlmann, Gert Smolka, and Stefan Thater. 2004. A Relational Syntax-Semantics Interface Based on Dependency Grammar. In Proceedings of International Conference on Computational Linguistics, pages 176–182. [find](https://scholar.google.com/scholar?q=Ralph+Debusmann%2C+Denys+Duchier%2C+Alexander+Koller%2C+Marco+Kuhlmann%2C+Gert+Smolka%2C+and+Stefan+Thater%2E+2004%2E+A+Relational+Syntax%2DSemantics+Interface+Based+on+Dependency+Grammar%2E+In+Proceedings+of+Internati)
21. Li Dong, Furu Wei, Ming Zhou, and Ke Xu. 2015. Question Answering over Freebase with Multi-Column Convolutional Neural Networks. In Proceedings of Association for Computational Linguistics, pages 260–269. [find](https://scholar.google.com/scholar?q=Li+Dong%2C+Furu+Wei%2C+Ming+Zhou%2C+and+Ke+Xu%2E+2015%2E+Question+Answering+over+Freebase+with+Multi%2DColumn+Convolutional+Neural+Networks%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+260%E2%80%93)
22. Jeffrey Flanigan, Sam Thomson, Jaime Carbonell, Chris Dyer, and Noah A. Smith. 2014. [A Discriminative Graph-Based Parser for the Abstract Meaning Representation](https://md.research.elamur.ai/free/en/papers/flanigan-2014-discriminative-graph-based-parser-abstract/). In Proceedings of Association for Computational Linguistics, pages 1426–1436.
23. Yoav Freund and Robert E. Schapire. 1999. Large Margin Classification Using the Perceptron Algorithm. Machine Learning, 37(3):277–296, December. [find](https://scholar.google.com/scholar?q=Yoav+Freund+and+Robert+E%2E+Schapire%2E+1999%2E+Large+Margin+Classification+Using+the+Perceptron+Algorithm%2E+Machine+Learning%2C+37%283%29%3A277%E2%80%93296%2C+December%2E)
24. Claire Gardent and Laura Kallmeyer. 2003. Semantic Construction in Feature-based TAG. In Proceedings of European Chapter of the Association for Computational Linguistics, pages 123–130. [find](https://scholar.google.com/scholar?q=Claire+Gardent+and+Laura+Kallmeyer%2E+2003%2E+Semantic+Construction+in+Feature%2Dbased+TAG%2E+In+Proceedings+of+European+Chapter+of+the+Association+for+Computational+Linguistics%2C+pages+123%E2%80%93130%2E)
25. Ruifang Ge and Raymond Mooney. 2009. Learning a Compositional Semantic Parser using an Existing Syntactic Parser. In Proceedings of Association for Computational Linguistics, pages 611–619. [find](https://scholar.google.com/scholar?q=Ruifang+Ge+and+Raymond+Mooney%2E+2009%2E+Learning+a+Compositional+Semantic+Parser+using+an+Existing+Syntactic+Parser%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+611%E2%80%93619%2E)
26. Jonas Groschwitz, Alexander Koller, and Christoph Teichmann. 2015. Graph parsing with s-graph grammars. In Proceedings of Association for Computational Linguistics, pages 1481–1490. [find](https://scholar.google.com/scholar?q=Jonas+Groschwitz%2C+Alexander+Koller%2C+and+Christoph+Teichmann%2E+2015%2E+Graph+parsing+with+s%2Dgraph+grammars%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+1481%E2%80%931490%2E)
27. Michael Heilman and Noah A. Smith. 2010. [Tree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions](https://md.research.elamur.ai/free/en/papers/heilman-2010-tree-edit-models-recognizing-textual/). In Proceedings of North American Chapter of the Association for Computational Linguistics, pages 1011–1019.
28. Aravind K. Joshi, Laura Kallmeyer, and Maribel Romero. 2007. Flexible Composition In LTAG: Quantifier Scope and Inverse Linking. In Harry Bunt and Reinhard Muskens, editors, Computing Meaning, volume 83 of Studies in Linguistics and Philosophy, pages 233–256. [find](https://scholar.google.com/scholar?q=Aravind+K%2E+Joshi%2C+Laura+Kallmeyer%2C+and+Maribel+Romero%2E+2007%2E+Flexible+Composition+In+LTAG%3A+Quantifier+Scope+and+Inverse+Linking%2E+In+Harry+Bunt+and+Reinhard+Muskens%2C+editors%2C+Computing+Meaning%2C+volume+)
29. Springer Netherlands. Jayant Krishnamurthy and Tom Mitchell. 2012. [Weakly Supervised Training of Semantic Parsers](https://md.research.elamur.ai/free/en/papers/krishnamurthy-2012-weakly-supervised-training-semantic-parsers/). In Proceedings of Empirical Methods on Natural Language Processing, pages 754–765.
30. Jayant Krishnamurthy and Tom M. Mitchell. 2015. [Learning a Compositional Semantics for Freebase with an Open Predicate Vocabulary](https://md.research.elamur.ai/free/en/papers/krishnamurthy-2015-learning-compositional-semantics-freebase-open/). Transactions of the Association for Computational Linguistics, 3:257–270.
31. Tom Kwiatkowksi, Luke Zettlemoyer, Sharon Goldwater, and Mark Steedman. 2010. Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification. In Proceedings of Empirical Methods on Natural Language Processing, pages 1223–1233. [find](https://scholar.google.com/scholar?q=Tom+Kwiatkowksi%2C+Luke+Zettlemoyer%2C+Sharon+Goldwater%2C+and+Mark+Steedman%2E+2010%2E+Inducing+Probabilistic+CCG+Grammars+from+Logical+Form+with+Higher%2DOrder+Unification%2E+In+Proceedings+of+Empirical+Methods+o)
32. Tom Kwiatkowski, Eunsol Choi, Yoav Artzi, and Luke Zettlemoyer. 2013. [Scaling Semantic Parsers with On-the-Fly Ontology Matching](https://md.research.elamur.ai/free/en/papers/kwiatkowski-2013-scaling-semantic-parsers-fly-ontology/). In Proceedings of Empirical Methods on Natural Language Processing, pages 1545–1556.
33. John Lafferty, Andrew McCallum, and Fernando Pereira. 2001. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data. In Proceedings of International Conference on Machine Learning, pages 282–289. [find](https://scholar.google.com/scholar?q=John+Lafferty%2C+Andrew+McCallum%2C+and+Fernando+Pereira%2E+2001%2E+Conditional+Random+Fields%3A+Probabilistic+Models+for+Segmenting+and+Labeling+Sequence+Data%2E+In+Proceedings+of+International+Conference+on+Mac)
34. Mike Lewis and Mark Steedman. 2014. [A* CCG Parsing with a Supertag-factored Model](https://md.research.elamur.ai/free/en/papers/lewis-2014-ccg-parsing-supertag-factored-model/). In Proceedings of Empirical Methods on Natural Language Processing, pages 990–1000.
35. Percy Liang, Michael Jordan, and Dan Klein. 2011. Learning Dependency-Based Compositional Semantics. In Proceedings of Association for Computational Linguistics, pages 590–599. [find](https://scholar.google.com/scholar?q=Percy+Liang%2C+Michael+Jordan%2C+and+Dan+Klein%2E+2011%2E+Learning+Dependency%2DBased+Compositional+Semantics%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+590%E2%80%93599%2E)
36. Fei Liu, Jeffrey Flanigan, Sam Thomson, Norman Sadeh, and Noah A. Smith. 2015. [Toward Abstractive Summarization Using Semantic Representations](https://md.research.elamur.ai/free/en/papers/liu-2015-abstractive-summarization-semantic-representations/). In Proceedings of North American Chapter of the Association for Computational Linguistics, pages 1077–1086.
37. Christopher D. Manning, Mihai Surdeanu, John Bauer, Jenny Finkel, Steven J. Bethard, and David McClosky. 2014. [The Stanford CoreNLP Natural Language Processing Toolkit](https://md.research.elamur.ai/free/en/papers/manning-2014-stanford-corenlp-natural-language-processing/). In Proceedings of Association for Computational Linguistics, pages 55–60.
38. Andre Martins, Miguel Almeida, and Noah A. Smith. 2013. [Turning on the Turbo: Fast Third-Order Non-Projective Turbo Parsers](https://md.research.elamur.ai/free/en/papers/martins-2013-turning-turbo-fast-third-order/). In Proceedings of Association for Computational Linguistics, pages 617–622.
39. Cynthia Matuszek, Nicholas FitzGerald, Luke Zettlemoyer, Liefeng Bo, and Dieter Fox. 2012. A Joint Model of Language and Perception for Grounded Attribute Learning. In Proceedings of International Conference on Machine Learning. Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005. N… [find](https://scholar.google.com/scholar?q=Cynthia+Matuszek%2C+Nicholas+FitzGerald%2C+Luke+Zettlemoyer%2C+Liefeng+Bo%2C+and+Dieter+Fox%2E+2012%2E+A+Joint+Model+of+Language+and+Perception+for+Grounded+Attribute+Learning%2E+In+Proceedings+of+International+Con)
40. Richard Montague. 1973. The Proper Treatment of Quantification in Ordinary English. In K.J.J. Hintikka, J.M.E. Moravcsik, and P. Suppes, editors, Approaches to Natural Language, volume 49 of Synthese Library, pages 221–242. [find](https://scholar.google.com/scholar?q=Richard+Montague%2E+1973%2E+The+Proper+Treatment+of+Quantification+in+Ordinary+English%2E+In+K%2EJ%2EJ%2E+Hintikka%2C+J%2EM%2EE%2E+Moravcsik%2C+and+P%2E+Suppes%2C+editors%2C+Approaches+to+Natural+Language%2C+volume+49+of+Synthese+)
41. Springer Netherlands. Michael Moortgat. 1988. Categorical Investigations. Logical and Linguistic Aspects of the Lambek Calculus. [find](https://scholar.google.com/scholar?q=Springer+Netherlands%2E+Michael+Moortgat%2E+1988%2E+Categorical+Investigations%2E+Logical+and+Linguistic+Aspects+of+the+Lambek+Calculus%2E)
42. Foris, Dordrecht. Michael Moortgat. 1991. Generalized Quantification and Discontinuous Type Constructors. Technical report, University of Utrecht. [find](https://scholar.google.com/scholar?q=Foris%2C+Dordrecht%2E+Michael+Moortgat%2E+1991%2E+Generalized+Quantification+and+Discontinuous+Type+Constructors%2E+Technical+report%2C+University+of+Utrecht%2E)
43. Shashi Narayan and Claire Gardent. 2014. [Hybrid Simplification using Deep Semantics and Machine Translation](https://md.research.elamur.ai/free/en/papers/narayan-2014-hybrid-simplification-deep-semantics-machine/). In Proceedings of Association for Computational Linguistics, pages 435–445. Joakim Nivre, Johan Hall, Jens Nilsson, Atanas Chanev, Gülsen Eryigit, Sandra Kübler, Svetoslav Marinov, and Erwi…
44. Ankur P. Parikh, Hoifung Poon, and Kristina Toutanova. 2015. Grounded Semantic Parsing for Complex Knowledge Extraction. In Proceedings of North American Chapter of the Association for Computational Linguistics, pages 756–766. [find](https://scholar.google.com/scholar?q=Ankur+P%2E+Parikh%2C+Hoifung+Poon%2C+and+Kristina+Toutanova%2E+2015%2E+Grounded+Semantic+Parsing+for+Complex+Knowledge+Extraction%2E+In+Proceedings+of+North+American+Chapter+of+the+Association+for+Computational+L)
45. Ellie Pavlick, Johan Bos, Malvina Nissim, Charley Beller, Benjamin Van Durme, and Chris Callison-Burch. 2015. Adding Semantics to Data-Driven Paraphrasing. In Proceedings of Association for Computational Linguistics, pages 1512–1522. [find](https://scholar.google.com/scholar?q=Ellie+Pavlick%2C+Johan+Bos%2C+Malvina+Nissim%2C+Charley+Beller%2C+Benjamin+Van+Durme%2C+and+Chris+Callison%2DBurch%2E+2015%2E+Adding+Semantics+to+Data%2DDriven+Paraphrasing%2E+In+Proceedings+of+Association+for+Computatio)
46. Fernando C. N. Pereira. 1990. Categorial Semantics and Scoping. Computational Linguistics, 16(1):1–10. [find](https://scholar.google.com/scholar?q=Fernando+C%2E+N%2E+Pereira%2E+1990%2E+Categorial+Semantics+and+Scoping%2E+Computational+Linguistics%2C+16%281%29%3A1%E2%80%9310%2E)
47. Carl Pollard and Ivan A. Sag. 1994. Head-Driven Phrase Structure Grammar. University of Chicago Press. [find](https://scholar.google.com/scholar?q=Carl+Pollard+and+Ivan+A%2E+Sag%2E+1994%2E+Head%2DDriven+Phrase+Structure+Grammar%2E+University+of+Chicago+Press%2E)
48. Hoifung Poon. 2013. Grounded Unsupervised Semantic Parsing. In Proceedings of Association for Computational Linguistics, pages 933–943. [find](https://scholar.google.com/scholar?q=Hoifung+Poon%2E+2013%2E+Grounded+Unsupervised+Semantic+Parsing%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+933%E2%80%93943%2E)
49. Vasin Punyakanok, Dan Roth, and Wen-tau Yih. 2004. Mapping Dependencies Trees: An Application to Question Answering. In Proceedings of International Symposium on Artificial Intelligence and Mathematics, pages 1–10. [find](https://scholar.google.com/scholar?q=Vasin+Punyakanok%2C+Dan+Roth%2C+and+Wen%2Dtau+Yih%2E+2004%2E+Mapping+Dependencies+Trees%3A+An+Application+to+Question+Answering%2E+In+Proceedings+of+International+Symposium+on+Artificial+Intelligence+and+Mathematic)
50. Siva Reddy, Mirella Lapata, and Mark Steedman. 2014. Large-scale Semantic Parsing without Question-Answer Pairs. Transactions of the Association for Computational Linguistics, 2:377–392. Tim Rocktäschel, Sameer Singh, and Sebastian Riedel. 2015. Injecting Logical Background Knowledge into Embedding… [find](https://scholar.google.com/scholar?q=Siva+Reddy%2C+Mirella+Lapata%2C+and+Mark+Steedman%2E+2014%2E+Large%2Dscale+Semantic+Parsing+without+Question%2DAnswer+Pairs%2E+Transactions+of+the+Association+for+Computational+Linguistics%2C+2%3A377%E2%80%93392%2E+Tim+Rockta%CC%88sc)
51. Gabriel Stanovsky, Jessica Ficler, Ido Dagan, and Yoav Goldberg. 2016. Getting More Out Of Syntax with PropS. ArXiv e-prints, March. [find](https://scholar.google.com/scholar?q=Gabriel+Stanovsky%2C+Jessica+Ficler%2C+Ido+Dagan%2C+and+Yoav+Goldberg%2E+2016%2E+Getting+More+Out+Of+Syntax+with+PropS%2E+ArXiv+e%2Dprints%2C+March%2E)
52. Mark Steedman. 2012. Taking Scope - The Natural Semantics of Quantifiers. [find](https://scholar.google.com/scholar?q=Mark+Steedman%2E+2012%2E+Taking+Scope+%2D+The+Natural+Semantics+of+Quantifiers%2E)
53. MIT Press. Chuan Wang, Nianwen Xue, and Sameer Pradhan. 2015. [A Transition-based Algorithm for AMR Parsing](https://md.research.elamur.ai/free/en/papers/wang-2015-transition-based-algorithm-amr-parsing/). In Proceedings of North American Chapter of the Association for Computational Linguistics, pages 366–375.
54. Ralph Weischedel, Eduard Hovy, Martha Palmer, Mitch Marcus, Robert Belvin, Sameer Pradhan, Lance Ramshaw, and Nianwen Xue. 2011. OntoNotes: A Large Training Corpus for Enhanced Processing. In J. Olive, C. Christianson, and J. McCary, editors, Handbook of Natural Language Processing and Machine Trans… [find](https://scholar.google.com/scholar?q=Ralph+Weischedel%2C+Eduard+Hovy%2C+Martha+Palmer%2C+Mitch+Marcus%2C+Robert+Belvin%2C+Sameer+Pradhan%2C+Lance+Ramshaw%2C+and+Nianwen+Xue%2E+2011%2E+OntoNotes%3A+A+Large+Training+Corpus+for+Enhanced+Processing%2E+In+J%2E+Olive)
55. Springer. Yuk Wah Wong and Raymond J. Mooney. 2006. [Learning for Semantic Parsing with Statistical Machine Translation](https://md.research.elamur.ai/free/en/papers/wong-2006-learning-semantic-parsing-statistical-machine/). In Proceedings of North American Chapter of the Association for Computational Linguistics, pages 439–446.
56. Yuk Wah Wong and Raymond Mooney. 2007. [Learning Synchronous Grammars for Semantic Parsing with Lambda Calculus](https://md.research.elamur.ai/free/en/papers/wong-2007-learning-synchronous-grammars-semantic-parsing/). In Proceedings of Association for Computational Linguistics, pages 960–967.
57. Kun Xu, Yansong Feng, Songfang Huang, and Dongyan Zhao. 2015. Question Answering via Phrasal Semantic Parsing. In Proceedings of Conference and Labs of the Evaluation Forum, pages 414–426. [find](https://scholar.google.com/scholar?q=Kun+Xu%2C+Yansong+Feng%2C+Songfang+Huang%2C+and+Dongyan+Zhao%2E+2015%2E+Question+Answering+via+Phrasal+Semantic+Parsing%2E+In+Proceedings+of+Conference+and+Labs+of+the+Evaluation+Forum%2C+pages+414%E2%80%93426%2E)
58. Yi Yang and Ming-Wei Chang. 2015. S-MART: Novel Tree-based Structured Learning Algorithms Applied to Tweet Entity Linking. In Proceedings of Association for Computational Linguistics, pages 504–513. [find](https://scholar.google.com/scholar?q=Yi+Yang+and+Ming%2DWei+Chang%2E+2015%2E+S%2DMART%3A+Novel+Tree%2Dbased+Structured+Learning+Algorithms+Applied+to+Tweet+Entity+Linking%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+504%E2%80%93513%2E)
59. Xuchen Yao and Benjamin Van Durme. 2014. Information Extraction over Structured Data: Question Answering with Freebase. In Proceedings of Association for Computational Linguistics, pages 956–966. [find](https://scholar.google.com/scholar?q=Xuchen+Yao+and+Benjamin+Van+Durme%2E+2014%2E+Information+Extraction+over+Structured+Data%3A+Question+Answering+with+Freebase%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+956%E2%80%93966%2E)
60. Xuchen Yao, Benjamin Van Durme, Chris Callison-Burch, and Peter Clark. 2013. Answer Extraction as Sequence Tagging with Tree Edit Distance. In Proceedings of North American Chapter of the Association for Computational Linguistics, pages 858–867. [find](https://scholar.google.com/scholar?q=Xuchen+Yao%2C+Benjamin+Van+Durme%2C+Chris+Callison%2DBurch%2C+and+Peter+Clark%2E+2013%2E+Answer+Extraction+as+Sequence+Tagging+with+Tree+Edit+Distance%2E+In+Proceedings+of+North+American+Chapter+of+the+Association+)
61. Xuchen Yao. 2015. Lean Question Answering over Freebase from Scratch. In Proceedings of North American Chapter of the Association for Computational Linguistics, pages 66–70. [find](https://scholar.google.com/scholar?q=Xuchen+Yao%2E+2015%2E+Lean+Question+Answering+over+Freebase+from+Scratch%2E+In+Proceedings+of+North+American+Chapter+of+the+Association+for+Computational+Linguistics%2C+pages+66%E2%80%9370%2E)
62. Wen-tau Yih, Ming-Wei Chang, Xiaodong He, and Jianfeng Gao. 2015. [Semantic Parsing via Staged Query Graph Generation: Question Answering with Knowledge Base](https://md.research.elamur.ai/free/en/papers/yih-2015-semantic-parsing-staged-query-graph/). In Proceedings of Association for Computational Linguistics, pages 1321–1331.
63. John M. Zelle and Raymond J. Mooney. 1996. [Learning to Parse Database Queries Using Inductive Logic Programming](https://md.research.elamur.ai/free/en/papers/zelle-1996-learning-parse-database-queries-using/). In Proceedings of Association for the Advancement of Artificial Intelligence, pages 1050–1055.
64. Luke S. Zettlemoyer and Michael Collins. 2005. [Learning to Map Sentences to Logical Form: Structured Classification with Probabilistic Categorial Grammars](https://md.research.elamur.ai/free/en/papers/zettlemoyer-2012-learning-map-sentences-logical-form/). In Proceedings of Uncertainty in Artificial Intelligence, pages 658–666.
65. Hao Zhang and Ryan McDonald. 2014. Enforcing Structural Diversity in Cube-pruned Dependency Parsing. In Proceedings of Association for Computational Linguistics, pages 656–661. [find](https://scholar.google.com/scholar?q=Hao+Zhang+and+Ryan+McDonald%2E+2014%2E+Enforcing+Structural+Diversity+in+Cube%2Dpruned+Dependency+Parsing%2E+In+Proceedings+of+Association+for+Computational+Linguistics%2C+pages+656%E2%80%93661%2E)

*Updated 2 November 2026*