Implements the fuzzy search query. The similarity measurement is based on the Levenshtein (edit distance) algorithm.
More...
|
| FuzzyQuery (const TermPtr &term, double minimumSimilarity, int32_t prefixLength) |
| Create a new FuzzyQuery that will match terms with a similarity of at least minimumSimilarity to term. If a prefixLength > 0 is specified, a common prefix of that length is also required.
|
|
| FuzzyQuery (const TermPtr &term, double minimumSimilarity) |
|
| FuzzyQuery (const TermPtr &term) |
|
virtual | ~FuzzyQuery () |
|
virtual String | getClassName () |
|
boost::shared_ptr< FuzzyQuery > | shared_from_this () |
|
double | getMinSimilarity () |
| Returns the minimum similarity that is required for this query to match.
|
|
int32_t | getPrefixLength () |
| Returns the non-fuzzy prefix length. This is the number of characters at the start of a term that must be identical (not fuzzy) to the query term if the query is to match that term.
|
|
TermPtr | getTerm () |
| Returns the pattern term.
|
|
virtual void | setRewriteMethod (const RewriteMethodPtr &method) |
| Sets the rewrite method to be used when executing the query. You can use one of the four core methods, or implement your own subclass of RewriteMethod .
|
|
virtual QueryPtr | rewrite (const IndexReaderPtr &reader) |
| Called to re-write queries into primitive queries. For example, a PrefixQuery will be rewritten into a BooleanQuery that consists of TermQuerys.
|
|
virtual LuceneObjectPtr | clone (const LuceneObjectPtr &other=LuceneObjectPtr()) |
| Returns a clone of this query.
|
|
virtual String | toString (const String &field) |
| Prints a query to a string, with field assumed to be the default field and omitted.
|
|
virtual int32_t | hashCode () |
| Return hash code for this object.
|
|
virtual bool | equals (const LuceneObjectPtr &other) |
| Return whether two objects are equal.
|
|
| MultiTermQuery () |
|
virtual | ~MultiTermQuery () |
|
boost::shared_ptr< MultiTermQuery > | shared_from_this () |
|
int32_t | getTotalNumberOfTerms () |
| Return the number of unique terms visited during execution of the query. If there are many of them, you may consider using another query type or optimize your total term count in index.
|
|
void | clearTotalNumberOfTerms () |
| Resets the counting of unique terms. Do this before executing the query/filter.
|
|
virtual RewriteMethodPtr | getRewriteMethod () |
|
| Query () |
|
virtual | ~Query () |
|
boost::shared_ptr< Query > | shared_from_this () |
|
virtual void | setBoost (double b) |
| Sets the boost for this query clause to b. Documents matching this clause will (in addition to the normal weightings) have their score multiplied by b.
|
|
virtual double | getBoost () |
| Gets the boost for this clause. Documents matching this clause will (in addition to the normal weightings) have their score multiplied by b. The boost is 1.0 by default.
|
|
virtual String | toString () |
| Prints a query to a string.
|
|
virtual WeightPtr | createWeight (const SearcherPtr &searcher) |
| Constructs an appropriate Weight implementation for this query. Only implemented by primitive queries, which re-write to themselves.
|
|
virtual WeightPtr | weight (const SearcherPtr &searcher) |
| Constructs and initializes a Weight for a top-level query.
|
|
virtual QueryPtr | combine (Collection< QueryPtr > queries) |
| Called when re-writing queries under MultiSearcher.
|
|
virtual void | extractTerms (SetTerm terms) |
| Adds all terms occurring in this query to the terms set. Only works if this query is in its rewritten form.
|
|
virtual SimilarityPtr | getSimilarity (const SearcherPtr &searcher) |
| Returns the Similarity implementation to be used for this query. Subclasses may override this method to specify their own Similarity implementation, perhaps one that delegates through that of the Searcher. By default the Searcher's Similarity implementation is returned.
|
|
String | boostString () |
| Return given boost value as a string.
|
|
virtual | ~LuceneObject () |
|
virtual void | initialize () |
| Called directly after instantiation to create objects that depend on this object being fully constructed.
|
|
virtual int32_t | compareTo (const LuceneObjectPtr &other) |
| Compare two objects.
|
|
virtual | ~LuceneSync () |
|
virtual SynchronizePtr | getSync () |
| Return this object synchronize lock.
|
|
virtual LuceneSignalPtr | getSignal () |
| Return this object signal.
|
|
virtual void | lock (int32_t timeout=0) |
| Lock this object using an optional timeout.
|
|
virtual void | unlock () |
| Unlock this object.
|
|
virtual bool | holdsLock () |
| Returns true if this object is currently locked by current thread.
|
|
virtual void | wait (int32_t timeout=0) |
| Wait for signal using an optional timeout.
|
|
virtual void | notifyAll () |
| Notify all threads waiting for signal.
|
|
Implements the fuzzy search query. The similarity measurement is based on the Levenshtein (edit distance) algorithm.
Warning: this query is not very scalable with its default prefix length of 0 - in this case, every term will be enumerated and cause an edit score calculation.
virtual String Lucene::FuzzyQuery::toString |
( |
const String & |
field | ) |
|
|
virtual |
Prints a query to a string, with field assumed to be the default field and omitted.
The representation used is one that is supposed to be readable by QueryParser
. However, there are the following limitations:
If the query was created by the parser, the printed representation may not be exactly what was parsed. For example, characters that need to be escaped will be represented without the required backslash.
Some of the more complicated queries (eg. span queries) don't have a representation that can be parsed by QueryParser.
Reimplemented from Lucene::Query.