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
Hello,
The Javadocs of SynonymGraphFilter says that it can’t consume an incoming graph
and that the result will be undefined
Is there any example that exhibits the limitations and what is meant by
undefined ?
Regards
Patrick
-
