ML Anthology

Fast Algorithms for Learning with Long N-Grams via Suffix Tree Based Matrix Multiplication

Hristo S. Paskov, John C. Mitchell, Trevor J. Hastie
UAI 2015 pp. 672-681
/uai/2015/paskov2015uai-fast/
UAI Semantic Scholar

Cite

Text

Paskov et al. "Fast Algorithms for Learning with Long N-Grams via Suffix Tree Based Matrix Multiplication." Conference on Uncertainty in Artificial Intelligence, 2015.

Markdown

[Paskov et al. "Fast Algorithms for Learning with Long N-Grams via Suffix Tree Based Matrix Multiplication." Conference on Uncertainty in Artificial Intelligence, 2015.](https://mlanthology.org/uai/2015/paskov2015uai-fast/)

BibTeX

@inproceedings{paskov2015uai-fast,
  title     = {{Fast Algorithms for Learning with Long N-Grams via Suffix Tree Based Matrix Multiplication}},
  author    = {Paskov, Hristo S. and Mitchell, John C. and Hastie, Trevor J.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {2015},
  pages     = {672-681},
  url       = {https://mlanthology.org/uai/2015/paskov2015uai-fast/}
}