KenLM
Related Papers
KenLM: Faster and Smaller Language Model Queries
We present KenLM, a library that imple- ments two data structures for efficient lan- guage model queries, reducing both time and memory costs. The PROBING data structure uses linear probing …...
Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees
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 …...
N-gram language models for massively parallel devices
For many applications, the query speed of N-gram language models is a computa- tional bottleneck. Although massively par- allel hardware like GPUs offer a poten- tial solution to this bottleneck, …...
PJIIT’s systems for WMT 2017 Conference
In this paper, we attempt to improve Statistical Machine Translation (SMT) systems between Czech, Latvian and English in WNT’17 News translation task. We also participated in the Biomedical task and …...