In trying to calculate the cost of various slop settings for phrase queries, what's the time complexity? O(n) or O(n^2)?
--------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org For additional commands, e-mail: java-user-h...@lucene.apache.org
