| Challenge: | Extensive research efforts have been devoted to the task of matching two natural language sentences. |
| Approach: | They propose to embed syntactic structures into an embedding vector and combine them with other features to predict matching scores. |
| Outcome: | The proposed method outperforms the state-of-the-art methods on three public datasets and can interpret sentences in interpretable way. |
Similar Papers
Sentence Matching with Syntax- and Semantics-Aware BERT (2020.coling-main)
Copied to clipboard
| Challenge: | Sentence matching aims to determine the special relationship between two sentences. |
| Approach: | They propose to integrate syntactic and semantic information into BERT with sentence matching by using an implicit integration method that is less sensitive to the output structure information. |
| Outcome: | The proposed method achieves state-of-the-art or competitive performance on several sentence matching datasets. |
Incorporating Syntax and Semantics in Coreference Resolution with Heterogeneous Graph Attention Network (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing neural coreference resolution models lack syntactic and semantic information . however, such information has been shown to benefit other tasks. |
| Approach: | They propose a graph-based model that incorporates syntactic and semantic structures of sentences. |
| Outcome: | The proposed model incorporates syntactic and semantic structures of sentences. |
Structured Alignment Networks for Matching Sentences (D18-1)
Copied to clipboard
| Challenge: | Many tasks in natural language processing involve comparing two sentences to compute some notion of relevance, entailment, or similarity. |
| Approach: | They propose a model of structured alignments between sentences to compare two sentences by matching their latent structures. |
| Outcome: | The proposed model is differentiable and trained only on the matching objective. |
Incorporating Contextual and Syntactic Structures Improves Semantic Similarity Modeling (D19-1)
Copied to clipboard
| Challenge: | Semantic similarity modeling is central to many NLP problems such as question answering. |
| Approach: | They propose a pairwise word interaction model with syntactic structure priors to explore their effectiveness. |
| Outcome: | Extensive evaluations on eight benchmark datasets show that incorporating structural information improves over strong baselines. |
Neural Graph Matching Networks for Chinese Short Text Matching (2020.acl-main)
Copied to clipboard
| Challenge: | Chinese word segmentation can be erroneous, ambiguous or inconsistent, causing performance problems. |
| Approach: | They propose a sentence matching framework that uses paired word lattices as input instead of a character sequence. |
| Outcome: | The proposed framework outperforms the state-of-the-art short text matching models on two Chinese datasets. |
Extractive Summarization as Text Matching (2020.acl-main)
Copied to clipboard
| Challenge: | Currently, most of the neural extractive summarization systems score and extract sentences individually and model the relationship between sentences. |
| Approach: | They propose to instantiate a neural extractive summarization task as a semantic text matching problem and use it to match a source document and candidate summaries in a semantic space. |
| Outcome: | The proposed framework is faster and more efficient than existing frameworks. |
Node Embeddings for Graph Merging: Case of Knowledge Graph Construction (D19-53)
Copied to clipboard
| Challenge: | Combining two graphs requires merging the nodes which are counterparts of each other. In this process errors occur, resulting in incorrect merging or failure to merge. |
| Approach: | They propose to replace string similarity with vector embedding similarity to reduce errors when merging two graphs . they propose to use graph-based and word-based embeddable graph embeddances to obtain graph node embeddations. |
| Outcome: | The proposed algorithm reduces errors in merging two graphs with a corpus level one graph using string similarity and vector embedding similarity. |
Semantic Geometry of Sentence Embeddings (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Sentence embeddings are central to natural language processing, but their internal features are not interpretable and users lack fine-grained control for downstream tasks. |
| Approach: | They propose a formal framework to characterize the organization of features in sentence embeddings . they show how they can be composed to capture richer semantic structures . |
| Outcome: | The proposed method can be used to capture richer semantic structures. |
From Phrases to Subgraphs: Fine-Grained Semantic Parsing for Knowledge Graph Question Answering (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to knowledge graph question answering (KGQA) face semantic misalignment and reasoning noise. |
| Approach: | They propose a fine-grained semantic parsing framework for KGQA that maps natural language queries to executable logical forms. |
| Outcome: | The proposed framework achieves 18.5% performance improvement over the SOTA on a multi-hop CWQ dataset. |
Simple and Effective Text Matching with Richer Alignment Features (P19-1)
Copied to clipboard
| Challenge: | Existing models only use a single inter-sequence alignment layer to make full use of this process. |
| Approach: | They propose to keep three key features available for inter-sequence alignment . they conduct experiments on four well-studied benchmark datasets . |
| Outcome: | The proposed model is able to perform on four well-studied datasets with fewer parameters and the inference speed is at least 6 times faster than similar models. |