1 paper · 1 filter
Ryan R. Curtin, Fred Lu, Edward Raff +1
The number of n-gram features grows exponentially in n, making it computationally demanding to compute the most frequent n-grams even for n as small as 3. Motivated by our producti…