Patent ID: 8392436

Claim:
A method for searching for information contained in a database of documents, the method comprising the steps of: in a computer process, predicting parts-of-speech and semantic tags for sentences of the documents in the database; in a computer process, storing the sentences and the tags in an inverted index; requesting information from the database with a query; in a computer process, predicting parts-of-speech and semantic tags for the query; in a computer process, determining a score indicative of the similarity between each of the sentences and the query using the tags corresponding to the sentences stored in the index and the tags corresponding to the query, wherein the similarity between each of the sentences and the query comprises: SENmatch ⁡ ( Q , S ) = ∑ a ∈ PAS ⁢ w ⁡ ( a ) ⁢ max b ∈ PAS ⁡ ( S ) ⁢ PASmatch ⁡ ( a , b ) , ⁢ w ⁡ ( a ) = idf ⁡ ( v a ) ∑ k ∈ PAS ⁡ ( Q ) ⁢ idf ⁡ ( v k ) ⁢ and ⁢ ⁢ PASmatch ⁡ ( a , b ) = V semtfidf T ⁡ ( a ) · V semtfidf ⁡ ( b ) V semtfidf T ⁡ ( a ) ⁢ V semtfigf ⁡ ( a ) ⁢ V semtfidf T ⁡ ( b ) ⁢ V semtfidf ⁡ ( b ) · I ⁡ ( a , b ) , ⁢ I ⁡ ( a , b ) = { 1 , V a ⁢ ⁢ and ⁢ ⁢ V b ⁢ ⁢ are ⁢ ⁢ synonyms 0 , ⁢ otherwise , and wherein Q is the query, S is the sentence, SENmatch(Q, S) is the similarity between the query and the sentence, PAS is a predicate-argument structure of the sentence, idf is inverse document frequency of verb v, PASmatch(a, b) is the similarity between PAS a and PAS b, and V semtfidf is a vector of PAS; in a computer process, ranking the sentences according to their corresponding scores, wherein the sentences with the highest rankings match the semantic meaning of the query.