A FastText variant using double-array trie indexing and prefix/suffix row merging claims 5x memory compression with negligible quality loss, but the evidence in the preprint is not reproducible.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management
A FastText variant using double-array trie indexing and prefix/suffix row merging claims 5x memory compression with negligible quality loss, but the evidence in the preprint is not reproducible.