arXiv:1512.08422
Natural Language Inference by Tree-Based Convolution and Heuristic Matching
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A MISMATCHED Benchmark for Scientific Natural Language Inference
Parameter-Efficient Transformer Embeddings
Thunder-NUBench: A Benchmark for LLMs' Sentence-Level Negation Understanding
SALAD: Improving Robustness and Generalization through Contrastive Learning with Structure-Aware and LLM-Driven Augmented Data
Negation: A Pink Elephant in the Large Language Models' Room?
DIBERT: Dependency Injected Bidirectional Encoder Representations from Transformers
토론
이 논문과 연결된 포럼 글이 아직 없습니다.