Hi, I am using the more like this function to score a series of documents by their ids. I now need to determine the rank of these documents within the more like this corpus.
I am working on an algorithm to perform to build a binary search tree split by rank which also includes the top score for this particular rank, so I can find the optional range to search for the range of scores I have associated with my dcoument ids. Has anyone previously encountered this problem, or has a suggestion on how to efficient implement such an algorithm (i'm using python) Thanks in advance, Julian. -- You received this message because you are subscribed to the Google Groups "elasticsearch" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/elasticsearch/6322659b-889b-41b3-9c5c-3c4d370f544a%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
