ABB-BERT: A BERT model for disambiguating abbreviations and contractions

Prateek Kacker, Andi Cupallari, Aswin Gridhar Subramanian, Nimit Jain
7/8/2022
cs.CL

No confident code implementation found for this paper.

Abstract

Abbreviations and contractions are commonly found in text across different domains. For example, doctors' notes contain many contractions that can be personalized based on their choices. Existing spelling correction models are not suitable to handle expansions because of many reductions of characters in words. In this work, we propose ABB-BERT, a BERT-based model, which deals with an ambiguous language containing abbreviations and contractions. ABB-BERT can rank them from thousands of options and is designed for scale. It is trained on Wikipedia text, and the algorithm allows it to be fine-tuned with little compute to get better performance for a domain or person. We are publicly releasing the training dataset for abbreviations and contractions derived from Wikipedia.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kacker2022abbbert,
  title  = {ABB-BERT: A BERT model for disambiguating abbreviations and contractions},
  author = {Prateek Kacker and Andi Cupallari and Aswin Gridhar Subramanian and Nimit Jain},
  year   = {2022},
  eprint = {2207.04008},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.04008v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.04008.svg)](https://codeofpaper.com/paper/2207.04008)

Discussion