JAVA regex包含在字母中间带点的单词，并包含带点的特殊单词

Question

我有两个问题。第一）是如何包含两个字母之间带有点的单词，比如“C.J.Johnson”；第二）是是否可以创建包含点的单词列表，我的regex将包括它们？基本上，我想用单词搜索文本文件，并列出所有包含这些单词的句子。我的代码：

public void search_sentences() throws FileNotFoundException, IOException {
        //FileReader fr1 = new FileReader(get_File());
        BufferedReader br1 = new BufferedReader(new InputStreamReader(new FileInputStream(get_File()),  "UTF-8"));
        ArrayList<String> words = new ArrayList();
        PrintWriter writer = new PrintWriter("rivit.txt", "UTF-8");
        String str="";
        //String [] words = {};
        String sanat = get_Text();
        for(String w: sanat.split(", ")){
            words.add(w);
        }
        String word_re = words.get(0);

        for (int i = 1; i < words.size(); i++)
                word_re += "|" + words.get(i);
            word_re = "[^.!?]*\\b(" + word_re + ")\\b[^.!?]*[.!?]";
            while(br1.ready()) { str += br1.readLine(); }
            Pattern re = Pattern.compile(word_re, 
                    Pattern.MULTILINE | Pattern.COMMENTS | 
                    Pattern.CASE_INSENSITIVE);
            Matcher match = re.matcher(str);
            String sentenceString="";
            while (match .find()) {
                sentenceString = match.group(0);
                if(!txtFile.isSelected()){
                tekstiAlue.append(sentenceString);
                } else {
                    writer.println(sentenceString);
                }

            }
        writer.close();

    }

我认为第一个问题是可行的。Ive尝试将//s添加到

Answer 1

正如Jeff Holt在评论中所说，“查看pattern.quote()”：

[...]生成一个字符串，该字符串可用于创建与字符串s相匹配的模式，就像它是文字模式一样。

输入序列中的元字符或转义序列将没有特殊含义。

public static List<String> findSentencesContaining(String fullText, String word, String[] specials) {
    Pattern p = buildRegexToFindSentencesContaining(word, specials);
    List<String> sentences = new ArrayList<>();
    for (Matcher m = p.matcher(fullText); m.find(); )
        sentences.add(m.group().replaceAll("\\s+", " ").trim()); // normalize group of whitespace into a single space
    return sentences;
}
public static Pattern buildRegexToFindSentencesContaining(String word, String[] specials) {
    StringJoiner regexText = new StringJoiner("|", "(?:", "|[^.!?])*").setEmptyValue("[^.!?]*");
    for (String s : specials)
        regexText.add(toWordRegex(s));
    String regex = regexText + toWordRegex(word) + regexText + "[.!?]";
    return Pattern.compile(regex, Pattern.CASE_INSENSITIVE | Pattern.UNICODE_CASE);
}
private static String toWordRegex(String word) {
    String regex = Pattern.quote(word);
    if (word.matches("\\b.*"))
        regex = "\\b" + regex;
    if (word.matches(".*\\b"))
        regex = regex + "\\b";
    return regex;
}

String fullText = "This is a test. We're testing that sentences\n" +
                  "can span multiple lines, i.e. that line" +
                  "terminators can appear in a sentence. We're\n" +
                  "also testing that sentences can contain\n" +
                  "special words containing sentence-ending\n" +
                  "\"words\", e.g. \"i.e.\" and \"etc.\". In\n" +
                  "addition, (special) word matching is\n" +
                  "case-insensitive.";
String[] specials = { "i.e.", "e.g.", "etc." };
for (String word : new String[] { "test", "also", "we're", "is", "happy" }) {
    System.out.println("Sentences containing word \"" + word + "\":");
    List<String> sentences = findSentencesContaining(fullText, word, specials);
    if (sentences.isEmpty())
        System.out.println("  ** NOT FOUND");
    else {
        for (String sentence : sentences)
            System.out.println("  " + sentence);
    }
}

输出

Sentences containing word "test":
  This is a test.
Sentences containing word "also":
  We're also testing that sentences can contain special words containing sentence-ending "words", e.g. "i.e." and "etc.".
Sentences containing word "we're":
  We're testing that sentences can span multiple lines, i.e. that lineterminators can appear in a sentence.
  We're also testing that sentences can contain special words containing sentence-ending "words", e.g. "i.e." and "etc.".
Sentences containing word "is":
  This is a test.
  In addition, (special) word matching is case-insensitive.
Sentences containing word "happy":
  ** NOT FOUND