mlsanityData to 7 Oct 2026

Learning High-Quality and General-Purpose Phrase Representations

arXiv 2401.10407 ↗First posted 18 Jan 2024cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

Phrase representations play an important role in data science and natural language processing, benefiting various tasks like Entity Alignment, Record Linkage, Fuzzy Joins, and Paraphrase Classification. The current state-of-the-art method involves fine-tuning pre-trained language models for phrasal embeddings using contrastive learning. However, we have identified areas for improvement. First, these pre-trained models tend to be unnecessarily complex and require to be pre-trained on a corpus with context sentences. Second, leveraging the phrase type and morphology gives phrase representations that are both more precise and more flexible. We propose an improved framework to learn phrase representations in a context-free fashion. The framework employs phrase type classification as an auxiliary task and incorporates character-level information more effectively into the phrase representation. Furthermore, we design three granularities of data augmentation to increase the diversity of training samples. Our experiments across a wide range of tasks show that our approach generates superior phrase embeddings compared to previous methods while requiring a smaller model size. [PEARL-small]: https://huggingface.co/Lihuchen/pearl_small; [PEARL-base]: https://huggingface.co/Lihuchen/pearl_base; [Code and Dataset]: https://github.com/tigerchen52/PEARL

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 25 of its 56 references that are in the map. First posted on arXiv 18 Jan 2024.

Builds on

25 of 56 references.

References · 25

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  6. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  7. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  8. 2017Billion-scale similarity search with GPUscited by 2,477
  9. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  10. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
  11. 2015A large annotated corpus for learning natural language inferencecited by 1,837
  12. 2016Enriching Word Vectors with Subword Informationcited by 1,578
13 more
  1. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
  2. 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,216
  3. 2019SpanBERT: Improving Pre-training by Representing and Predicting Spanscited by 832
  4. 2020LUKE: Deep Contextualized Entity Representations with Entity-aware Self-attentioncited by 326
  5. 2018Constituency Parsing with a Self-Attentive Encodercited by 196
  6. 2019Combating Adversarial Misspellings with Robust Word Recognitioncited by 162
  7. 2020Learning Dense Representations of Phrases at Scalecited by 91
  8. 2021Phrase-BERT: Improved Phrase Embeddings from BERT with an Application to Corpus Explorationcited by 44
  9. 2020Assessing Phrasal Representation and Composition in Transformerscited by 41
  10. 2022UCTopic: Unsupervised Contrastive Learning for Phrase Representations and Topic Miningcited by 33
  11. 2021Auto-FuzzyJoin: Auto-Program Fuzzy Similarity Joins Without Labeled Examplescited by 15
  12. 2013Domain and Function: A Dual-Space Model of Semantic Relations and Compositionscited by 13
  13. 2022Imputing Out-of-Vocabulary Embeddings with LOVE Makes Language Models Robust with Little Costcited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.