1 |
Combining Deep Generative Models and Multi-lingual Pretraining for Semi-supervised Document Classification ...
|
|
|
|
BASE
|
|
Show details
|
|
2 |
It Is Not As Good As You Think! Evaluating Simultaneous Machine Translation on Interpretation Data ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
A Closer Look at Few-Shot Crosslingual Transfer: The Choice of Shots Matters ...
|
|
|
|
BASE
|
|
Show details
|
|
4 |
Self-Alignment Pretraining for Biomedical Entity Representations
|
|
Liu, Fangyu; Shareghi, Ehsan; Meng, Zaiqiao. - : Association for Computational Linguistics, 2021. : Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021
|
|
BASE
|
|
Show details
|
|
5 |
A Closer Look at Few-Shot Crosslingual Transfer: The Choice of Shots Matters ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Show Some Love to Your n-grams: A Bit of Progress and Stronger n-gram Language Modeling Baselines ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees ...
|
|
|
|
Abstract:
Efficient methods for storing and querying are critical for scaling high-order n-gram language models to large corpora. We propose a language model based on compressed suffix trees, a representation that is highly compact and can be easily held in memory, while supporting queries needed in computing language model probabilities on-the-fly. We present several optimisations which improve query runtimes up to 2500x, despite only incurring a modest increase in construction time and memory usage. For large corpora and high Markov orders, our method is highly competitive with the state-of-the-art KenLM package. It imposes much lower memory requirements, often by orders of magnitude, and has runtimes that are either similar (for training) or comparable (for querying). ... : 14 pages in Transactions of the Association for Computational Linguistics (TACL) 2016 ...
|
|
Keyword:
Computation and Language cs.CL; FOS Computer and information sciences
|
|
URL: https://dx.doi.org/10.48550/arxiv.1608.04465 https://arxiv.org/abs/1608.04465
|
|
BASE
|
|
Hide details
|
|
8 |
Structured Prediction of Sequences and Trees using Infinite Contexts ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|