Loading src/main/java/edu/bu/LanguageCorrection/MainApp.java +2 −2 Original line number Diff line number Diff line Loading @@ -173,7 +173,7 @@ public class MainApp extends JFrame { if (isFile) { content = new String(Files.readAllBytes(Paths.get(text))); } else { content = text; content = text.toLowerCase(); } // Assume content is already properly split into sentences here Loading Loading @@ -273,7 +273,7 @@ public class MainApp extends JFrame { if (isFile) content= new String(Files.readAllBytes(Paths.get(input))); else content = input; content = input.toLowerCase(); Corrector corrector = new Corrector(languageFile); Consumer<String> outputCallback = output -> { resultArea.append(output); Loading src/main/java/edu/bu/LanguageCorrection/TrieNode.java +1 −1 Original line number Diff line number Diff line Loading @@ -19,7 +19,7 @@ public class TrieNode implements Serializable, Cloneable { continue; } past = current; current = current.children.computeIfAbsent(word, c -> new TrieNode()); current = current.children.computeIfAbsent(word.toLowerCase(), c -> new TrieNode()); } current.count += 1; past.childCounts += 1; Loading Loading
src/main/java/edu/bu/LanguageCorrection/MainApp.java +2 −2 Original line number Diff line number Diff line Loading @@ -173,7 +173,7 @@ public class MainApp extends JFrame { if (isFile) { content = new String(Files.readAllBytes(Paths.get(text))); } else { content = text; content = text.toLowerCase(); } // Assume content is already properly split into sentences here Loading Loading @@ -273,7 +273,7 @@ public class MainApp extends JFrame { if (isFile) content= new String(Files.readAllBytes(Paths.get(input))); else content = input; content = input.toLowerCase(); Corrector corrector = new Corrector(languageFile); Consumer<String> outputCallback = output -> { resultArea.append(output); Loading
src/main/java/edu/bu/LanguageCorrection/TrieNode.java +1 −1 Original line number Diff line number Diff line Loading @@ -19,7 +19,7 @@ public class TrieNode implements Serializable, Cloneable { continue; } past = current; current = current.children.computeIfAbsent(word, c -> new TrieNode()); current = current.children.computeIfAbsent(word.toLowerCase(), c -> new TrieNode()); } current.count += 1; past.childCounts += 1; Loading