SuperBoolean Patent Search Engine Slashes Patent Search Cost, Supports Patent Office’s Commitment to Faster and Higher Quality Patents

Share Article

PatentCafe's new Heuristic Boolean engine relevancy ranks patent search results using a Latent Semantic Analysis database as its expert system. The SuperBoolean™ engine helps patent professionals search patents to discover more prior art faster, create higher quality patent applications, faster patent issuances search cost savings, and helps reduce patent infringement litigation risks.

the early-adopter Fortune 500 companies and government agencies have found that using our SuperBoolean engine to search patents uncovers highly relevant patents that traditional search engines miss. In two recent cases, more than 25 relevant patents were found that traditional commercial patent search engines failed to discover.

Today, intellectual property management software company, PatentCafe anchor text launched the industry’s first Heuristic Boolean, or “SuperBoolean” patent search engine for patent attorneys, professional patent searchers, engineering managers and intellectual property managers.

The extremely powerful Heuristic Boolean engine relevancy ranks patent search results using a Latent Semantic Analysis database as its expert system. The most significant patent search advancement since the introduction of the IBM Patent Search in 1997, PatentCafe’s SuperBoolean engine helps patent professionals discover more prior art faster, resulting in higher quality patent applications, and faster patent issuances.

In July, the US Patent and Trademark Office (USPTO) announced a new proposed rule change intended to encourage patent applicants to provide the USPTO with the most relevant prior art patents related to their inventions. It said that some applicants send a very large number of documents with their applications, tending to obscure the most relevant information. Applicants submitting only the most relevant prior art citations will see their applications get processes more quickly.

Legacy Boolean patent search engines require researchers to craft lengthy, complicated keywords patent search queries using keywords that the researcher hopes will appear in the most relevant documents

But the very process of adding more keywords to a search query, while necessary to pare down the number of search results to a quantity that the researcher can manually review, actually increases the number of missed-but-relevant patents exponentially.

Andy Gibbs, PatentCafe’s CEO notes that “the early-adopter Fortune 500 companies and government agencies have found that using our SuperBoolean engine to search patents uncovers highly relevant patents that traditional search engines miss. In two recent cases, more than 25 relevant patents were found that traditional commercial patent search engines failed to discover.”

PatentCafe’s SuperBoolean engine allows researchers to search with fewer keywords, and see the most relevant patents at the top of the search results list. Not only is the process significantly faster than the old iterative Boolean process, it helps ensure that the fewest relevant patents are missed. The time-saving benefit was estimated by one Beta site to be more than $17,000 annually for each full time researcher.

A searcher who enters the keywords “heated”, “automobile” and “seat”, along with a second, Heuristic query that fully describes the invention being searched, using about 100 words in natural, conversational English, the most relevant patents get listed first, such as “Heated child safety seat” and “Automatic temperature controlled seats”. “Junk” patents that the researcher would otherwise have to sift through are pushed to the bottom of the list.

More importantly, finding the most relevant prior art before filing new patent applications also helps mitigate the risks of the runaway costs of future patent infringement, such as the $480 million award to Paragon Trade Brands by Weyerhaeuser Co., the $465 million award to Lexar by Toshiba, or the now infamous $521 verdict in Eolas verses Microsoft.

SuperBoolean patent search is the latest feature to be added to the company’s Intellectual Capital Office (ICO Suite) of patent research and analysis software applications for enterprise.

A detailed white paper that discusses the Heuristic Boolean search engine is downloadable at:

http://www.patentcafe.com/actionitems/whitepapers/SuperBoolean_whitepaper.pdf

About PatentCafe®

The PatentCafe brand is recognized worldwide as one of the Web’s largest and most innovative intellectual property resources of international patent data and intellectual property management solutions.

PatentCafe publishes the largest line of enterprise-level software applications that help professionals search, develop, manage, exploit, and analyze patents. Its products are used for patent search, patent portfolio management, industry and technology analysis, competitive patent intelligence, and patent-based business information.

Its customers include a Fortune 100 who’s who list, and the world’s most recognized emerging high technology companies, intellectual property law firms and technology investors.

For more information about PatentCafe, for a web-demo of the Heuristic Boolean engine, or to arrange an interview with Mr. Gibbs, please contact:

Elena Lowe, Editor

PatentCafe®

530-671-0200 ext. 203

441 Colusa Avenue

Yuba City, CA 95991

###

Share article on social media or email:

View article via:

Pdf Print

Contact Author

Andy Gibbs
Visit website