rmuir commented on PR #16031:
URL: https://github.com/apache/lucene/pull/16031#issuecomment-4380601662
> for (int i = 0; i < termLength; i++) {
> sb.append((char) ('a' + (i % 26)));
> }
I don't think these are good realistic test strings. It will inflate the
numbers due to huge alphabet size. How many words have 20+ unique letters in
them?
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
