Hi! To begin with, I’m not a tekkie so I dont know how to code and I’m also very bad at visualzation but I can get search for someeone to do the task.
Anyhow, I create long complicated boolean queries. I would like to convert them into visual trees so tthat I can better be able to tell the relationships between keywords. I attached a simple example and a complicated one to give you an idea.
so here the input would be the query = Apple AND <<Citrus (Orange OR Lemon) OR Banana, I want to enter this query as input it and see a tree as an outcome. The tree that would Apple, Citrus, and Bananas as sibling nodes but the connection between Apple and Citrus on the one side as different from the one between Citrus and Banana to show that one connection is “AND” and another is OR… and finally to showa the Citrus node as parenting the Orange and Lemon nodes. This is a simple example but my real life examples would reach the complexity of the other one.