paper-with-me

홈 › Papers

Natural Language Inference by Tree-Based Convolution and Heuristic Matching

2015-12-28 · ACL 2016 8 · Lili Mou, Rui Men, Ge Li, Yan Xu, Lu Zhang, Rui Yan, Zhi Jin

In this paper, we propose the TBCNN-pair model to recognize entailment and contradiction between two sentences. In our model, a tree-based convolutional neural network (TBCNN) captures sentence-level semantics; then heuristic matching layers like concatenation, element-wise product/difference combine the information in individual sentences. Experimental results show that our model outperforms existing sentence encoding-based approaches by a large margin.

📄 PDF Abstract BibTeX arXiv:1512.08422

Code (0)

등록된 구현이 없습니다.

Tasks

Natural Language InferenceSentence

Similar Papers 제목 키워드 기반

Kernel Embeddings of Latent Tree Graphical Models

2011-12-01 · NeurIPS 2011 12 · Le Song, Eric P. Xing, Ankur P. Parikh

Latent tree graphical models are natural tools for expressing long range and hierarchical dependencies among many variables which are common in computer vision, bioinformatics and natural language processing problems. Ho…

Graph Convolutional Policy for Solving Tree Decomposition via Reinforcement Learning Heuristics

2019-10-18 · Taras Khakhulin, Roman Schutski, Ivan Oseledets

We propose a Reinforcement Learning based approach to approximately solve the Tree Decomposition (TD) problem. TD is a combinatorial problem, which is central to the analysis of graph minor structure and computational co…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)Tree Decomposition

On the Properties of Gromov Matrices and their Applications in Network Inference

2019-03-22

The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous app…

Batch Monte Carlo Tree Search

2021-04-09 · Tristan Cazenave

Making inferences with a deep neural network on a batch of states is much faster with a GPU than making inferences on one state after another. We build on this property to propose Monte Carlo Tree Search algorithms using…

Game of GoGPU

An Imitation Learning Approach to Unsupervised Parsing

2019-06-05 · ACL 2019 7 · Bowen Li, Lili Mou, Frank Keller

Recently, there has been an increasing interest in unsupervised parsers that optimize semantically oriented objectives, typically using reinforcement learning. Unfortunately, the learned trees often do not match actual s…

Imitation LearningLanguage ModelingLanguage ModellingNatural Language Inference+1