The present invention is generally related to a system and method for searching information.
Searching information on the Internet has become common. The Internet makes it possible for users to access a large amount of information, and becomes the largest library and database of the world in a way. Computer systems that enable users to search information on the Internet are commercial available. These computer systems generally allow a user to enter search conditions by using a search keyword or a series of search keywords. Once such search keywords are entered, a list of information (such as web pages) corresponding to the search keywords is generated and displayed on a computer monitor. Such search keywords are keywords submitted to a search engine in order to search for particular information.
For example, when searching for a document by utilizing a search engine, the user designates one or more words or character trains as search keywords which are considered to be included in the document. According to the search keywords, the search engine searches the document including the search keywords in a search database, and generates and displays a document information list to the user as a result. In such a document information search apparatus, an index describing a list of important words of a document is used for the document, in order to search target documents existing on the network effectively. Such an index is also stored in the search database. When a request for searching for a document in the search database is issued from the user, the search engine searches the index in the search database preliminarily, and outputs a search result of the document information list.
A China patent application publication No. 1536512, entitled “Method for searching a telephone book rapidly” and published on Oct. 13, 2004, discloses a method for searching a telephone book. However, the patent application can only relate to a method for searching information and matching search conditions. The patent application fails to display and edit information search conditions.
Therefore, what is needed is a system and method for searching information, which can display and edit information search conditions.
A system for displaying and editing information search conditions in accordance with a preferred embodiment runs in a document server, which connects with at least one client computer and a database. The database stores a syntax reference list, which typically includes definitions of field searching components, operating components and field value information. The system includes a component graphing module, a search character string receiving module, a character analyzing module, a syntax analyzing module, an optimizing module and a code generating module. The component graphing module is used for converting all field searching components and operating components to graph components. The search character string receiving module is used for receiving a search character string from the client computer. The character analyzing module is used for defining minimum token units of the search character string, and constructing the search character string to a token sequence. The syntax analyzing module is used for identifying all minimum units in the token sequence based on the syntax reference list, invoking corresponding graph components and converting the graph components into a syntax tree. The optimizing module is used for optimizing the syntax tree. The code generating module is used for generating search codes according to the optimized syntax tree.
A preferred method for displaying and editing information search conditions includes the step of: converting all field searching components and operating components to graph components; receiving a search character string; defining minimum token units of the search character string, and constructing the search character string to a token sequence; identifying all minimum units in the token sequence, invoking corresponding graph components and converting the graph components into a syntax tree; optimizing the syntax tree; and generating corresponding search codes according to the optimized syntax tree.
Another embodiment provides a method for displaying and editing information search conditions. The method includes the steps of: converting all field searching components and operating components to graph components; generating a syntax tree by dragging the graph components; assigning values to the graph components and generating search conditions; optimizing the syntax tree; and generating corresponding search codes according to the optimized syntax tree.
Other advantages and novel features of the present invention will be drawn from the following detailed description of a preferred embodiment and preferred method with the attached drawings, in which:
The database 50 is connected with the document server 10 via the database connectivity 40, and stores a syntax definition file. The syntax definition file includes a syntax reference list, field searching tips and other related information. The syntax reference list typically includes definitions of operating components, field searching components and field value information. The operating components include “AND,” “OR,” and “NOT.” The field searching components may include “AN (Assignee Name),” “ACLM (Claim),” “ISD (Issue Date),” “PTO (Patent office),” “TTL (Title),” “PN (Patent Number),” “IN (Inventor Name)” and “APN (Application Number).” The field value information includes types of various field values, such as numeric data, character data and enumeration data (for example, patent type is a kind of enumeration data). For example, in a search character string “AN/(microsoft or ibm) and ACLM/BIOS and ISD/[2004.1.1-2004.12.31],” “AND” and “OR” are operating components; “AN,” “ACLM” and “ISD” are field searching components; the field values of “microsoft,” “ibm” and “BIOS” are character data, and the field value of “2004.1.1-2004.12.31” is numeric data.
The
The component graphing module 101 is used for converting field searching components and operating components to graph components. The graph components can not only be dragged and assigned values in order to generate search conditions, but also be embedded in a query system. In the preferred embodiment, the query system is a patent query system. The search character string receiving module 102 is used for receiving a search character string through the client computer 20. The search character string is based on user's descriptions of search conditions and complies with particular patent searching syntax. For example, a user inputs “microsoft or ibm” in a column of “AN,” inputs “BIOS” in a column of “ACLM” and “2004.1.1-2004.12.31” in a column of “ISD,” the search character string receiving module 102 receives a corresponding search character string “AN/(microsoft or ibm) and ACLM/BIOS and ISD/[2004.1.1-2004.12.31].” The character analyzing module 103 is used for defining minimum token units of the search character string, and constructing the search character string to a token sequence. For the search character string “AN/(microsoft or ibm) and ACLM/BIOS and ISD/[2004.1.1-2004.12.31],” the character analyzing module 103 defines each component as a minimum token unit, thus obtaining seventeen minimum token units, which form a token sequence (shown in
The
In an alternative embodiment, in Step S408, the syntax analyzing module 104 drags the graph components directly, and assigns values to the graph components, in order to generate a syntax tree.
Although the present invention has been specifically described on the basis of a preferred embodiment and a preferred method, the invention is not to be construed as being limited thereto. Various changes and modifications may be made to the embodiment and method without departing from the scope and spirit of the invention
Number | Date | Country | Kind |
---|---|---|---|
94101772 | Jan 2005 | TW | national |