Search system

Claim 2

A search system for use in a computer system, including: query means for processing a query to the computer system to assign respective weights to terms of said query based on grammatical structure of the query and for generating a query vector including said weights in respective fields for said terms, wherein said query means generates a plurality of sections of terms which form said query, said sections representing grammatical elements and the terms in said sections being allocated to grammatical categories for determining said weights, and parses said sections to select a set of sections forming said query vector, wherein said sections are key-centred phrase structure frames with a key grammatical category and said query means executes frame instantiation on the terms of said query and generates a frame relation graph of said frames, and wherein said query means executes parallel parsing on said frame relation graph to generate a nodal tree structure of the query to generate said query vector; and index means for processing said query vector to output at least one index to data in response to said query.

Claim 3

A search system as claimed in claim 1 , wherein the weights are assigned based on the importance of the terms in said query.

Claim 4

A search system as claimed in claim 1 , wherein said weights are assigned to said query based on the meaning of the terms of the query.

Claim 5

A search system as claimed in claim 1 , wherein said query means analyses said terms using a dictionary and thesaurus of terms of said data, and said respective fields are for terms of said dictionary.

Claim 6

A search system as claimed in claim 1 , wherein said sections are selected on the basis of syntactical structure.

Claim 7

A search system as claimed in claim 1 , wherein said weights are linguistic weights.

Claim 8

A search system as claimed in claim 1 , wherein said query vector has said weights placed in respective fields corresponding to terms of at least one term list.

Claim 9

A search system as claimed in claim 1 , wherein said index means maintains a hierarchal structure of nodes representing said data and indices to said data, said nodes each include a text vector having weights for terms of said data, and leaf nodes of said structure including indices to said data.

Claim 10

A search system as claimed in claim 8 , wherein said index means compares said query vector with the text vectors of said nodes to select said at least one index in response to said query.

Claim 11

A search system as claimed in claim 9 , wherein said comparing is executed from the upper level of the tree structure to the lower level, with paths in the structure being selected on the basis of the comparison between the vectors.

Claim 12

A search system as claimed in claim 1 , including feature extraction means for accessing respective unique and important terms of said data and adding said terms to said dictionary.

Claim 13

A search system as claimed in claim 1 , including feature extraction means for extracting indices and respective terms of said data as term weight pairs, the weights of the pairs being based on the importance and uniqueness of component ngrams of the terms of an indexed document and the terms being extracted on the basis of the distribution of ngrams in said document space and wherein said index means is a neural network generated on the basis of training examples including said term weight pairs.

Claim 14

A search system as claimed in claim 12 , wherein said neural network is a self generating neural network and the format of said query vectors and vectors of nodes of said network is generated on the basis of said training examples.

Claim 15

A search system as claimed in claim 1 , wherein said terms represent one of a word and a phrase.

Claim 16

A search system for use in a computer system, including: query means for processing a query to the computer system to assign respective weights to terms of said query based on grammatical structure of the query and for generating a query vector including said weights in respective fields for said terms; and index means for processing said query vector to output at least one index to data in response to said query, wherein said index means maintains a hierarchal structure of nodes representing said data and indices to said data, said nodes each including a text vector having weights for terms of said data and leaf nodes of said structure including indices to said data, wherein said index means compares said query vector with the text vectors of said nodes to select said at least one index in response to said query, said comparing being executed from an upper level of the hierarchal structure to a lower level, with paths in the structure being selected on the basis of the comparison between the vectors, and wherein said index means obtains the product of said query vector and the text vector of the nodes of a level of said structure, and obtains said product for nodes of a succeeding level of said structure which are connected to nodes for which the product has exceeded a predetermined threshold.

Claim 17

A search system for use in a computer system, including: query means for processing a query to the computer system to assign respective weights to terms of said query based on grammatical structure of the query and for generating a query vector including said weights in respective fields for said terms; and index means for processing said query vector to output at least one index to data in response to said query, wherein said index means maintains a hierarchal structure of nodes representing said data and indices to said data, said nodes each including a text vector having weights for terms of said data and leaf nodes of said structure including indices to said data, wherein said index means compares said query vector with the text vectors of said nodes to select said at least one index in response to said query, said comparing being executed from an upper level of the hierarchal structure to a lower level, with paths in the structure being selected on the basis of the comparison between the vectors, and wherein said index means obtains the product of said query vector and the text vector of the nodes of a level of said structure, and obtains said product for nodes of a succeeding level of said structure which are connected to nodes for which the product has exceeded a predetermined threshold.

Claim 18

A search system as claimed in claim 15 , wherein said query means generates sections of terms which form said query, said sections representing grammatical elements.

Claim 19

A search system as claimed in claim 16 , wherein the terms in said sections are allocated to grammatical categories for determining said weights.

Claim 20

A search system as claimed in claim 17 , wherein said query means generates a plurality of said sections, and parses said sections to select a set of sections forming said query vector.

Claim 21

A search system as claimed in claim 18 , wherein said sections are key centered phrase structure frames with a key grammatical category, and said query means executes frame instantiation on the terms of said query and generates a frame relation graph of said frames.

Claim 22

A search system as claimed in claim 15 , wherein the indices of nodes having a query vector node vector product higher than a predetermined threshold are output by said index means.

Claim 23

A search system as claimed in claim 20 , including cluster means for processing indices output by said index means in response to said query, generating term frequency vectors for data indexed by said indices, comparing similarities between the indexed data on the basis of a distance between said frequency vectors and generating content based categories on the basis of said distances and placing the output indices into said categories for display.

Claim 24

A search system as claimed in claim 21 , including feature extraction means for receiving content features of said categories from said cluster means and selecting a unique descriptive feature for each category.

Claim 25

A search system as claimed in claim 21 , wherein said cluster means generates a plurality of clusters of the indices and determines the quality of each cluster on the basis of inter-cluster distances and intra-cluster distances between term frequency vectors for the indices of the clusters relative to a term frequency vector centroid for each cluster.

Claim 26

A search system as claimed in claim 15 , wherein said index means is a self generating neural network having nodes of weight vectors representing categories and terms of said data, said nodes further including pointers to a first child node and a next sibling node, and leaf nodes of said network including an index to said data.

Claim 27

A search system as claimed in claim 24 , wherein said weights are normalized, and said network is searched in response to a query by determining the inner product of said query vector and said weight vectors to locate nodes producing a high inner product.

Claim 28

A search engine stored on a computer readable storage medium for use in a computer system, including: a query analyser for processing a query to the computer system to assign respective weights to terms of said query based on grammatical structure of the query and for generating a query vector including said weights in respective fields for said terms, wherein said query analyser generates a plurality of sections of terms which form said query, said sections representing grammatical elements and the terms in said sections being allocated to grammatical categories for determining said weights, and parses said sections to select a set of sections forming said query vector, wherein said sections are key-centred phrase structure frames with a key grammatical category and said query analyser executes frame instantiation on the terms of said query and generates a frame relation graph of said frames, and wherein said query analyser executes parallel parsing on said frame relation graph to generate a nodal tree structure of the query to generate said query vector; and an index network for processing said query vector to output at least one index to data in response to said query.

Claim 29

A search engine stored on a computer readable storage medium for use in a computer system, including: a query analyser for processing a query to the computer system to assign respective weights to terms of said query based on grammatical structure of the query and for generating a query vector including said weights in respective fields for said terms, wherein said query analyser generates a plurality of sections of terms which form said query, said sections representing grammatical elements and the terms in said sections being allocated to grammatical categories for determining said weights, and parses said sections to select a set of sections forming said query vector, wherein said sections are key-centred phrase structure frames with a key grammatical category and said query analyser executes frame instantiation on the terms of said query and generates a frame relation graph of said frames, and wherein said query analyser executes parallel parsing on said frame relation graph to generate a nodal tree structure of the query to generate said query vector; and an index network for processing said query vector to output at least one index to data in response to said query.

Claim 30

A search engine as claimed in claim 26 , wherein the weights are assigned based on the importance of the terms in said query.

Claim 31

A search engine as claimed in claim 26 , wherein said weights are assigned to said query based on the meaning of the terms of the query.

Claim 32

A search engine as claimed in claim 26 , wherein said query analyser analyses said terms using a dictionary and thesaurus of terms of said data, and said respective fields are for terms of said dictionary.

Claim 33

A search engine as claimed in claim 26 , wherein said sections are selected on the basis of syntactical structure.

Claim 34

A search engine as claimed in claim 26 , wherein said weights are linguistic weights.

Claim 35

A search engine as claimed in claim 26 , wherein said query vector has said weights placed in respective fields corresponding to terms of at least one term list.

Claim 36

A search engine as claimed in claim 26 , wherein said index network maintains a hierarchal structure of nodes representing said data and indices to said data, said nodes each include a text vector having weights for terms of said data, and leaf nodes of said structure including indices to said data.

Claim 37

A search engine as claimed in claim 33 , wherein said index network compares said query vector with the text vectors of said nodes to select said at least one index in response to said query.

Claim 38

A search engine as claimed in claim 34 , wherein said comparing is executed from the upper level of the tree structure to the lower level, with paths in the structure being selected on the basis of the comparison between the vectors.

Claim 39

A search engine as claimed in claim 26 , including feature extraction means for accessing respective unique and important terms of said data and adding said terms to said dictionary.

Claim 40

A search engine as claimed in claim 26 , including feature extraction means for extracting indices and respective terms of said data as term weight pairs, the weights of the pairs being based on the importance and uniqueness of component ngrams of the terms of an indexed document and the terms being extracted on the basis of the distribution of ngrams in said document space and wherein said index means is a neural network generated on the basis of training examples including said term weight pairs.

Claim 41

A search engine as claimed in claim 37 , wherein said neural network is a self generating neural network and the format of said query vectors and vectors of nodes of said network is generated on the basis of said training examples.

Claim 42

A search engine as claimed in claim 26 , wherein said terms represent one of a word and a phrase.

Claim 43

A search engine stored on a computer readable storage medium for use in a computer system, including: a query analyser for processing a query to the computer system to assign respective weights to terms of said query based on grammatical structure of the query and for generating a query vector including said weights in respective fields for said terms; and an index network for processing said query vector to output at least one index to data in response to said query, wherein said index network maintains a hierarchal structure of nodes representing said data and indices to said data, said nodes each include a text vector having weights for terms of said data and leaf nodes of said structure including indices to said data, wherein said index network compares said query vector with the text vectors of said nodes to select said at least one index in response to said query, said comparing being executed from an upper level of the hierarchal structure to a lower level, with paths in the structure being selected on the basis of the comparison between the vectors, wherein said index network obtains the product of said query vector and the text vector of the nodes of a level of said structure, and obtains said product for nodes of a succeeding level of said structure which are connected to nodes for which the product has exceeded a predetermined threshold.

Claim 44

A search engine stored on a computer readable storage medium for use in a computer system, including: a query analyser for processing a query to the computer system to assign respective weights to terms of said query based on grammatical structure of the query and for generating a query vector including said weights in respective fields for said terms; and an index network for processing said query vector to output at least one index to data in response to said query, wherein said index network maintains a hierarchal structure of nodes representing said data and indices to said data, said nodes each include a text vector having weights for terms of said data and leaf nodes of said structure including indices to said data, wherein said index network compares said query vector with the text vectors of said nodes to select said at least one index in response to said query, said comparing being executed from an upper level of the hierarchal structure to a lower level, with paths in the structure being selected on the basis of the comparison between the vectors, wherein said index network obtains the product of said query vector and the text vector of the nodes of a level of said structure, and obtains said product for nodes of a succeeding level of said structure which are connected to nodes for which the product has exceeded a predetermined threshold.

Claim 45

A search engine as claimed in claim 40 , wherein said query analyser generates sections of terms which form said query, said sections representing grammatical elements.

Claim 46

A search engine as claimed in claim 41 , wherein the terms in said sections are allocated to grammatical categories for determining said weights.

Claim 47

A search engine as claimed in claim 42 , wherein said query analyser generates a plurality of said sections, and parses said sections to select a set of sections forming said query vector.

Claim 48

A search engine as claimed in claim 43 , wherein said sections are key-centred phrase structure frames with a key grammatical category, and said query analyser executes frame instantiation on the terms of said query and generates a frame relation graph of said frames.

Claim 49

A search engine as claimed in claim 40 , wherein the indices of nodes having a query vector node vector product higher than a predetermined threshold are output by said index network.

Claim 50

A search engine as claimed in claim 45 , including cluster means for processing indices output by said index means in response to said query, generating term frequency vectors for data indexed by said indices, comparing similarities between the indexed data on the basis of a distance between said frequency vectors and generating content based categories on the basis of said distances and placing the output indices into said categories for display.

Claim 51

A search engine as claimed in claim 45 , including feature extraction means for receiving content features of said categories from said cluster means and selecting a unique descriptive feature for each category.

Claim 52

A search engine as claimed in claim 46 , wherein said cluster means generates a plurality of clusters of the indices and determines the quality of each cluster on the basis of inter-cluster distances and intra-cluster distances between term frequency vectors for the indices of the clusters relative to a term frequency vector centroid for each cluster.

Claim 53

A search engine as claimed in claim 40 , wherein said index network is a self generating neural network having nodes of weight vectors representing categories and terms of said data, said nodes further including pointers to a first child node and a next sibling node, and leaf nodes of said network including an index to said data.

Claim 54

A search engine as claimed in claim 49 , wherein said weights are normalized, and said network is searched in response to a query by determining the inner product of said query vector and said weight vectors to locate nodes producing a high inner product.