paper-with-me

홈 › Papers

Succinct Data Structures for NLP-at-Scale

2016-12-01 · COLING 2016 12 · Matthias Petri, Trevor Cohn

Succinct data structures involve the use of novel data structures, compression technologies, and other mechanisms to allow data to be stored in extremely small memory or disk footprints, while still allowing for efficient access to the underlying data. They have successfully been applied in areas such as Information Retrieval and Bioinformatics to create highly compressible in-memory search indexes which provide efficient search functionality over datasets which traditionally could only be processed using external memory data structures. Modern technologies in this space are not well known within the NLP community, but have the potential to revolutionise NLP, particularly the application to {`}big data{'} in the form of terabyte and larger corpora. This tutorial will present a practical introduction to the most important succinct data structures, tools, and applications with the intent of providing the researchers with a jump-start into this domain. The focus of this tutorial will be efficient text processing utilising space efficient representations of suffix arrays, suffix trees and searchable integer compression schemes with specific applications of succinct data structures to common NLP tasks such as $n$-gram language modelling.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Information RetrievalLanguage ModellingRetrieval

Similar Papers 제목 키워드 기반

Succinct Compression: Near-Optimal and Lossless Compression of Deep Neural Networks during Inference Runtime

2021-09-29 · Yicun Duan, Xiangjun Peng

Recent advances in Deep Neural Networks (DNN) compression (e.g. pruning, quantization and etc.) significantly reduces the amount of space consumption for storage, making them easier to deploy in low-cost devices. However…

Quantization

Dynamic Path-Decomposed Tries

2019-06-14 · Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita 외

A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient implementation. When limited to static appli…

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions

2023-05-26 · Benjamin Coleman, David Torres Ramos, Vihan Lakshman, Chen Luo 외

Lookup tables are a fundamental structure in many data processing and systems applications. Examples include tokenized text in NLP, quantized embedding collections in recommendation systems, integer sketches for streamin…

Recommendation Systems

A Locally Differential Private Coding-Assisted Succinct Histogram Protocol

2025-06-21 · Hsuan-Po Liu, Hessam Mahdavifar

A succinct histogram captures frequent items and their frequencies across clients and has become increasingly important for large-scale, privacy-sensitive machine learning applications. To develop a rigorous framework to…

Succinct Trit-array Trie for Scalable Trajectory Similarity Search

2020-05-21 · Shunsuke Kanda, Koh Takeuchi, Keisuke Fujii, Yasuo Tabei

Massive datasets of spatial trajectories representing the mobility of a diversity of moving objects are ubiquitous in research and industry. Similarity search of a large collection of trajectories is indispensable for tu…