I wonder what happens if you ensure that none of your synonyms contains a
character that WDGF cares about. Then they would operate on a disjoint set
of tokens, and maybe they would (or could be made to) play nicely together?
Even if they hate each other (maybe they detect token graphs and fail even
Thanks Eric for your response
So I guess the answer to Shawn Heisey’s question [1] :
"Since multiple Graph filters cannot be used in an analysis chain, what is
somebody running 8.0 supposed to do if they need both the WordDelimiter filter
and Synonym filter in their analysis chain? »
is to hav
It's, well, undefined. As in nobody knows except that it'll be wrong.
And exactly what the results are may change with any given release.
Best,
Erick
On Sun, Feb 10, 2019 at 10:48 AM lambda.coder lucene
wrote:
>
> Hello,
>
> The Javadocs of SynonymGraphFilter says that it can’t consume an incomi
Thanks Michael. I think this clears my questions.
Best regards
On 9/12/18 8:23 PM, Michael Sokolov wrote:
Usually one will either apply synonyms at index time or apply them at query
time, but not both. I think the situation is that you will get most correct
behavior, respecting synonym graph s
Usually one will either apply synonyms at index time or apply them at query
time, but not both. I think the situation is that you will get most correct
behavior, respecting synonym graph structure, with query time synonyms.
Index time synonyms may give better performance, but at the cost of some
o
So, the below statement suggests this?
"To get fully correct positional queries when your synonym replacements
are multiple tokens, you should instead apply synonyms using this
TokenFilter at query time and translate the resulting graph to a
TermAutomatonQuery e.g. using TokenStreamToTermAuto
Any examples on the following note on the Javadocs at
https://lucene.apache.org/core/6_4_1/analyzers-common/org/apache/lucene/analysis/synonym/SynonymGraphFilter.html
Quoted from the above url:
*/However, if you use this during indexing, you must follow it with
FlattenGraphFilter to squash to
Mike,-
Great article, thanks for that; and i was exactly thinking about reverse
mapping when
i was writing this question. i guess Lucene would be nicer to both
mappings when one is called for or another parameter to activate this
double mapping.
My next question is: can a synonmy be separ
Try reading the blog post I wrote about token stream graphs?
http://blog.mikemccandless.com/2012/04/lucenes-tokenstreams-are-actually.html
Mike McCandless
http://blog.mikemccandless.com
On Tue, Sep 11, 2018 at 1:35 PM, wrote:
> Any comments please?
>
> Thanks
>
>
> On 9/10/18 5:07 PM, baris.k
Any comments please?
Thanks
On 9/10/18 5:07 PM, baris.ka...@oracle.com wrote:
Any examples on this? i think it would be nice if Javadocs had an
example on this:
However, if you use this during indexing, you must follow it with
FlattenGraphFilter to squash tokens on top of one another like
Any examples on this? i think it would be nice if Javadocs had an
example on this:
However, if you use this during indexing, you must follow it with
FlattenGraphFilter to squash tokens on top of one another like
SynonymFilter, because the indexer can't directly consume a graph. To
get fully c
11 matches
Mail list logo
