{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:09:25Z","timestamp":1778602165650,"version":"3.51.4"},"reference-count":7,"publisher":"MIT Press - Journals","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["TACL"],"published-print":{"date-parts":[[2016,12]]},"abstract":"<jats:p> The strongly typed syntax of grammar formalisms such as CCG, TAG, LFG and HPSG offers a synchronous framework for deriving syntactic structures and semantic logical forms. In contrast\u2014partly due to the lack of a strong type system\u2014dependency structures are easy to annotate and have become a widely used form of syntactic analysis for many languages. However, the lack of a type system makes a formal mechanism for deriving logical forms from dependency structures challenging. We address this by introducing a robust system based on the lambda calculus for deriving neo-Davidsonian logical forms from dependency trees. These logical forms are then used for semantic parsing of natural language to Freebase. Experiments on the Free917 and Web-Questions datasets show that our representation is superior to the original dependency trees and that it outperforms a CCG-based representation on this task. Compared to prior work, we obtain the strongest result to date on Free917 and competitive results on WebQuestions. <\/jats:p>","DOI":"10.1162\/tacl_a_00088","type":"journal-article","created":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T15:44:07Z","timestamp":1546011847000},"page":"127-140","source":"Crossref","is-referenced-by-count":58,"title":["Transforming Dependency Structures to Logical Forms for Semantic                     Parsing"],"prefix":"10.1162","volume":"4","author":[{"given":"Siva","family":"Reddy","sequence":"first","affiliation":[{"name":"ILCC, School of Informatics, University of Edinburgh,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"T\u00e4ckstr\u00f6m","sequence":"additional","affiliation":[{"name":"Google, New York,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Collins","sequence":"additional","affiliation":[{"name":"Google, New York,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Kwiatkowski","sequence":"additional","affiliation":[{"name":"Google, New York,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dipanjan","family":"Das","sequence":"additional","affiliation":[{"name":"Google, New York,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Steedman","sequence":"additional","affiliation":[{"name":"ILCC, School of Informatics, University of Edinburgh,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirella","family":"Lapata","sequence":"additional","affiliation":[{"name":"ILCC, School of Informatics, University of Edinburgh,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"281","reference":[{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00157"},{"issue":"2","key":"p_19","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s11168-006-6327-9","volume":"3","author":"Copestake Ann","year":"2005","journal-title":"Research on Language and Computation"},{"issue":"3","key":"p_25","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1007662407062","volume":"37","author":"Freund Yoav","year":"1999","journal-title":"Machine Learning"},{"key":"p_32","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00137"},{"issue":"2","key":"p_47","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1017\/S1351324906004505","volume":"13","author":"Nivre Joakim","year":"2007","journal-title":"Natural Language Engineering"},{"issue":"1","key":"p_50","first-page":"1","volume":"16","author":"Pereira Fernando C. N.","year":"1990","journal-title":"Computational Linguistics"},{"key":"p_54","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00190"}],"container-title":["Transactions of the Association for Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/tacl_a_00088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:38:21Z","timestamp":1615585101000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/tacl\/article\/43352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":7,"alternative-id":["10.1162\/tacl_a_00088"],"URL":"https:\/\/doi.org\/10.1162\/tacl_a_00088","relation":{},"ISSN":["2307-387X"],"issn-type":[{"value":"2307-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12]]}}}