To speed up the process of categorizing learner errors and obtaining data for languages which lack error-annotated data, we describe a linguistically-informed method for generatin...
Empirical studies on link blacklisting show that the delivery rate is very sensitive to the calibration of the blacklisting threshold. If the calibration is too restrictive (the th...
Flavio Fabbri, Marco Zuniga, Daniele Puccinelli, P...
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...