arXiv:2308.15498
Chunked Lists versus Extensible Arrays for Text Inversion
원문 초록
In our 2017 work on in-memory list-based text inversion [Hawking and Billerbeck. Efficient In-Memory, List-Based Text Inversion. ADCS 2017] we compared memory use and indexing speed of a considerable number of variants of chunked linked lists. In the present work we compare the best performing of those variants (FBB - dynamic Fibonacci chunking) with the extensible SQ array technique (SQA) presented in [Moffat and Mackenzie. Immediate-Access Indexing Using Space-Efficient Extensible Arrays. ADCS 2023].
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
cAST: Enhancing Code Retrieval-Augmented Generation with Structural Chunking via Abstract Syntax Tree
TableRAG: A Retrieval Augmented Generation Framework for Heterogeneous Document Reasoning
Real-Time Execution of Action Chunking Flow Policies
Dynamic Chunking and Selection for Reading Comprehension of Ultra-Long Context in Large Language Models
Context is Gold to find the Gold Passage: Evaluating and Training Contextual Document Embeddings
Rethinking Chunk Size For Long-Document Retrieval: A Multi-Dataset Analysis
토론
이 논문과 연결된 포럼 글이 아직 없습니다.