Сжатые суффиксные деревья

AbstractEfficient methods for storing and querying are critical for scaling high-order m-gram language models to large corpora. We propose a language model based on compressed suffix trees, a representation that …...