The equation for stride pooling is as follows: where k is the length of a stride and s k•i:k•(i+1)−1 is a sequence representation with one stride in s. As stride pooling results in features that vary in length according to the length of words, we therefore simply sum the elements of the vector e to produce fixed-sized features.
far, we have described the procedure for a single filter.