lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ian Lea <ian....@gmail.com>
Subject Re: Weighted Query Sequence
Date Mon, 31 Oct 2011 09:38:59 GMT
Sounds custom made for boosting.  Depending on how you are structuring
your fields and queries you could use either index or query time
boosts, or even both.

http://wiki.apache.org/lucene-java/LuceneFAQ#What_is_the_difference_between_field_.28or_document.29_boosting_and_query_boosting.3F


--
Ian.

2011/10/31 Shengtao Lei <shengtao.lei@gmail.com>:
>  Hello Every One!
>
>
> I'm struggling with my degree paper. My research project is build a search
> engine for a language which has many affixes and prefixes.
> Many papers have been read, the common way is stemming,
> My segmentation processor can cut of the affix and prefix 。But for this
> language, i can't just remove them simply(My supervisor said so).
>
> what i should do  is:
> If User input a query like : " root + affix1+ affix2",  It means "root" is
> the most important , "affix1" and "affix2" are following "root".
> If "root + affix1 + affix2" is founded in the doc, it is best result.  If
> not "root + affix1"matched is Better , If not "A"matched is also OK.
>
> How can I construct my query and search by using exist API?
> Evey advice is appreciate! Thank you very much!
>
>   Sincerely
> Scott Lei
>

---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
For additional commands, e-mail: java-user-help@lucene.apache.org


Mime
View raw message