title: How to do an empirical analysis in stemming algorithm
body: <p>Hey guys so i'm quite confused on how to do an empirical analysis on a stemming algorithm for example lancaster and porter stemmer because they don't have a time efficiency compared to the sorting algorithm.</p>
  
  <p>What i tried is importing both of them on nltk then time both of them using timer in python and do an normalization to the data by 1000 times, but i'm not too sure is that what it means to do empirical analysis on word stemming algorithm or is it completely different?</p>