Domain specificity and data efficiency in typo tolerant spell checkers: the case of search in online marketplaces

Dayananda Ubrangala, Juhi Sharma, Ravi Prasad Kondapalli, Kiran R, Amit Agarwala +1 more
8/3/2023
cs.LGcs.AIcs.CL

No confident code implementation found for this paper.

Abstract

Typographical errors are a major source of frustration for visitors of online marketplaces. Because of the domain-specific nature of these marketplaces and the very short queries users tend to search for, traditional spell cheking solutions do not perform well in correcting typos. We present a data augmentation method to address the lack of annotated typo data and train a recurrent neural network to learn context-limited domain-specific embeddings. Those embeddings are deployed in a real-time inferencing API for the Microsoft AppSource marketplace to find the closest match between a misspelled user query and the available product names. Our data efficient solution shows that controlled high quality synthetic data may be a powerful tool especially considering the current climate of large language models which rely on prohibitively huge and often uncontrolled datasets.

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{ubrangala2023domain,
  title  = {Domain specificity and data efficiency in typo tolerant spell checkers: the case of search in online marketplaces},
  author = {Dayananda Ubrangala and Juhi Sharma and Ravi Prasad Kondapalli and Kiran R and Amit Agarwala and Laurent Boué},
  year   = {2023},
  eprint = {2308.01976},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.01976v1}
}

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/2308.01976.svg)](https://codeofpaper.com/paper/2308.01976)

Discussion