Papers
Topics
Authors
Recent
Search
2000 character limit reached

Searching, fast and slow, through product catalogs

Published 1 Jan 2024 in cs.IR, cs.AI, cs.LG, and cs.SE | (2401.00737v1)

Abstract: String matching algorithms in the presence of abbreviations, such as in Stock Keeping Unit (SKU) product catalogs, remains a relatively unexplored topic. In this paper, we present a unified architecture for SKU search that provides both a real-time suggestion system (based on a Trie data structure) as well as a lower latency search system (making use of character level TF-IDF in combination with LLM vector embeddings) where users initiate the search process explicitly. We carry out ablation studies that justify designing a complex search system composed of multiple components to address the delicate trade-off between speed and accuracy. Using SKU search in the Dynamics CRM as an example, we show how our system vastly outperforms, in all aspects, the results provided by the default search engine. Finally, we show how SKU descriptions may be enhanced via generative text models (using gpt-3.5-turbo) so that the consumers of the search results may get more context and a generally better experience when presented with the results of their SKU search.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. “CONTAINS (Transact-SQL).” https://learn.microsoft.com/en-us/sql/t-sql/queries/contains-transact-sql?view=sql-server-ver16.
  2. “Camel Case notation.” https://en.wikipedia.org/wiki/Camel_case.
  3. C.-J. Kuo, M. H. Ling, K.-T. Lin, and C.-N. Hsu, “Bioadi: a machine learning approach to identifying abbreviations and definitions in biological literature,” in Eighth International Conference on Bioinformatics 2009.
  4. Y. Xu, Z. Wang, Y. Zhao, and Y. Xue, “A new alignment algorithm to identify definitions corresponding to abbreviations in biomedical text,” in WKDD 2008.
  5. “Trie data structure.” https://en.wikipedia.org/wiki/Trie.
  6. R. de la Briandais, “File searching using variable length keys,” in Western J. Computer Conf., 1959.
  7. D. Knuth, The Art of Computer Programming Volume 3: Sorting and Searching. 1997.
  8. J. Bergman, Efficient fuzzy type-ahead search on big data using a ranked trie data structure. PhD thesis, Umeå University, 2018.
  9. T. Wenbo, Approximate string joins with abbreviations. PhD thesis, MIT, 2018.
  10. “multi-qa-MiniLM-L6-cos-v1.” https://huggingface.co/sentence-transformers/multi-qa-MiniLM-L6-cos-v1.
  11. “Pyspellchecker.” https://pypi.org/project/pyspellchecker/.
  12. “How to Write a Spelling Corrector.” https://norvig.com/spell-correct.html.
  13. “TF-IDF.” https://en.wikipedia.org/wiki/Tf%E2%80%93idf.
  14. T. Nguyen, M. Rosenberg, X. Song, J. Gao, S. Tiwary, R. Majumder, and L. Deng, “Ms marco: A human generated machine reading comprehension dataset,” in NIPS 2016.
  15. “GloVe: Global Vectors for Word Representation.” https://nlp.stanford.edu/projects/glove/.
  16. “PyTorch GloVe.” https://torchtext.readthedocs.io/en/latest/vocab.html#glove.
  17. “Word2vec embeddings.” https://radimrehurek.com/gensim/models/word2vec.html.
  18. “Learn how to generate embeddings with Azure OpenAI.” https://learn.microsoft.com/en-us/azure/ai-services/openai/how-to/embeddings?tabs=console.
Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.