Text Compression and Superfast Searching
Udayan Khurana, Anirudh Koul
Abstract
In this paper, a new compression scheme for text is presented. The same is efficient in giving high compression ratios and enables super fast searching within the compressed text. Typical compression ratios of 70-80% and reducing the search time by 80-85% are the features of this paper. Till now, a trade-off between high ratios and searchability within compressed text has been seen. In this paper, we show that greater the compression, faster the search. This finds applicability in so many places where data as natural language text is present.
Create a lesson
Related papers
WISE: An Agentic Framework for Whole-page Multimodal Search Experience Attribution
Wenyi Xu, Renzhe Zhou, Songyang Li et al.
Deliberate Latent Reasoning for Sequential Recommendation
Haobo Zhang, Qiannan Zhu, Yutao Zhu et al.
PMRecBench: A Benchmark for Personalization in Recommendation Agents under Multimodal Queries
Xiaoyu Zhang, Yougang Lyu, Bin Wu et al.
Generative Retrieval under Real-Time Supply Constraints in Local Commerce
Shaopeng Liang, Biao Zhang, Hongzhen Ye et al.
Do Search-Augmented Recommenders Use the Latest Search Episode?
Jiandong Ding
One Basket, Many Experts: Decorrelated Re-ranking for Financial Asset Recommendation
Ryuki Unno, Keigo Sakurai, Koshi Watanabe et al.