Information retrieval has traditionally relied heavily on Boolean searches. The user prepares complex search string by combining Boolean operators like AND, OR, and NOT, proximity operators such as within N number of words, within sentence/paragraph and finally, wildcards or stemming, to create the final search query and retrieve specified data. One advantage of such searches is the ability to narrow down into fine topics and the explainability of the search result against the query. However, constructing search strings using Boolean operators can be tedious, time-consuming, and prone to mistakes such as missing out on relevant synonyms. Search professionals need training on the available patent search fields, how to construct search strings, how to combine them in steps and so on. Also, different databases use varying syntax for operators and different indexing rules for different patent fields due to which the same query rarely yields similar results and therefore must be converted to suit each patent database. This further increases the chances of errors when a user relies on multiple patent databases.