Do case insensitive search

Author: trivedigaurav

src/frontEnd/serverSide/controller/WordTree_Controller.java

@@ -49,7 +49,7 @@ public Map<String, Object> getWordTree(List<String> reportIDList, String rootWor
 		List<Map<String, Object>> rightList = new ArrayList<>();
 
 //		Pattern sentencePattern = Pattern.compile("([^.:]*?" + rootWord + "[^.\n]*\\.)");
-		Pattern sentencePattern = Pattern.compile(" ([^.:]*?\\b" + rootWord + "\\b[^\n.?!]*)");
+		Pattern sentencePattern = Pattern.compile(" ([^.:]*?\\b" + rootWord + "\\b[^\n.?!]*)", Pattern.CASE_INSENSITIVE);
 		Pattern tokenPattern = Pattern.compile("[\\w']+|[.,!?;]");
 
 
@@ -118,6 +118,8 @@ protected int parseWordTree(String reportText, Pattern sentencePattern,
 		// preprocess
 		reportText = reportText.replaceAll("\r\n", "\n");
 		sentenceMatch = sentencePattern.matcher(reportText);
+		rootWord = rootWord.toLowerCase();
+
 		while (sentenceMatch.find()) {
 			matchCount++;
 			matchedSentence = sentenceMatch.group();
@@ -130,8 +132,12 @@ protected int parseWordTree(String reportText, Pattern sentencePattern,
 						matchedSentence.length() - 1);
 			}
 
+			matchedSentence = matchedSentence.toLowerCase();
+			//System.out.println(matchedSentence);
+
 			// left branch
 			tokenList = new ArrayList<>();
+			
 			branchMatch = tokenPattern.matcher(matchedSentence.substring(0,
 					matchedSentence.indexOf(rootWord)).trim());
 			while (branchMatch.find()) {