(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*

This guide provides a more detailed description of the syntax that is supported along with examples.

This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.

Concept Search - What can I type?

For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.

Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.

Disclosed is
a process which uses hashing to optimize
searches in large RETE "result memories."

The RETE
method is commonly used in pattern matchers, such as
OPS5 production systems, to keep track of partial matches of data
with pattern parts. These partial
matches are stored in look-up
tables referred to as "result memories."

Searches were
originally performed on "result memories" using a
linear search technique. However, linear
searches become inefficient
when the size of the result memory is large.

One way to
speed up the search process is to use a hashing
technique. The hashing algorithm builds
a result memory look-up
table to hold the matched data or "object keys." This is
accomplished in the following manner.

The hashing
algorithm generates a "hash code" from the object
keys which determines the location or address at which the object key
is to be stored. In some cases, the same
"hash code" may be
generated for more than one object key.
This is known as a
"collision." Consequently, the
address identified by the hash code
is already occupied. To avoid
overwriting this data, the colliding
object key is stored instead in the next available sequential
address.

Storing items
in this manner can reduce search time
significantly. To perform a search, the
hashing algorithm merely
generates a hash code for the item or...