How to implement a regex which tries to find the most similar match in Java?

Question

Given the string "abc xyz def", i want both the strings "abc def" and "def abc" to give a successful match, how can i accomplish this with a regex in Java?

More: The optimal solution maybe would be something similar to the fuzzy search provided by the regex module in python to provide also additional capabilities to the regex.

how do you define that "def abc" is similar to "abc xyz def"? — njzk2, Nov 19 '19 at 04:36

score 0 · Answer 1 · answered Nov 19 '19 at 05:19

What you want is called "groups" in regex. Groups are placed in parenthesis () and can be literal or symbolised regex syntax for types of stipulated characters. java.util.Scanner and other associate Iterator interfaces and classes or java.lang.String and the main package java.util.regex for regular expressions contain tools for group capturing.

String abc = null; // weird but true for building regex into the expression on the fly in a re-callable method
String abc = new String("abc");
// hazard a guess such a data ***mining*** techniques would appear like this to capture groups whether present of not
Pattern p =  "((\b)*"+abc+"(\b)*)*   |   ((\b)*xyz(\b)*)* |  ((\b)*def(\b)*)*";

score -1 · Answer 2 · answered Nov 19 '19 at 05:29

-1

Hope This can help you:

    String regex1 = "(.*)abc(.*)";
    String regex2 = "(.*)def(.*)";
    String s = "abc xyz def";
    if (Pattern.matches(regex1, s) & (Pattern.matches(regex2, s) ) ) {
        System.out.println("Correct");
    }

answered Nov 19 '19 at 05:29

Bhumit Patel

37
7

How to implement a regex which tries to find the most similar match in Java?

2 Answers2