REVIEW 2 cited by
Syntax-BERT: Improving Pre-trained Transformers with Syntax Trees
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Pre-trained language models like BERT achieve superior performances in various NLP tasks without explicit consideration of syntactic information. Meanwhile, syntactic information has been proved to be crucial for the success of NLP applications. However, how to incorporate the syntax trees effectively and efficiently into pre-trained Transformers is still unsettled. In this paper, we address this problem by proposing a novel framework named Syntax-BERT. This framework works in a plug-and-play mode and is applicable to an arbitrary pre-trained checkpoint based on Transformer architecture. Experiments on various datasets of natural language understanding verify the effectiveness of syntax trees and achieve consistent improvement over multiple pre-trained models, including BERT, RoBERTa, and T5.
Forward citations
Cited by 2 Pith papers
-
Infusing Prompts with Syntax and Semantics
Appending syntactic and semantic analyses to prompts improves text-to-SQL accuracy in four low-resource languages and speeds fine-tuning.
-
Comateformer: Combined Attention Transformer for Semantic Sentence Matching
Comateformer replaces softmax attention with a product of tanh similarity and sigmoid dissimilarity scores, and reports consistent gains on ten semantic matching datasets.
Discussion (0). Continue with ORCID to comment.