{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/textual-entailment-with-structured-attentions","title":"Textual Entailment with Structured Attentions and Composition","arxiv_id":"1701.01126","date":"2017-01-04","proceeding":"COLING 2016 12","authors":["Kai Zhao","Liang Huang","Mingbo Ma"],"abstract":"Deep learning techniques are increasingly popular in the textual entailment\ntask, overcoming the fragility of traditional discrete models with hard\nalignments and logics. In particular, the recently proposed attention models\n(Rockt\\\"aschel et al., 2015; Wang and Jiang, 2015) achieves state-of-the-art\naccuracy by computing soft word alignments between the premise and hypothesis\nsentences. However, there remains a major limitation: this line of work\ncompletely ignores syntax and recursion, which is helpful in many traditional\nefforts. We show that it is beneficial to extend the attention model to tree\nnodes between premise and hypothesis. More importantly, this subtree-level\nattention reveals information about entailment relation. We study the recursive\ncomposition of this subtree-level entailment relation, which can be viewed as a\nsoft version of the Natural Logic framework (MacCartney and Manning, 2009).\nExperiments show that our structured attention and entailment composition model\ncan correctly identify and infer entailment relations from the bottom up, and\nbring significant improvements in accuracy.","url_abs":"http://arxiv.org/abs/1701.01126v1","url_pdf":"http://arxiv.org/pdf/1701.01126v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"textual-entailment-with-structured-attentions","repo_url":"https://github.com/kaayy/structured-attention","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"torch","reach":null}],"tasks":[{"task_slug":"natural-language-inference","task_name":"Natural Language Inference"},{"task_slug":null,"task_name":"Relation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1701.01126","atlas_url":"https://app.syntology.ai/?focus=1701.01126","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1701.01126"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1701.01126\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1701.01126"},"call":"get_concepts_for_paper(arxiv_id=\"1701.01126\")"}],"by_repo":[{"repo":"kaayy/structured-attention","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"79cb482b9e9798a52e3648f6ddbc8c59e46ec69877b2f2d95115c045d80076de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}