: Thanks for the advice Chris. What I am working on now is extracting the
: matching phrases. The current code for MultiPhraseQuery and SpanQueries
: just return all matching terms, not matching phrases. I implemented some
: code matching up the TermPositions, but this is pretty slow. Is there
Thanks for the advice Chris. What I am working on now is extracting the
matching phrases. The current code for MultiPhraseQuery and SpanQueries
just return all matching terms, not matching phrases. I implemented some
code matching up the TermPositions, but this is pretty slow. Is there any
way
: By custom phrase query class I was trying to ask if it would be possible, or
: even a good idea, to create a modified PhraseQuery class that is more
: efficient that span queries (as I only want to use it for phrases). This
: class might have multiple possible terms generated from a regex at a c
By custom phrase query class I was trying to ask if it would be possible, or
even a good idea, to create a modified PhraseQuery class that is more
efficient that span queries (as I only want to use it for phrases). This
class might have multiple possible terms generated from a regex at a certain
po
: I was wondering if anyone has a more efficient method for achieving this.
: Would changing QueryParser.jj and developing a custom PhraseQuery class be a
: good idea? Any comments would be appreciated.
extending QueryParser and overriding the getPhraseQuery function to return
your own SpanNear
I would like to be able to handle the following:
"/\d\d\d{4} \\d\\d/ office"
Where / indicates a regex expression phrase.
One option is extending MultiFieldQueryParser and catching the phrase within
getFieldQuery evaluating whether /, the regex identifier, is present and
then returning a SpanNe
