http://sujitpal.blogspot.in/2009/02/summarization-with-lucene.html but
> this does not work in memory . Is there a java library where I can do a
> quick search on span query.
>
> Thanks
>
> On Mon, Feb 16, 2015 at 5:57 AM, Denis Bazhenov wrote:
>
>> Either you have to ind
aining 'Lucene'. I tried using this
http://sujitpal.blogspot.in/2009/02/summarization-with-lucene.html but this
does not work in memory . Is there a java library where I can do a quick
search on span query.
Thanks
On Mon, Feb 16, 2015 at 5:57 AM, Denis Bazhenov wrote:
> Either you have to index those wo
Either you have to index those words in a facet or calculate top 10 words
on-the-fly. Last approach could be effective enough if you have ability to read
those documents quickly. The calculation of Top 10 words could be done pretty
easily in terms of memory and CPU, because there is no need to
10
documents. For faceted search also we need to know in advance the facets.
You search for a string it gives bunch of documents containing some summary
of the document and all I have to do is quickly find top 10 words from
these documents from the summary which will vary depending on the search
I need to find the top 10
> words occurring in this 10 documents.As the document size is large how
> to further index these documents and find the top 10 words
>
> 1. I am thinking of using Lucene Ramdirectory or memory indexing and find
> the most occurring top 10 words.
> 2.
Hi,
Can someone help me with this use case:
1. I have to search a string and let's say the search engine(it is not
lucene) found this string in 100,000 documents. I need to find the top 10
words occurring in this 10 documents.As the document size is large how
to further index
