paper-with-me

Papers

Improving Constituent Representation with Hypertree Neural Networks

2022-07-01 · NAACL 2022 7 · Hao Zhou, Gongshen Liu, Kewei Tu

Many natural language processing tasks involve text spans and thus high-quality span representations are needed to enhance neural approaches to these tasks. Most existing methods of span representation are based on simple derivations (such as max-pooling) from word representations and do not utilize compositional structures of natural language. In this paper, we aim to improve representations of constituent spans using a novel hypertree neural networks (HTNN) that is structured with constituency parse trees. Each node in the HTNN represents a constituent of the input sentence and each hyperedge represents a composition of smaller child constituents into a larger parent constituent. In each update iteration of the HTNN, the representation of each constituent is computed based on all the hyperedges connected to it, thus incorporating both bottom-up and top-down compositional information. We conduct comprehensive experiments to evaluate HTNNs against other span representation models and the results show the effectiveness of HTNN.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Sentence

Similar Papers 제목 키워드 기반

A Backtracking-Based Algorithm for Computing Hypertree-Decompositions

2007-01-14 · Georg Gottlob, Marko Samer

Hypertree decompositions of hypergraphs are a generalization of tree decompositions of graphs. The corresponding hypertree-width is a measure for the cyclicity and therefore tractability of the encoded computation proble…

Distance-based Learning of Hypertrees

2025-11-27 · Shaun Fallat, Kamyar Khodamoradi, David Kirkpatrick, Valerii Maliuk 외 arxiv

We study the problem of learning hypergraphs with shortest-path queries (SP-queries), and present the first provably optimal online algorithm for a broad and natural class of hypertrees that we call orderly hypertrees. O…

HyperTree Planning: Enhancing LLM Reasoning via Hierarchical Thinking

2025-05-05 · Runquan Gui, Zhihai Wang, Jie Wang, Chi Ma 외

Recent advancements have significantly enhanced the performance of large language models (LLMs) in tackling complex reasoning tasks, achieving notable success in domains like mathematical and logical reasoning. However, …

Logical Reasoning

Enhancing Datalog Reasoning with Hypertree Decompositions

2023-05-11 · Xinyue Zhang, Pan Hu, Yavor Nenov, Ian Horrocks

Datalog reasoning based on the semina\"ive evaluation strategy evaluates rules using traditional join plans, which often leads to redundancy and inefficiency in practice, especially when the rules are complex. Hypertree …

Threshold Treewidth and Hypertree Width

2022-10-13 · Andre Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider

Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP beco…