User Friendly Data Searching?

In an Intellectual property protection patents play an important role. Patent search attracted user’s attention due to important operation for finding existing relevant patents and validating a new patent application. But many users have limited knowledge about the underlying patents, and they have to use a try-and-see approach to repeatedly issue different queries and check answers, which is a very difficult process. To overcome this problem our proposed system introduces a new user-friendly approach for patent search to find the relevant patents more easily and improve user search experience. Here proposed system uses three efficient techniques to improve the usability of patent search: error correction, Topic-based query suggestion and query expansion. We also study how to efficiently find relevant answers from a large collection of patents. For this, first partition patents into small partitions based to their topics and classes. Then given a query, we find highly relevant partitions and answer the query in each of such highly relevant partitions. Finally we combine the answers of each partition and generate top answers of the patent-search query.