Skip to content

varun-tandon/FastMatrixMultiplicationSuffixTrees

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

131 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Multiplying N-gram Matrices in Linear Time and Space

Welcome to our repository! Here are some quick links:

  • For the link to our web version of our explanatory article, click here.
  • For the PDF version of our explanatory article, click here.
  • For the original paper, click here.
  • For the Python scripts used for benchmarking, click here.
  • For the code for our website, take a look at index.html and the scripts/ folder.

About

An explanatory article of the paper "Fast Algorithms for Learning with Long N-grams via Suffix Tree Based Matrix Multiplication" by Hristo S. Paskov, John C. Mitchell, and Trevor J. Hastie.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors