JP2009129013A - Method, device, and program for retrieving document - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To retrieve appropriate elements from a hierarchically structured document set in a short time. <P>SOLUTION: An acquisition part 201 acquires an XML document. A generation part 202 generates a node list including positional information. An input part 203 receives input of retrieval conditions. A calculation part 204 calculates a score showing the degree of agreement of the retrieval conditions. A specification part 205 refers to the positional information to specify a parent node to which a node belongs. An addition part 206 adds an addition value based on the score of the node to the score of the parent node specified by the specification part 205. Based on the score after the addition by the addition part 206, a selection part 207 selects a node to be output as a retrieval result from the nodes listed in the node list. An output part 208 outputs the node selected by the selection part 207. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a document search method, a document search apparatus, and a document search program for searching a node that matches an arbitrary search condition from a hierarchically structured document set.

  Conventionally, by dividing a series of documents into sub-documents of appropriate units such as chapters and sections and making them into a hierarchical structure, there are many publishing diversity, accuracy of information retrieval, ease of division / combination, etc. It is supposed that the merit of can be obtained. For example, an XML document is a typical example of a hierarchically structured document. An XML document has a document element or document text marked up with a tag, so that a partial document can be easily searched (for example, see Patent Document 1 below).

Japanese Patent Application Laid-Open No. 08-044766

  However, in the prior art described in Patent Document 1, there has been a problem that a plurality of elements in the minimum unit that match the search conditions are searched in pieces. For example, when a plurality of elements that match the search condition are included in the upper element, it is preferable for the user to search for the upper element as a search result.

  In order to solve the above-described problems caused by the prior art, the present invention provides a document search method, a document search apparatus, and a document search program capable of searching for appropriate elements in a hierarchically structured document set in a short time. The purpose is to provide.

  In order to solve the above-described problems and achieve the object, a document search method according to the present invention includes an acquisition step of acquiring a hierarchically structured document set, and the document set acquired from the acquisition step by the acquisition step. A generation process for generating a node list including position information indicating a position of a parent node to which the node belongs, an input process for receiving an input of an arbitrary search condition, and the node list For each node, a calculation step for calculating a score indicating the degree of match of the search condition, and for each node indicated in the node list, the position information is referred to and the node information indicated in the node list From the specific step of identifying the parent node to which the node belongs, and for each node indicated in the node list, an addition value based on the score of the node is A node to be output as a search result is selected from the nodes indicated in the node list based on the addition step of adding to the score of the parent node specified by the specifying step and the score after the addition by the addition step It includes a selection step and an output step for outputting the node selected by the selection step.

  According to the present invention, a parent node of a node having a high degree of match of the search condition or a parent node including many nodes that match the search condition can be handled as a node having a high degree of match of the search condition.

  In the above-described invention, the generation step may use, for each node indicated in the node list, the difference value between the index of the node and the index of a parent node to which the node belongs as the position information as the node. It is characterized by being included in the list.

  According to the present invention, the position of the parent node can be expressed with a small amount of information.

  In the invention described above, the adding step is characterized in that an addition value based on a score of the node is added to a score of the parent node in order from a lower node shown in the node list. .

  According to the present invention, the addition process for each node can be completed once.

  In the above-described invention, the calculating step calculates a score indicating a degree of match of the search condition for each node indicated in the node list using a TF-IDF method. .

  According to the present invention, by calculating a score using the TF-IDF method, a node that makes the keyword characteristic of the node is searched, not just a node in which many keywords included in the search condition appear. It can be handled as a node with a high degree of matching of conditions.

  In the invention described above, the adding step adds the score of the node to the score of the parent node for each node indicated in the node list.

  According to this invention, it is possible to add a score corresponding to the matching degree of the search condition to the parent node.

  In the invention described above, the adding step adds, for each node indicated in the node list, an added value based on the score of the node and the position information of the node to the score of the parent node. It is characterized by that.

  According to the present invention, it is possible to add to the parent node a score that considers the degree of match of the search condition and the distance to the parent node.

  In the invention described above, the adding step adds, for each node indicated in the node list, an added value based on the score of the node and the size of the node to the score of the parent node. It is characterized by.

  According to the present invention, it is possible to add a score considering the degree of match of the search condition and the size of the node to the parent node.

  In the invention described above, for each node indicated in the node list, the adding step calculates an added value based on the score of the node, the position information of the node, and the size of the node. It adds to the score of.

  According to the present invention, a score considering the degree of match of the search condition, the distance to the parent node, and the size of the node can be added to the parent node.

  The document search apparatus according to the present invention includes an acquisition unit that acquires a hierarchically structured document set, and the node belongs to each node included in the document set from the document set acquired by the acquisition unit. A generation means for generating a node list including position information indicating a position of a parent node, an input means for receiving an input of an arbitrary search condition, and a degree of match of the search condition for each node indicated in the node list For each node indicated in the node list, a calculation means for calculating the score to be indicated is referred to, and the parent node to which the node belongs is identified from the nodes indicated in the node list with reference to the position information For each node indicated in the node list, the adding means based on the score of the node is determined as the parent node specified by the specifying means. An adding means for adding to the score, a selecting means for selecting a node to be output as a search result from the nodes indicated in the node list based on the score after the addition by the adding means, and a selection by the selecting means Output means for outputting the selected node.

  According to the present invention, a parent node of a node having a high degree of match of the search condition or a parent node including many nodes that match the search condition can be handled as a node having a high degree of match of the search condition.

  The document search program according to the present invention includes an acquisition step of acquiring a hierarchically structured document set, and the node belongs to each node included in the document set from the document set acquired by the acquisition step. A generation process for generating a node list including position information indicating a position of a parent node, an input process for receiving an input of an arbitrary search condition, and a degree of match of the search condition for each node indicated in the node list For each node shown in the node list, a calculation step for calculating a score to be shown is referred to, and the parent node to which the node belongs is identified from among the nodes shown in the node list with reference to the position information For each node indicated in the node list in the specifying step, an added value based on the score of the node is determined as the parent specified in the specifying step. An addition step of adding to the score of the node, a selection step of selecting a node to be output as a search result from the nodes indicated in the node list based on the score after the addition in the addition step, and the selection An output step of outputting a node selected by the step is executed by a computer.

  According to the present invention, it is possible to cause a computer to treat a parent node of a node having a high matching degree of the search condition or a parent node including many nodes matching the search condition as a node having a high matching degree of the search condition.

  According to the document search method, document search apparatus, and document search program of the present invention, there is an effect that an appropriate element can be searched in a short time from a hierarchically structured document set.

  Exemplary embodiments of a document search method, a document search apparatus, and a document search program according to the present invention will be described below in detail using an XML document as an example of a hierarchically structured document set with reference to the accompanying drawings. To do.

(Hardware configuration of document search apparatus 100)
First, the hardware configuration of the document search apparatus according to this embodiment will be described. FIG. 1 is a block diagram showing an example of a hardware configuration of the document search apparatus according to this embodiment.

  In FIG. 1, a document search apparatus 100 includes a CPU (Central Processing Unit) 101, a ROM (Read Only Memory) 102, a RAM (Random Access Memory) 103, an HDD (Hard Disc Drive) 104, and an HD (Hard Disc). ) 105, FDD (Flexible Disc Drive) 106, FD (Flexible Disc) 107, CD-RW (Compact Disc ReWriteable) drive 108, CD-RW 109, display 110, keyboard 111, mouse 112, A network I / F (interface) 113, a communication cable 114, and a bus 120 are provided.

  The CPU 101 controls the entire document search apparatus 100. The ROM 102 stores various control programs and the like. The RAM 103 stores variable data in a rewritable manner and functions as a work area for the CPU 101. The HDD 104 controls reading / writing of data with respect to the HD 105 according to the control of the CPU 101. The HD 105 stores data written according to the control of the HDD 104.

  The FDD 106 controls reading / writing of data with respect to the FD 107 according to the control of the CPU 101. The FD 107 is detachable and stores data written according to the control of the FDD 106. The CD-RW drive 108 controls reading / writing of data with respect to the CD-RW (or CD-R, CD-ROM) 109 according to the control of the CPU 101. The CD-RW 109 is detachable and stores data written according to the control of the CD-RW drive 108.

  The display 110 displays a cursor, a menu, a window, or various data such as characters and images. The keyboard 111 includes a plurality of keys for inputting characters, numerical values, various instructions, and the like. The mouse 112 selects and executes various instructions, selects a processing target, moves a mouse pointer, and the like. A network I / F 113 is connected to a network such as a LAN, WAN, or the Internet via a communication cable 114, and functions as an interface between the network and the CPU 101. A bus 120 connects the above-described units.

(Functional configuration of document search apparatus 100)
Next, a functional configuration of the document search apparatus 100 according to this embodiment will be described. FIG. 2 is a block diagram showing a functional configuration of the document search apparatus 100 according to this embodiment.

  As shown in FIG. 2, the document search apparatus 100 includes an acquisition unit 201, a generation unit 202, an input unit 203, a calculation unit 204, a specification unit 205, an addition unit 206, a selection unit 207, and an output unit. 208.

  The acquisition unit 201 acquires an XML document. For example, the acquisition unit 201 acquires an XML document by reading an XML document file designated by the user. In this case, the XML document file is not limited to the one stored in the document search device 100, and may be stored in another device connected to the document search device 100, for example. The acquisition unit 201 may acquire a plurality of XML documents. In this case, for example, a plurality of XML documents may be acquired from a predetermined storage location. Further, a plurality of XML documents may be acquired from the storage location designated by the user. Specifically, the acquiring unit 201 realizes its function by, for example, the network I / F 113 shown in FIG.

  The generation unit 202 generates a node list including position information indicating the position of the parent node to which the node belongs for each node included in the document set, from the XML document acquired by the acquisition unit 201. The node list here is a list of all element nodes existing in the XML document based on the XML document modeled in a tree structure. The node list includes information such as an index and a path for each element node. When a text node belongs to an element node, information such as an index and text of the text node is associated.

  For each node indicated in the node list, the generation unit 202 may include position information indicating the relative position between the index of the node and the parent node to which the node belongs in the node list. For example, for each node indicated in the node list, the generation unit 202 may include a difference value between the index of the node and the index of the parent node to which the node belongs in the node list as position information. More specifically, when the index of the parent node of the node assigned the index “1006” is “1002”, the generation unit 202 sets the position information of the node assigned the index “1006” as “4”. To do. The generation unit 202 temporarily stores the generated node list on the memory.

  The generation unit 202 not only generates a node list regarding all nodes existing in the XML document, but also generates a node list regarding nodes within a predetermined range and a node list regarding nodes within a range specified by the user. It may be. Further, the generation unit 202 may include, for each node indicated in the node list, the node list and position information (for example, the parent node index) indicating the absolute position of the parent node to which the node belongs. Good. A specific procedure for generating the node list will be described later with reference to FIG. Specifically, the generation unit 202 realizes its function by the CPU 101 executing programs stored in the ROM 102, RAM 103, HD 105, and FD 107 shown in FIG.

  The input unit 203 receives an input of an arbitrary search condition. Here, the search condition is an arbitrary natural sentence (search query sentence), arbitrary data, or the like. For example, the search condition is input as “J company I Taro” or “(J company I Taro)”, the former means that both “J company” and “I Taro” are included, and the latter is It means that either “Company J” or “I Taro” is included. Here, the search conditions are not limited to those directly input to the document search apparatus 100 by the user, but may be those transmitted from other apparatuses connected to the document search apparatus 100, for example. Specifically, the input unit 203 realizes its function by, for example, the keyboard 111, the mouse 112, and the network I / F 113 shown in FIG.

  The calculation unit 204 calculates a score indicating the degree of match of the search condition input by the input unit 203 for each node indicated in the node list. For example, the score (TF-IDF) can be obtained by the following calculation formula (1).

  TFIDF = TF × log (N / DF) (1)

  In the calculation formula (1), TF indicates the number of appearances of the search character string in the text node. N indicates the total number of text nodes. DF indicates the number of text nodes including the search character string.

  In the present embodiment, the score is calculated using the TF-IDF method. However, the present invention is not limited to this, and the score may be calculated using another method. Specifically, the calculation unit 204 realizes its function when the CPU 101 executes programs stored in the ROM 102, the RAM 103, the HD 105, and the FD 107 shown in FIG.

  The identifying unit 205 identifies the parent node to which the node belongs from among the nodes indicated in the node list by referring to the position information for each node indicated in the node list. For example, when the difference value between the index of the node and the index of the parent node is the position information, the index of the parent node is specified from the node index and the position information. For example, when the position information of the node assigned with the index “1006” is “4”, the identifying unit 205 sets the node assigned with the index “1002” as the parent node of the node assigned with the index “1006”. As specified. Specifically, the specifying unit 205 realizes its function when the CPU 101 executes a program stored in the ROM 102, the RAM 103, the HD 105, and the FD 107 shown in FIG.

  For each node indicated in the node list, the adding unit 206 adds an addition value based on the score of the node to the score of the parent node specified by the specifying unit 205. The addition unit 206 adds the addition value based on the score of the node in order from the lower node shown in the node list, that is, in the reverse order of the index value, to the score of the parent node. In particular, the adding unit 206 preferably adds a score or an added value sequentially from the tail of the node list (the rightmost end of the XML structure) toward the parent node. This process can be scanned in one pass, and can be performed at a very high speed if it fits in the memory area.

  For example, when the score of the node specified by the path “A / B / D” is “5” and the score of the parent node “A / B” to which this node belongs is “5”, the addition unit 206 performs By the addition process, the score of the node “A / B” becomes “10”.

  The adding unit 206 calculates an added value for each node shown in the node list by using the score of the node and the position information of the node, and the calculated added value is the parent specified by the specifying unit 205. You may add to the score of a node. For example, the addition value (ADD) may be obtained by the following calculation formula (2).

  ADD = SCORE / log (OFFSET + 1.1) (2)

  In the calculation formula (2), SCORE indicates a score of a node. OFFSET indicates position information. By using the value calculated by the calculation formula (2) as an added value, a node that is farther from the parent node can be treated as a node having a lower degree of association with the parent node, and the score can be reduced.

  The adding unit 206 may calculate the added value using a calculation formula other than the above. For example, the adding unit 206 may calculate an added value using the node score and the node size, and add the calculated added value to the score of the parent node specified by the specifying unit 205. Further, the adding unit 206 calculates an added value using the node score, the node size, and the node position information, and adds the calculated added value to the score of the parent node specified by the specifying unit 205. Good.

  Specifically, the adding unit 206 realizes its function by the CPU 101 executing a program stored in the ROM 102, the RAM 103, the HD 105, and the FD 107 shown in FIG.

  The selection unit 207 selects a node to be output as a search result from the nodes indicated in the node list based on the score after addition by the addition unit 206. For example, the selection unit 207 sorts the nodes shown in the node list in the order of matching degree of the search condition based on the score after the addition by the addition unit 206. Then, the selection unit 207 selects a predetermined number of nodes with a high degree of matching from the sorted node list in order from the node with the highest score.

  Note that the number of nodes selected by the selection unit 207 may be set in advance or specified by the user. Specifically, the selection unit 207 realizes its function when the CPU 101 executes a program stored in the ROM 102, RAM 103, HD 105, and FD 107 shown in FIG.

  The output unit 208 outputs the node selected by the selection unit 207. For example, the output unit 208 displays the nodes selected by the selection unit 207 in descending order of the matching degree of the search condition. Note that the output unit 208 may not only display the node selected by the selection unit 207 but also output it to a file or send it to another device connected to the document search device 100, for example. For example, when the search condition is transmitted from another device, it may be transmitted to the device that is the transmission source of the search condition. Specifically, the output unit 208 realizes its function by, for example, the display 110 and the network I / F 113 shown in FIG.

(Example of XML document)
Next, an example of an XML document used in the document search apparatus 100 according to the embodiment of the present invention will be described. FIG. 3 is an explanatory diagram showing an example of an XML document used in the document search apparatus 100 according to the embodiment of the present invention.

  FIG. 3 shows an XML document “c: ¥ documents ¥ 0123.xml” modeled in a tree structure. In FIG. 3, “1001” to “1013” indicate element nodes, and each numeral indicates an index thereof. “A” to “E” indicate text nodes, and each alphabetic character indicates its index.

  In FIG. 3, for example, a text node with index “A” belongs to an element node with index “1004”. The text node to which the index “A” is assigned has the text “XML, scheme”. For example, when this text node is indicated by using a tag, it is indicated as “<article> <body> <sec> <p1> XML, scheme </ p1> </ sec> </ body> </ article>”. Can do.

(Node list generation procedure)
Next, a node list generation procedure by the generation unit 202 will be described. FIG. 4 is a flowchart illustrating an example of a node list generation procedure by the generation unit 202.

  First, a root element node is selected from an XML document modeled in a tree structure (step S401). For example, in the case of the XML document shown in FIG. 3, the element node assigned with the index “1001” is selected.

  Next, the element node selected in step S401 is added to the node list (step S402). Here, the information added to the node list includes the index and path of the element node. For example, in the case of the element node to which the index “1001” in the XML document shown in FIG. 3 is assigned, the index “1001”, the path “/ article”, and the like are added to the node list.

  Next, position information is added to the node list (step S403). For example, the location information can be determined by subtracting the index of the parent node from the index of the selected node. For example, in the case of an element node to which the index “1001” in the XML document shown in FIG. 3 is assigned, “0” is obtained as position information because there is no parent node. In the case of the element node to which the index “1006” in the XML document shown in FIG. 3 is assigned, “4” is obtained as the position information because the index of the parent node is “1002”.

  Next, it is determined whether or not a text node belongs to the selected element node (step S404). For example, in the case of an element node to which the index “1001” in the XML document shown in FIG. 3 is assigned, it is determined that the text node does not belong, and in the case of an element node to which the index “1004” is assigned, the text node Is determined to belong.

  If it is determined in step S404 that the text node belongs (step S404: Yes), the selected element node is associated with the text node belonging to this element node (step S405). The process proceeds to S406.

  Here, the information associated with the element node is a text node index or text. For example, the element node to which the index “1004” in the XML document shown in FIG. 3 is assigned is associated with the text node index “A”, the text “XML, scheme”, and the like. If it is determined in step S404 that the text node does not belong (step S404: No), step S405 is skipped and the process proceeds to step S406.

  Next, it is determined whether or not all element nodes included in the XML document have been selected (step S406). If it is determined in step S406 that all element nodes have been selected (step S406: Yes), the series of processing ends. On the other hand, if it is determined in step S406 that all element nodes have not been selected (step S406: No), the next element node is selected from the XML document (step S407). At this time, the higher order node is prioritized. For example, in the XML document shown in FIG. 3, the order in which element nodes are selected is the order of the index values.

  Then, the process returns to step S402, and steps S402 to S407 are repeated until it is determined in step S406 that all nodes have been selected. Accordingly, all element nodes included in the XML document can be added to the node list in order from the upper node. Further, all text nodes included in the XML document can be associated with any one of the element nodes shown in the node list. Further, the position information of the parent node for all the element nodes included in the XML document can be added to the node list.

(Example of node list)
Next, an example of the node list will be described. FIG. 5 is an explanatory diagram illustrating an example of a node list.

  A node list 500 shown in FIG. 5 is a node list generated from the XML document shown in FIG. 3 by the procedure described above with reference to FIG. 4, and includes columns “index1”, “path”, “index2”, “text”. ”,“ Parent ”.

  Among these, the index of the element node is set in the column “index1”. In the column “path”, a path of an element node is set. In the column “index2”, the index of the text node associated with the element node is set. Further, the text of the text node associated with the element node is set in the column “text”. In the column “parent”, position information of a parent node to which the element node belongs is set.

  For example, from the node list 500 shown in FIG. 5, the element node indicated by the path “/ article / body / sec / p1” to which the index “1004” is assigned is assigned the index “A” and the text “XML”. , Scheme ”can be determined to be associated. Further, the position information of the parent node regarding the element node indicated by the path “/ article / body / footer” to which the index “1006” is assigned can be determined to be “4”.

  As described above, since the node list 500 is sorted in the index order of the element nodes, the original XML structure can be reconfigured, and the parent node information can be easily accessed. Also, by referring to the node list 500, it is possible to process the information held by each node at high speed while considering the parent-child relationship, the ancestor-descendant relationship, the sibling relationship, and the like.

(Procedure for document search processing by the document search apparatus 100)
Next, a procedure for document search processing by the document search apparatus 100 according to the embodiment of the present invention will be described. FIG. 6 is a flowchart showing an example of a procedure of document search processing by the document search apparatus 100 according to the embodiment of the present invention.

  First, the acquisition unit 201 acquires an XML document (step S601), and the generation unit 202 generates a node list (number of nodes N) from the XML document acquired in step S601 (step S602). The specific procedure for generating the node list is as described above with reference to FIG.

  Next, input of the search condition is accepted by the input unit 203 (step S603), and the calculation unit 204 inputs all the nodes shown in the node list generated in step S602 in step S603. Based on the search condition, a score indicating the degree of match of the search condition is calculated (step S604).

  Subsequently, the identification unit 205 selects the i-th (i = N...) Node from the top shown in the node list generated in step S602 (step S605), and is selected in step S605. The parent node is specified for the node (step S606).

  Then, the adder 206 adds the score of the node selected in step S605 to the score of the parent node specified in step S606 (step S607), and proceeds to step S608.

  Subsequently, it is determined whether all the nodes shown in the node list generated in step S602 have been selected (step S608). If it is determined in step S608 that all nodes have not been selected (step S608: No), steps S605 to S608 are repeated until it is determined in step S608 that all nodes have been selected.

  On the other hand, if it is determined in step S608 that all the nodes have been selected (step S608: Yes), the selection unit 207 selects the node indicated in the node list based on the score after the addition in step S607 as a search condition. The nodes are sorted in order of match (step S609), and a node with a high match is selected from the sorted nodes (step S610).

  Then, the output unit 208 outputs the node selected in step S610 (step S611), and the series of processing ends.

(Example of score calculated by calculation unit 204)
Next, an example of the score calculated by the calculation unit 204 will be described. FIG. 7 is an explanatory diagram illustrating an example of a score calculated by the calculation unit 204.

  FIG. 7 shows the association between the node list 500 shown in FIG. 5 and the score list 700 indicating the score of each element node calculated by the calculation unit 204. In the score list 700 illustrated in FIG. 7, the score calculated by the calculation unit 204 is set in the column “score1”. The search character string used in the calculation process at this time is “XML, tag, scheme”.

  For example, from the node list 500 and the score list 700, the element node indicated by the path “/ article / body / sec / p1” to which the index “1004” is assigned has the score “38” calculated by the calculation unit 204. It can be determined that they are associated. Here, this score “38” is calculated by the following TF-IDF calculation formula (3).

  38 (TFIDF: score) = 1 (TF: number of occurrences of the search character string “XML” in the text node) × 20 (IDF: log (total number of text nodes / number of text nodes including the search character string “XML”)) +1 (TF: number of occurrences of the search character string “scheme” in the text node) × 18 (IDF: log (total number of text nodes / number of text nodes including the search character string “scheme”)) (3)

  Further, from the node list 500 and the score list 700, the element node indicated by the path “/ article / body / sec / p2” to which the index “1005” is assigned has the score “80” calculated by the calculation unit 204. It can be determined that they are associated. Here, this score “80” is calculated by the following TF-IDF calculation formula (4).

  80 (TFIDF: score) = 2 (TF: number of occurrences of the search character string “tag” in the text node) × 40 (IDF: log (total number of text nodes / number of text nodes including the search character string “tag”)) ... (4)

(Example of score added by adding unit 206)
Next, an example of the score added by the adding unit 206 will be described. FIG. 8 is an explanatory diagram illustrating an example of scores added by the adding unit 206.

  FIG. 8 shows the association between the node list 500 shown in FIG. 5, the score list 700 shown in FIG. 7, and the score list 800 showing the score after the addition by the adding unit 206. In the score list 800 illustrated in FIG. 8, the score added by the adding unit 206 is set in the column “score2”.

  For example, the score “66” added by the adding unit 206 is associated with the element node indicated by the path “/ article / body / sec / title / name” to which the index “1011” is assigned from the score list 800. Can be determined. Here, the score “66” includes the score “22” of the element node to which the index “1012” is assigned and the score “44” of the element node to which the index “1013” is assigned. It is an addition.

(Another example of the score added by the adding unit 206)
Next, another example of the score added by the adding unit 206 will be described. FIG. 9 is an explanatory diagram showing another example of the scores added by the adding unit 206.

  FIG. 9 shows the association between the node list 500 shown in FIG. 5, the score list 700 shown in FIG. 7, and the score list 900 showing the score after the addition by the adding unit 206. In the score list 900 illustrated in FIG. 9, the score added by the adding unit 206 is set in the column “score2”.

  For example, the score “44” added by the adding unit 204 is associated with the element node indicated by the path “/ article / body / sec / title / name” to which the index “1011” is assigned from the score list 900. Can be determined. Here, the score “44” is the addition value calculated by the calculation formula (2) described with reference to FIG. 2 from the score “22” of the element node to which the index “1012” is assigned, belonging to this element node. “20” is added to the score “44” of the element node to which the index “1013” is assigned, and the addition value “24” derived from the calculation formula (2) is added.

(Example of search result output by output unit 208)
Next, an example of the search result output by the output unit 208 will be described. FIG. 10 is an explanatory diagram illustrating an example of a search result output by the output unit 208.

  FIG. 10 shows the search result output by the output unit 208 as a result of performing the document search process according to the procedure described above with reference to FIG. 6 on the XML document shown in FIG. As shown in FIG. 10, in performing the document search process, the search target document “c: ¥ documents ¥ 0123.xml”, the search condition “XML, tag, scheme”, and the number of searches “3 (cases)” are designated by the user. Has been.

  When the “search” button is pressed, a document search process is performed on the search target document “c: \ documents \ 0123.xml”. As a result, the search target document “c: \ documents \ 0123.xml” is executed. The top three nodes that are selected from “” and have the highest matching degree of the search conditions are output as the search results.

  As described above, according to the document search device 100 according to the present embodiment, for each node indicated in the node list, the addition value based on the score of the node is added to the score of the parent node, and after the addition Based on the score, a node to be output as a search result is selected from the nodes shown in the node list. Therefore, it is possible to search for an appropriate element from the hierarchically structured document set.

  In addition, according to the document search device 100 according to the present embodiment, the addition value based on the node score is added to the parent node score in order from the lower node shown in the node list. In particular, the configuration is such that the parent node is identified by referring to the position information. Therefore, an appropriate element can be searched in a short time from a hierarchically structured document set.

  Note that the document search method, document search apparatus, and document search program according to the present invention can be applied to document search for documents other than XML documents as long as the document set has a hierarchical structure. Further, the present invention is not limited to a filed document, and can be applied to a document search for a databased document, for example. Furthermore, not only documents filed in a single file or documents databased in a single database, but also document searches for documents filed in multiple files and documents databased in multiple databases. Can be applied.

  The document search method described in this embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable storage medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the storage medium by the computer. Further, this program may be a transmission medium that can be distributed via a network such as the Internet.

  As described above, the document search method, document search apparatus, and document search program according to the present invention are a personal computer, a document server, and a document that search for a node that matches an arbitrary search condition from a hierarchically structured document set. Suitable for use in search software.

It is a block diagram which shows an example of the hardware constitutions of the document search device concerning this embodiment. It is a block diagram which shows the functional structure of the document search device concerning this embodiment. It is explanatory drawing which shows an example of the XML document used for the document search apparatus concerning embodiment of this invention. It is a flowchart which shows an example of the production | generation procedure of the node list by a production | generation part. It is explanatory drawing which shows an example of a node list. It is a flowchart which shows an example of the procedure of the document search process by the document search apparatus concerning embodiment of this invention. It is explanatory drawing which shows an example of the score calculated by the calculation part. It is explanatory drawing which shows an example of the score added by the addition part. It is explanatory drawing which shows another example of the score added by the addition part. It is explanatory drawing which shows an example of the search result output by the output part.

Explanation of symbols

100 Document Retrieval Device 101 CPU
102 ROM
103 RAM
104 HDD
105 HD
106 FDD
107 FD
108 CD-RW drive 109 CD-RW
110 Display 111 Keyboard 112 Mouse 113 Network I / F
114 communication cable 120 bus 201 acquisition unit 202 generation unit 203 input unit 204 calculation unit 205 identification unit 206 addition unit 207 selection unit 208 output unit 500 node list 700 score list 800 score list 900 score list

Claims (10)

An acquisition process for acquiring a hierarchically structured document set;
A generation step of generating a node list including position information indicating a position of a parent node to which the node belongs for each node included in the document set from the document set acquired by the acquisition step;
An input process for receiving input of an arbitrary search condition;
A calculation step of calculating a score indicating the degree of match of the search condition for each node indicated in the node list;
For each node indicated in the node list, referring to the location information, a specifying step for specifying a parent node to which the node belongs from among the nodes indicated in the node list;
For each node indicated in the node list, an addition step of adding an addition value based on the score of the node to the score of the parent node identified by the identification step;
A selection step of selecting a node to be output as a search result from the nodes indicated in the node list based on the score after the addition in the addition step;
An output step of outputting the node selected by the selection step;
A document retrieval method characterized by including The generation step includes
The difference value between the index of the node and the index of a parent node to which the node belongs is included in the node list as the position information for each node indicated in the node list. Document search method. The adding step includes
The document search method according to claim 1, wherein an addition value based on a score of the node is added to a score of the parent node in order from a lower node shown in the node list.   The calculation step calculates a score indicating a degree of match of the search condition for each node indicated in the node list using a TF-IDF method. Document search method described in one.   5. The document search according to claim 1, wherein the adding step adds the score of the node to the score of the parent node for each node indicated in the node list. Method.   The addition step adds an addition value based on the score of the node and the position information of the node to the score of the parent node for each node indicated in the node list. 5. The document search method according to any one of 4 above.   5. The adding step adds an addition value based on the score of the node and the size of the node to the score of the parent node for each node indicated in the node list. The document search method according to any one of the above.   In the addition step, for each node indicated in the node list, an addition value based on the score of the node, the position information of the node, and the size of the node is added to the score of the parent node. The document search method according to any one of claims 1 to 4. An acquisition means for acquiring a hierarchically structured document set;
Generating means for generating a node list including position information indicating a position of a parent node to which the node belongs, for each node included in the document set, from the document set acquired by the acquiring means;
An input means for receiving input of an arbitrary search condition;
Calculating means for calculating a score indicating the degree of match of the search condition for each node indicated in the node list;
For each node shown in the node list, referring to the position information, a specifying unit for specifying a parent node to which the node belongs from among the nodes shown in the node list;
For each node indicated in the node list, an adding means for adding an added value based on the score of the node to the score of the parent node specified by the specifying means;
Selection means for selecting a node to be output as a search result from the nodes indicated in the node list based on the score after addition by the addition means;
Output means for outputting the node selected by the selection means;
A document retrieval apparatus comprising: An acquisition process for acquiring a hierarchically structured document set;
A generation step of generating a node list including position information indicating a position of a parent node to which the node belongs for each node included in the document set from the document set acquired by the acquisition step;
An input process for receiving input of an arbitrary search condition;
A calculation step of calculating a score indicating the degree of match of the search condition for each node indicated in the node list;
For each node indicated in the node list, referring to the location information, a specifying step for specifying a parent node to which the node belongs from among the nodes indicated in the node list;
For each node indicated in the node list, an addition step of adding an addition value based on the score of the node to the score of the parent node identified by the identification step;
A selection step of selecting a node to be output as a search result from the nodes indicated in the node list based on the score after the addition in the addition step;
An output step of outputting the node selected by the selection step;
Document search program characterized by causing a computer to execute.

Images