- upgraded to ANTLR 4.1 (4.2 and 4.3 lack a needed class and maven-plugin not yet released for 4.4)
- content filters in collection queries
diff --git a/pom.xml b/pom.xml
index d31e6af..d799a1f 100644
--- a/pom.xml
+++ b/pom.xml
@@ -23,9 +23,14 @@
<dependency>
<groupId>org.antlr</groupId>
<artifactId>antlr4-runtime</artifactId>
- <version>4.0</version>
+ <version>4.1</version>
</dependency>
<dependency>
+ <groupId>org.antlr</groupId>
+ <artifactId>antlr4-maven-plugin</artifactId>
+ <version>4.1</version>
+ </dependency>
+ <dependency>
<groupId>com.google.guava</groupId>
<artifactId>guava</artifactId>
<version>15.0</version>
@@ -90,7 +95,7 @@
-->
<groupId>org.antlr</groupId>
<artifactId>antlr4-maven-plugin</artifactId>
- <version>4.0</version>
+ <version>4.1</version>
<configuration>
<sourceDirectory>${basedir}/src/main/antlr</sourceDirectory>
<outputDirectory>${basedir}/src/main/java/de/ids_mannheim/korap/query/serialize/util</outputDirectory>
diff --git a/src/main/antlr/CollectionQuery.g4 b/src/main/antlr/CollectionQuery.g4
index 226e065..3d6aaa8 100644
--- a/src/main/antlr/CollectionQuery.g4
+++ b/src/main/antlr/CollectionQuery.g4
@@ -4,25 +4,40 @@
/*
-- author: jbingel
- -- date: 14-05-11
+ -- date: 2014-05-11
*/
/*
* LEXER SECTION
*/
+/*
+ Regular expression
+ /x allows submatches like /^.*?RE.*?$/
+ /X forces full matches
+ /i means case insensitivity
+ /I forces case sensitivity
+*/
+FLAG_xi : '/' ( ('x'|'X') ('i'|'I')? );
+FLAG_ix : '/' ( ('i'|'I') ('x'|'X')? );
+
+
LRB : '(';
RRB : ')';
+LB : '[';
+RB : ']';
LT : '<';
GT : '>';
LEQ : '<=';
GEQ : '>=';
EQ : '=';
-NE : '!=';
AND : '&' | 'AND' | 'and' | 'UND' | 'und' ;
OR : '|' | 'OR' | 'or' | 'ODER' | 'oder' ;
+NEG : '!';
QMARK : '?';
SLASH : '/';
+COLON : ':';
DASH : '-';
+TILDE : '~';
WS : ( ' ' | '\t' | '\r' | '\n' )+ -> skip ;
fragment NO_RE : ~[ \t\/];
fragment ALPHABET : ~('\t' | ' ' | '/' | '*' | '?' | '+' | '{' | '}' | '[' | ']'
@@ -35,6 +50,7 @@
WORD : ALPHABET+;
+
/*
* Regular expressions
*/
@@ -63,15 +79,56 @@
: DIGIT DIGIT DIGIT DIGIT (DASH DIGIT DIGIT (DASH DIGIT DIGIT)?)?
;
-conj
-: AND | OR;
-
operator
-: EQ | NE | LT | GT | LEQ | GEQ;
+: (NEG? EQ) | LT | GT | LEQ | GEQ;
expr
-: (value operator)? field operator value
-//| LRB expr RRB
+: meta
+| token
+;
+
+meta
+: (value operator)? field operator value
+;
+
+token
+: LB (term|termGroup) RB
+;
+
+term
+: NEG* (foundry SLASH)? layer termOp key (COLON value)? flag?
+;
+
+termOp
+: (NEG? EQ? EQ | NEG? TILDE? TILDE)
+;
+
+termGroup
+: (term | LRB termGroup RRB) booleanOp (term | LRB termGroup RRB | termGroup)
+;
+
+key
+: WORD
+| regex
+| NUMBER
+;
+
+foundry
+: WORD
+;
+
+layer
+: WORD
+;
+
+booleanOp
+: AND
+| OR
+;
+
+flag
+: FLAG_xi
+| FLAG_ix
;
field
@@ -86,11 +143,8 @@
| regex
;
-
-
relation
-: (expr|exprGroup) conj (expr|exprGroup|relation)
-//| LRB relation RRB
+: (expr|exprGroup) booleanOp (expr|exprGroup|relation)
;
exprGroup
@@ -98,7 +152,7 @@
;
start
-: ( expr
- | exprGroup
- | relation )
+: expr EOF
+| exprGroup EOF
+| relation EOF
;
\ No newline at end of file
diff --git a/src/main/java/de/ids_mannheim/korap/query/serialize/CollectionQueryTree.java b/src/main/java/de/ids_mannheim/korap/query/serialize/CollectionQueryTree.java
index e47c7e5..4c663e2 100644
--- a/src/main/java/de/ids_mannheim/korap/query/serialize/CollectionQueryTree.java
+++ b/src/main/java/de/ids_mannheim/korap/query/serialize/CollectionQueryTree.java
@@ -4,7 +4,7 @@
import de.ids_mannheim.korap.query.serialize.util.CollectionQueryParser;
import de.ids_mannheim.korap.util.QueryException;
import org.antlr.v4.runtime.*;
-import org.antlr.v4.runtime.tree.ParseTree;
+import org.antlr.v4.runtime.tree.*;
import java.lang.reflect.Method;
import java.util.*;
@@ -44,7 +44,6 @@
} else {
throw new NullPointerException("Parser has not been instantiated!");
}
- requestMap.put("@type", "korap:filter");
System.out.println("Processing collection query");
if (verbose) System.out.println(tree.toStringTree(parser));
processNode(tree);
@@ -72,7 +71,7 @@
if (nodeCat.equals("relation")) {
String operator = node.getChild(1).getChild(0).toStringTree(parser).equals("&") ? "and" : "or";
- LinkedHashMap<String, Object> relationGroup = makeDocGroup(operator);
+ LinkedHashMap<String, Object> relationGroup = makeGroup(operator);
putIntoSuperObject(relationGroup);
objectStack.push(relationGroup);
stackedObjects++;
@@ -85,7 +84,7 @@
// stackedObjects++;
// }
- if (nodeCat.equals("expr")) {
+ if (nodeCat.equals("meta")) {
ParseTree fieldNode = getFirstChildWithCat(node, "field");
String field = fieldNode.getChild(0).toStringTree(parser);
List<ParseTree> operatorNodes = getChildrenWithCat(node, "operator");
@@ -95,24 +94,24 @@
LinkedHashMap<String, Object> term = makeDoc();
term.put("key", field);
term.putAll(parseValue(valueNodes.get(0)));
- String match = operatorNodes.get(0).getChild(0).toStringTree(parser);
+ String match = operatorNodes.get(0).getText();
term.put("match", "match:" + interpretMatch(match));
putIntoSuperObject(term);
} else { // (valueNodes.size()==2)
- LinkedHashMap<String, Object> termGroup = makeDocGroup("and");
+ LinkedHashMap<String, Object> termGroup = makeGroup("and");
ArrayList<Object> termGroupOperands = (ArrayList<Object>) termGroup.get("operands");
LinkedHashMap<String, Object> term1 = makeDoc();
term1.put("key", field);
term1.putAll(parseValue(valueNodes.get(0)));
- String match1 = operatorNodes.get(0).getChild(0).toStringTree(parser);
+ String match1 = operatorNodes.get(0).getText();
term1.put("match", "match:" + invertInequation(interpretMatch(match1)));
termGroupOperands.add(term1);
LinkedHashMap<String, Object> term2 = makeDoc();
term2.put("key", field);
term2.putAll(parseValue(valueNodes.get(1)));
- String match2 = operatorNodes.get(1).getChild(0).toStringTree(parser);
+ String match2 = operatorNodes.get(1).getText();
term2.put("match", "match:" + interpretMatch(match2));
termGroupOperands.add(term2);
@@ -120,6 +119,52 @@
}
}
+
+ if (nodeCat.equals("token")) {
+ LinkedHashMap<String,Object> token = makeToken();
+ // handle negation
+ List<ParseTree> negations = getChildrenWithCat(node, "!");
+ boolean negated = false;
+ boolean isRegex = false;
+ if (negations.size() % 2 == 1) negated = true;
+ if (getNodeCat(node.getChild(0)).equals("key")) {
+ // no 'term' child, but direct key specification: process here
+ LinkedHashMap<String,Object> term = makeTerm();
+
+ String key = node.getChild(0).getText();
+ if (getNodeCat(node.getChild(0).getChild(0)).equals("regex")) {
+ isRegex = true;
+ term.put("type", "type:regex");
+ key = key.substring(1,key.length()-1);
+ }
+ term.put("layer", "orth");
+ term.put("key", key);
+ String matches = negated ? "ne" : "eq";
+ term.put("match", "match:"+matches);
+ ParseTree flagNode = getFirstChildWithCat(node, "flag");
+ if (flagNode != null) {
+ String flag = getNodeCat(flagNode.getChild(0)).substring(1); //substring removes leading slash '/'
+ if (flag.contains("i")) term.put("caseInsensitive", true);
+ else if (flag.contains("I")) term.put("caseInsensitive", false);
+ if (flag.contains("x")) {
+ term.put("type", "type:regex");
+ if (!isRegex) {
+ key = QueryUtils.escapeRegexSpecialChars(key);
+ }
+ term.put("key", ".*?"+key+".*?"); // overwrite key
+ }
+ }
+ token.put("wrap", term);
+ } else {
+ // child is 'term' or 'termGroup' -> process in extra method
+ LinkedHashMap<String,Object> termOrTermGroup = parseTermOrTermGroup(node.getChild(1), negated);
+ token.put("wrap", termOrTermGroup);
+ }
+ putIntoSuperObject(token);
+ visited.add(node.getChild(0));
+ visited.add(node.getChild(2));
+ }
+
objectsToPop.push(stackedObjects);
/*
@@ -218,10 +263,104 @@
topObjectOperands.add(object);
} else {
// I want the raw object, not a wrapped
- requestMap.put("filter", object);
+// requestMap.put("filter", object);
+ requestMap = object;
}
}
+ private LinkedHashMap<String, Object> parseTermOrTermGroup(
+ ParseTree node, boolean negated) {
+ return parseTermOrTermGroup(node, negated, "token");
+ }
+
+ /**
+ * Parses a (term) or (termGroup) node
+ * @param node
+ * @param negatedGlobal Indicates whether the term/termGroup is globally negated, e.g. through a negation
+ * operator preceding the related token like "![base=foo]". Global negation affects the term's "match" parameter.
+ * @return A term or termGroup object, depending on input
+ */
+ @SuppressWarnings("unchecked")
+ private LinkedHashMap<String, Object> parseTermOrTermGroup(ParseTree node, boolean negatedGlobal, String mode) {
+ if (getNodeCat(node).equals("term")) {
+ String key = null;
+ LinkedHashMap<String,Object> term = makeTerm();
+ // handle negation
+ boolean negated = negatedGlobal;
+ boolean isRegex = false;
+ List<ParseTree> negations = getChildrenWithCat(node, "!");
+ if (negations.size() % 2 == 1) negated = !negated;
+ // retrieve possible nodes
+ ParseTree keyNode = getFirstChildWithCat(node, "key");
+ ParseTree valueNode = getFirstChildWithCat(node, "value");
+ ParseTree layerNode = getFirstChildWithCat(node, "layer");
+ ParseTree foundryNode = getFirstChildWithCat(node, "foundry");
+ ParseTree termOpNode = getFirstChildWithCat(node, "termOp");
+ ParseTree flagNode = getFirstChildWithCat(node, "flag");
+ // process foundry
+ if (foundryNode != null) term.put("foundry", foundryNode.getText());
+ // process layer: map "base" -> "lemma"
+ if (layerNode != null) {
+ String layer = layerNode.getText();
+ if (layer.equals("base")) layer="lemma";
+ if (mode.equals("span")) term.put("key", layer);
+ else term.put("layer", layer);
+ }
+ // process key: 'normal' or regex?
+ key = keyNode.getText();
+ if (getNodeCat(keyNode.getChild(0)).equals("regex")) {
+ isRegex = true;
+ term.put("type", "type:regex");
+ key = key.substring(1, key.length()-1); // remove leading and trailing quotes
+ }
+ if (mode.equals("span")) term.put("value", key);
+ else term.put("key", key);
+ // process value
+ if (valueNode != null) term.put("value", valueNode.getText());
+ // process operator ("match" property)
+ if (termOpNode != null) {
+ String termOp = termOpNode.getText();
+ negated = termOp.contains("!") ? !negated : negated;
+ if (!negated) term.put("match", "match:eq");
+ else term.put("match", "match:ne");
+ }
+ // process possible flags
+ if (flagNode != null) {
+ String flag = getNodeCat(flagNode.getChild(0)).substring(1); //substring removes leading slash '/'
+ if (flag.contains("i")) term.put("caseInsensitive", true);
+ else if (flag.contains("I")) term.put("caseInsensitive", false);
+ if (flag.contains("x")) {
+ if (!isRegex) {
+ key = QueryUtils.escapeRegexSpecialChars(key);
+ }
+ term.put("key", ".*?"+key+".*?"); // flag 'x' allows submatches: overwrite key with appended .*?
+ term.put("type", "type:regex");
+ }
+ }
+ return term;
+ } else {
+ // For termGroups, establish a boolean relation between operands and recursively call this function with
+ // the term or termGroup operands
+ LinkedHashMap<String,Object> termGroup = null;
+ ParseTree leftOp = null;
+ ParseTree rightOp = null;
+ // check for leading/trailing parantheses
+ if (!getNodeCat(node.getChild(0)).equals("(")) leftOp = node.getChild(0);
+ else leftOp = node.getChild(1);
+ if (!getNodeCat(node.getChild(node.getChildCount()-1)).equals(")")) rightOp = node.getChild(node.getChildCount()-1);
+ else rightOp = node.getChild(node.getChildCount()-2);
+ // establish boolean relation
+ ParseTree boolOp = getFirstChildWithCat(node, "booleanOp");
+ String operator = boolOp.getText().equals("&") ? "and" : "or";
+ termGroup = makeTermGroup(operator);
+ ArrayList<Object> operands = (ArrayList<Object>) termGroup.get("operands");
+ // recursion with left/right operands
+ operands.add(parseTermOrTermGroup(leftOp, negatedGlobal, mode));
+ operands.add(parseTermOrTermGroup(rightOp, negatedGlobal, mode));
+ return termGroup;
+ }
+ }
+
private ParserRuleContext parseCollectionQuery(String p) throws QueryException {
Lexer collectionQueryLexer = new CollectionQueryLexer((CharStream) null);
ParserRuleContext tree = null;
@@ -259,10 +398,10 @@
query = "(1990<year<2010&genre=Sport)|textClass=politk";
query = "(textClass=wissenschaft & textClass=politik) | textClass=ausland";
query = "1990<year<2010 & genre=Sport";
- query = "(textClass=Sport | textClass=ausland) & corpusID=WPD";
- query = "textClass=Sport";
+ query = "1990<year<2010";
+ query = "year=2010 ";
CollectionQueryTree filter = new CollectionQueryTree();
- filter.verbose = true;
+// filter.verbose = true;
try {
filter.process(query);
} catch (QueryException e) {
diff --git a/src/main/java/de/ids_mannheim/korap/query/serialize/ExpertFilter.java b/src/main/java/de/ids_mannheim/korap/query/serialize/ExpertFilter.java
deleted file mode 100644
index 8cb87c7..0000000
--- a/src/main/java/de/ids_mannheim/korap/query/serialize/ExpertFilter.java
+++ /dev/null
@@ -1,311 +0,0 @@
-package de.ids_mannheim.korap.query.serialize;
-
-import de.ids_mannheim.korap.query.serialize.util.CollectionQueryParser;
-import de.ids_mannheim.korap.query.serialize.util.CollectionQueryLexer;
-import de.ids_mannheim.korap.util.QueryException;
-
-import java.lang.reflect.Method;
-import java.util.*;
-import java.util.regex.Matcher;
-import java.util.regex.Pattern;
-
-import org.antlr.v4.runtime.ANTLRInputStream;
-import org.antlr.v4.runtime.BailErrorStrategy;
-import org.antlr.v4.runtime.CharStream;
-import org.antlr.v4.runtime.CommonTokenStream;
-import org.antlr.v4.runtime.Lexer;
-import org.antlr.v4.runtime.Parser;
-import org.antlr.v4.runtime.ParserRuleContext;
-import org.antlr.v4.runtime.tree.ParseTree;
-import org.slf4j.LoggerFactory;
-
-/**
- * @author bingel
- * @date 12/05/2014
- */
-public class ExpertFilter extends Antlr4AbstractSyntaxTree {
-
- private org.slf4j.Logger log = LoggerFactory
- .getLogger(ExpertFilter.class);
-
- private Parser parser;
- private boolean verbose = false;
- private List<ParseTree> visited = new ArrayList<ParseTree>();
- /**
- * Top-level map representing the whole request.
- */
- LinkedHashMap<String,Object> requestMap = new LinkedHashMap<String,Object>();
- /**
- * Keeps track of active object.
- */
- LinkedList<LinkedHashMap<String,Object>> objectStack = new LinkedList<LinkedHashMap<String,Object>>();
- /**
- * Keeps track of open node categories
- */
- LinkedList<String> openNodeCats = new LinkedList<String>();
- /**
- * Keeps track of how many objects there are to pop after every recursion of {@link #processNode(ParseTree)}
- */
- LinkedList<Integer> objectsToPop = new LinkedList<Integer>();
- Integer stackedObjects = 0;
-
-
- public ExpertFilter() {
- }
-
- @Override
- public void process(String query) throws QueryException {
- ParseTree tree = parseCollectionQuery(query);
- if (this.parser != null) {
- super.parser = this.parser;
- } else {
- throw new NullPointerException("Parser has not been instantiated!");
- }
-
- log.info("Processing collection query: "+query);
- if (verbose) System.out.println(tree.toStringTree(parser));
- requestMap.put("@type", "korap:filter");
- processNode(tree);
- log.info(requestMap.toString());
- }
-
- private void processNode(ParseTree node) {
- // Top-down processing
- String nodeCat = getNodeCat(node);
- openNodeCats.push(nodeCat);
-
- stackedObjects = 0;
-
- if (verbose) {
- System.err.println(" "+objectStack);
- System.out.println(openNodeCats);
- }
-
- /*
- ****************************************************************
- ****************************************************************
- * Processing individual node categories *
- ****************************************************************
- ****************************************************************
- */
-
- if (nodeCat.equals("andGroup")) {
- LinkedHashMap<String, Object> exprGroup = makeTermGroup("and");
- objectStack.push(exprGroup);
- stackedObjects++;
- putIntoSuperObject(exprGroup,1);
- }
-
- if (nodeCat.equals("orGroup")) {
- LinkedHashMap<String, Object> exprGroup = makeTermGroup("or");
- objectStack.push(exprGroup);
- stackedObjects++;
- putIntoSuperObject(exprGroup,1);
- }
-
- if (nodeCat.equals("expr")) {
- ParseTree fieldNode = getFirstChildWithCat(node, "field");
- String field = fieldNode.getChild(0).toStringTree(parser);
- List<ParseTree> operatorNodes = getChildrenWithCat(node, "operator");
- List<ParseTree> valueNodes = getChildrenWithCat(node, "value");
-
- if (valueNodes.size()==1) {
- LinkedHashMap<String, Object> term = makeTerm();
- term.put("attribute", field);
- term.putAll(parseValue(valueNodes.get(0)));
- String match = operatorNodes.get(0).getChild(0).toStringTree(parser);
- term.put("match", "match:"+interpretMatch(match));
- putIntoSuperObject(term);
- } else { // (valueNodes.size()==2)
- LinkedHashMap<String, Object> termGroup = makeTermGroup("and");
- @SuppressWarnings("unchecked")
- ArrayList<Object> termGroupOperands = (ArrayList<Object>) termGroup.get("operands");
-
- LinkedHashMap<String, Object> term1 = makeTerm();
- term1.put("attribute", field);
- term1.putAll(parseValue(valueNodes.get(0)));
- String match1 = operatorNodes.get(0).getChild(0).toStringTree(parser);
- term1.put("match", "match:"+invertInequation(interpretMatch(match1)));
- termGroupOperands.add(term1);
-
- LinkedHashMap<String, Object> term2 = makeTerm();
- term2.put("attribute", field);
- term2.putAll(parseValue(valueNodes.get(1)));
- String match2 = operatorNodes.get(1).getChild(0).toStringTree(parser);
- term2.put("match", "match:"+interpretMatch(match2));
- termGroupOperands.add(term2);
-
- putIntoSuperObject(termGroup);
- }
-
- }
-
- objectsToPop.push(stackedObjects);
-
- /*
- ****************************************************************
- ****************************************************************
- * recursion until 'request' node (root of tree) is processed *
- ****************************************************************
- ****************************************************************
- */
- for (int i=0; i<node.getChildCount(); i++) {
- ParseTree child = node.getChild(i);
- processNode(child);
- }
-
- /*
- **************************************************************
- * Stuff that happens after processing the children of a node *
- **************************************************************
- */
-
- if (!objectsToPop.isEmpty()) {
- int toPop = objectsToPop.pop();
- for (int i=0; i<toPop; i++) {
- objectStack.pop();
- }
- }
- openNodeCats.pop();
-
-
- }
-
-
-
- private LinkedHashMap<String, Object> parseValue(ParseTree node) {
- LinkedHashMap<String, Object> map = new LinkedHashMap<String, Object>();
- String key = "";
- if (getNodeCat(node.getChild(0)).equals("regex")) {
- key = node.getChild(0).getChild(0).toStringTree(parser);
- key = key.substring(1,key.length()-1); //remove leading and trailing slashes
- map.put("key", key);
- map.put("type", "type:regex");
- }
- else {
- if (node.getChildCount() == 1) {
- key = node.getChild(0).toStringTree(parser);
- } else {
- Pattern p = Pattern.compile("\" (.*) \"");
- Matcher m = p.matcher(node.toStringTree(parser));
- if (m.find()) {
- key = m.group(1);
- }
- }
- map.put("key", key);
- }
- return map;
- }
-
- private String interpretMatch(String match) {
- String out = null;
- if (match.equals("<")) {
- out = "lt";
- } else if (match.equals(">")) {
- out = "gt";
- } else if (match.equals("<=")) {
- out = "leq";
- } else if (match.equals(">=")) {
- out = "geq";
- } else if (match.equals("=")) {
- out = "eq";
- } else if (match.equals("!=")) {
- out = "ne";
- }
- return out;
- }
-
- private String invertInequation(String op) {
- String inv = null;
- if (op.equals("lt")) {
- inv = "gt";
- } else if (op.equals("leq")) {
- inv = "geq";
- } else if (op.equals("gt")) {
- inv = "lt";
- } else if (op.equals("geq")) {
- inv = "leq";
- }
- return inv;
- }
-
- private void putIntoSuperObject(LinkedHashMap<String, Object> object) {
- putIntoSuperObject(object, 0);
- }
-
- @SuppressWarnings({ "unchecked" })
- private void putIntoSuperObject(LinkedHashMap<String, Object> object, int objStackPosition) {
- if (objectStack.size()>objStackPosition) {
- ArrayList<Object> topObjectOperands = (ArrayList<Object>) objectStack.get(objStackPosition).get("operands");
- topObjectOperands.add(object);
-
- } else {
- requestMap.put("filter", object);
- }
- }
-
- private ParserRuleContext parseCollectionQuery (String p) throws QueryException {
- Lexer collectionQueryLexer = new CollectionQueryLexer((CharStream)null);
- ParserRuleContext tree = null;
- // Like p. 111
- try {
-
- // Tokenize input data
- ANTLRInputStream input = new ANTLRInputStream(p);
- collectionQueryLexer.setInputStream(input);
- CommonTokenStream tokens = new CommonTokenStream(collectionQueryLexer);
- parser = new CollectionQueryParser(tokens);
-
- // Don't throw out erroneous stuff
- parser.setErrorHandler(new BailErrorStrategy());
- parser.removeErrorListeners();
- // Get starting rule from parser
- Method startRule = CollectionQueryParser.class.getMethod("start");
- tree = (ParserRuleContext) startRule.invoke(parser, (Object[])null);
-
- }
- // Some things went wrong ...
- catch (Exception e) {
- System.err.println( e.getMessage() );
- log.error(e.getMessage());
- }
- if (tree == null) {
- log.error("Could not parse expert filter query. Make sure it is correct syntax.");
- throw new QueryException("Could not parse expert filter query. Make sure it is correct syntax.");
- }
- // Return the generated tree
- return tree;
- }
-
-
- @Override
- public Map<String, Object> getRequestMap() {
- return requestMap;
- }
-
-
- public static void main(String[] args) {
- String query = "foo=bar&c=d";
- query = "(1990<year<2010&genre=Sport)|textClass=politk";
- query = "(textClass=wissenschaft & textClass=politik) | textClass=ausland";
- query = "1990<year<2010 oder genre=Sport";
- query = "title=\"Der Titel\"";
- query = "(corpusID=A00 & corpusID=WPD) | textClass=wissenschaft ";
- query = "(corpusID=A00 | corpusID=WPD) & (textClass=wissenschaft & textClass=politik)";
-// query = "corpusID=A00 & corpusID=WPD & textClass=wissenschaft";
-// query = "corpusID=A00 | corpusID=WPD";
- query = "(textClass=wissenschaft & textClass=politik) & (corpusID=A00 | corpusID=WPD)";
- query = "textClass=wissenschaft | (textClass=politik | corpusID=A00)";
- ExpertFilter filter = new ExpertFilter();
- filter.verbose = true;
- try {
- filter.process(query);
- } catch (QueryException e) {
- e.printStackTrace();
- }
- System.out.println(filter.getRequestMap());
-
- }
-
-
-}