From 607a607b7165c4d4f8d04c2356f580a09acb010a Mon Sep 17 00:00:00 2001 From: Al Date: Tue, 8 Sep 2015 16:37:23 -0700 Subject: [PATCH] [doc] documentation fix for averaged perceptron --- src/averaged_perceptron.h | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) diff --git a/src/averaged_perceptron.h b/src/averaged_perceptron.h index 1c0e244e..6147856f 100644 --- a/src/averaged_perceptron.h +++ b/src/averaged_perceptron.h @@ -9,16 +9,17 @@ The averaged perceptron is a linear model, meaning the score for a given class is the dot product of weights and the feature values. This implementation of the averaged perceptron uses a trie data structure to -store the mapping from features to ids, which can be quite memory efficient -as opposed to a hash table and allows us to store +store the mapping from features to indices, which can be quite memory efficient +as opposed to a hash table and allows us to store millions of features with +very little memory. The weights are stored as a sparse matrix in compressed sparse row format (see sparse_matrix.h) -See [Collins, 2002] Discriminative Training Methods for Hidden Markov Models: - Theory and Experiments with Perceptron Algorithms +Paper: [Collins, 2002] Discriminative Training Methods for Hidden Markov Models: + Theory and Experiments with Perceptron Algorithms -Paper: http://www.cs.columbia.edu/~mcollins/papers/tagperc.pdf +Link: http://www.cs.columbia.edu/~mcollins/papers/tagperc.pdf */ #ifndef AVERAGED_PERCEPTRON_H #define AVERAGED_PERCEPTRON_H