Tightly Packed Tries: How to Fit Large Models into Memory, and Make them Load Fast, Too
| Citations: | 3 - 0 self |
BibTeX
@MISC{Germann_tightlypacked,
author = {Ulrich Germann and Eric Joanis and Samuel Larkin},
title = {Tightly Packed Tries: How to Fit Large Models into Memory, and Make them Load Fast, Too},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present Tightly Packed Tries (TPTs), a compact implementation of read-only, compressed trie structures with fast on-demand paging and short load times. We demonstrate the benefits of TPTs for storing n-gram back-off language models and phrase tables for statistical machine translation. Encoded as TPTs, these databases require less space than flat text file representations of the same data compressed with the gzip utility. At the same time, they can be mapped into memory quickly and be searched directly in time linear in the length of the key, without the need to decompress the entire file. The overhead for local decompression during search is marginal. 1
