Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees
Saved in:
| Main Authors: | Ehsan Shareghi, Matthias Petri, Gholamreza Haffari, Trevor Cohn |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The MIT Press
2021-03-01
|
| Series: | Transactions of the Association for Computational Linguistics |
| Online Access: | http://dx.doi.org/10.1162/tacl_a_00112 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A fast algorithm for constructing suffix arrays for DNA alphabets
by: Zeinab Rabea, et al.
Published: (2022-07-01) -
Sequence Comparison Alignment-Free Approach Based on Suffix Tree and L-Words Frequency
by: Inês Soares, et al.
Published: (2012-01-01) -
Game on: Computerized Training Promotes Second Language Stress–Suffix Associations
by: Kaylee Fernandez, et al.
Published: (2025-07-01) -
Functional variants of nouns with the suffix -ush-/-yush- in modern Russian language
by: E.A. Makleeva
Published: (2017-10-01) -
Exact solutions of the semi-infinite Toda lattice with applications to the inverse spectral problem
by: E. K. Ifantis, et al.
Published: (2004-01-01)