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

UAI, pp. 672-681, 2015.

Cited by: 0|Views23
EI

Abstract:

This paper addresses the computational issues of learning with long, and possibly all, N-grams in a document corpus. Our main result uses suffix trees to show that N-gram matrices require memory and time that is at worst linear (in the length of the underlying corpus) to store and to multiply a vector. Our algorithm can speed up any N-gra...More

Code:

Data:

Get fulltext within 24h
Bibtex
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

Upload a single paper

for 5 coins

Wechat's Red Packet
?

Upload 50 articles

for 250 coins

Wechat's Red Packet
?

Upload 200 articles

for 1000 coins

Wechat's Red Packet
?

Upload 500 articles

for 2500 coins

Wechat's Red Packet
?

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :
0

 

Tags
Comments