Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to be able to programatically expand users’ search expressions such as:
X w/5 (Y || Z)
to
“X Y”~5 || “X Z”~5
Is there an existing library I can leverage to do this sort of thing? If not, what approach is recommended? This solution would live within a .NET environment.
You will want to take a look at conjuctive normal form http://en.wikipedia.org/wiki/Conjunctive_normal_form and disjunctive normal formhttp://en.wikipedia.org/wiki/Disjunctive_normal_form.
There is an algorithm you can implement as well as a link to a java implementation.