Apache Lucene QueryParsers.
This module provides a number of queryparsers:
A Simple Lucene QueryParser implemented with JavaCC.
QueryParser that passes Fuzzy-, Prefix-, Range-, and WildcardQuerys through the given analyzer.
QueryParser which permits complex phrase query syntax eg “(john jon jonathan~) peters*”
Extendable QueryParser provides a simple and flexible extension mechanism by overloading query field names.
This project contains the new Lucene query parser implementation, which matches the syntax of the core QueryParser but offers a more modular architecture to enable customization.
It's currently divided in 2 main packages: * xref:Lucene.Net.QueryParsers.Flexible.Core: it contains the query parser API classes, which should be extended by query parser implementations. * xref:Lucene.Net.QueryParsers.Flexible.Standard: it contains the current Lucene query parser implementation using the new query parser API.
Full support for boolean logic (not enabled)
QueryNode Trees - support for several syntaxes, that can be converted into similar syntax QueryNode trees.
QueryNode Processors - Optimize, validate, rewrite the QueryNode trees
Processors Pipelines - Select your favorite Processor and build a processor pipeline, to implement the features you need
Config Interfaces - Allow the consumer of the Query Parser to implement a diff Config Handler Objects to suite their needs.
Standard Builders - convert QueryNode's into several lucene representations. Supported conversion is using a 2.4 compatible logic
QueryNode tree's can be converted to a lucene 2.4 syntax string, using toQueryString
This new query parser was designed to have very generic architecture, so that it can be easily used for different products with varying query syntaxes. This code is much more flexible and extensible than the Lucene query parser in 2.4.X.
The new query parser goal is to separate syntax and semantics of a query. E.g. ‘a AND b’, ‘+a +b’, ‘AND(a,b)’ could be different syntaxes for the same query. It distinguishes the semantics of the different query components, e.g. whether and how to tokenize/lemmatize/normalize the different terms or which Query objects to create for the terms. It allows to write a parser with a new syntax, while reusing the underlying semantics, as quickly as possible.
The query parser has three layers and its core is what we call the QueryNode tree. It is a tree that initially represents the syntax of the original query, e.g. for ‘a AND b’:
AND
/ \
A B
The three layers are:
Furthermore, the query parser uses flexible configuration objects. It also uses message classes that allow to attach resource bundles. This makes it possible to translate messages, which is an important feature of a query parser.
This design allows to develop different query syntaxes very quickly.
The classic Lucene query parser is located under xref:Lucene.Net.QueryParsers.Classic.
To make it simpler to use the new query parser the class xref:Lucene.Net.QueryParsers.Flexible.Standard.StandardQueryParser may be helpful, specially for people that do not want to extend the Query Parser. It uses the default Lucene query processors, text parser and builders, so you don't need to worry about dealing with those.
xref:Lucene.Net.QueryParsers.Flexible.Standard.StandardQueryParser usage:
StandardQueryParser qpHelper = new StandardQueryParser();
StandardQueryConfigHandler config = qpHelper.getQueryConfigHandler();
config.setAllowLeadingWildcard(true);
config.setAnalyzer(new WhitespaceAnalyzer());
Query query = qpHelper.parse("apache AND lucene", "defaultField");
A QueryParser that supports the Span family of queries as well as pre and infix notation.
A QueryParser that produces Lucene Query objects from XML streams.