public final class SynonymFilter extends TokenFilter
Note that with the current implementation, parsing is greedy, so whenever multiple parses would apply, the rule starting the earliest and parsing the most tokens wins. For example if you have these rules:
a -> x a b -> y b c d -> zThen input
a b c d eparses to
y b c d, ie the 2nd rule "wins" because it started earliest and matched the most input tokens of other rules starting at that point.
A future improvement to this filter could allow non-greedy parsing, such that the 3rd rule would win, and also separately allow multiple parses, such that all 3 rules would match, perhaps even on a rule by rule basis.
NOTE: when a match occurs, the output tokens
associated with the matching rule are "stacked" on top of
the input stream (if the rule had
keepOrig=true) and also on top of another
matched rule's output tokens. This is not a correct
solution, as really the output should be an arbitrary
graph/lattice. For example, with the above match, you
would expect an exact
c" to match the parsed tokens, but it will fail to
do so. This limitation is necessary because Lucene's
TokenStream (and index) cannot yet represent an arbitrary
NOTE: If multiple incoming tokens arrive on the same position, only the first token at that position is used for parsing. Subsequent tokens simply pass through and are not parsed. A future improvement would be to allow these tokens to also be matched.
|Modifier and Type||Field and Description|
|Constructor and Description|
|Modifier and Type||Method and Description|
addAttribute, addAttributeImpl, captureState, clearAttributes, cloneAttributes, copyTo, equals, getAttribute, getAttributeClassesIterator, getAttributeFactory, getAttributeImplsIterator, hasAttribute, hasAttributes, hashCode, reflectAsString, reflectWith, restoreState
public SynonymFilter(TokenStream input, SynonymMap synonyms, boolean ignoreCase)
Copyright © 2000-2012 Apache Software Foundation. All Rights Reserved.