WO2018121153A1 - 一种裁判文书的检索方法及装置 - Google Patents

一种裁判文书的检索方法及装置 Download PDF

Info

Publication number
WO2018121153A1
WO2018121153A1 PCT/CN2017/113044 CN2017113044W WO2018121153A1 WO 2018121153 A1 WO2018121153 A1 WO 2018121153A1 CN 2017113044 W CN2017113044 W CN 2017113044W WO 2018121153 A1 WO2018121153 A1 WO 2018121153A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
information code
referee
referee document
code
Prior art date
Application number
PCT/CN2017/113044
Other languages
English (en)
French (fr)
Inventor
石鹏
李轶
赵健
Original Assignee
北京国双科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 北京国双科技有限公司 filed Critical 北京国双科技有限公司
Priority to US16/331,467 priority Critical patent/US11288326B2/en
Publication of WO2018121153A1 publication Critical patent/WO2018121153A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/93—Document management systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/35—Clustering; Classification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/907—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
    • G06F16/908—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually using metadata automatically derived from the content
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33—Querying
    • G06F16/3331—Query processing
    • G06F16/334—Query execution
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9027—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/903—Querying
    • G06F16/9038—Presentation of query results
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/18—Legal services

Definitions

  • the invention relates to the technical field of data retrieval, in particular to a method and a device for searching a judgment document.
  • the judgment documents are used to record the trial process and results of the people's courts. It is the carrier of the outcome of the litigation activities and the only evidence that the people's courts determine and assign the rights and obligations of the parties.
  • a referee document with complete structure, complete elements and logical rigor is not only a certificate for the parties to enjoy rights and obligations, but also an important basis for the people's court at a higher level to supervise the civil trial activities of the people's courts at lower levels.
  • the refereeing documents network which provides retrieval and downloading of cases, keywords, parties, judges, lawyers, types of documents, courts and other dimensions.
  • Some related search websites will also provide partial retrieval and download of referee documents.
  • the existing search methods are basically matched by the search keywords entered by the searcher.
  • the search keywords used are search queries according to existing classifications, such as cases, parties, judges, lawyers, etc.
  • the search method can be regarded as the referee Longitudinal retrieval of instruments.
  • this method lacks horizontal comparison or association with the retrieved referee documents, so that the searcher may need to retrieve other keywords by multiple times in order to obtain the required referee documents.
  • the present invention provides a retrieval method and apparatus for a referee document, the main purpose of which is In the existing referee documents, the information code is marked, and the vertical and horizontal search is performed according to the association relationship of the information codes during the search to provide a better comprehensive search result.
  • the present invention mainly provides the following technical solutions:
  • the present invention provides a method for retrieving a referee document, the method comprising:
  • Creating an information code which is an atomic data structure extracted from a referee document according to a preset classification dimension, for distinguishing and associating different referee documents;
  • the referee document marked with the information code in the search information and the referee document associated therewith are output and displayed as a search result based on the information code in the search information.
  • the creating the information code includes:
  • the information code is saved in a dictionary form to obtain an information code dictionary.
  • generating corresponding information codes according to the child nodes in the dimension level tree includes:
  • the structure of the information code is set to ⁇ Id, CodeKeyword, CodeType, CodePath, Pid ⁇ , where Id is a unique identifier of the information code, CodeKeyword is a code keyword, and the code keyword corresponds to the node information of the child node.
  • CodeType is a dimension name
  • CodePath is a code path
  • the code path is a branch path of the child node
  • Pid is a parent node of the child node
  • the information codes corresponding to the child nodes are generated layer by layer according to the order of the top level to the lower layer and the field information of the corresponding fields in the structure of the information code corresponding to each of the child nodes.
  • the saving the information code in a dictionary form comprises:
  • the key is CodeType_CodeKeyword
  • the value is a structural object of the information code.
  • the associating the refereeing document marked with the information code according to the preset associated information includes:
  • the marking, by using the information code, the referee document in the search database includes:
  • the information code is marked in the referee document.
  • the associating the refereeing document marked with the information code according to the preset associated information includes:
  • the outputting and displaying the referee document marked with the information code in the search information and the referee document associated with the search code according to the information code in the search information as a search result include:
  • the referee document having the same association information as the referee document is extracted according to the referee document in the first search list, and displayed in the second search list.
  • the present invention also provides a retrieval device for a referee document, the device comprising:
  • the information code is an atomic data structure extracted from a referee document according to a preset classification dimension, and is used for distinguishing and associating different referee documents;
  • a marking unit configured to mark, by using the information code established by the creating unit, a referee document in the retrieval database
  • An association unit configured to associate the referee document marked with the information code by the marking unit according to preset association information
  • An obtaining unit configured to obtain a corresponding information code in the retrieval information
  • the display unit is configured to output and display the referee document marked with the information code in the search information and the referee document associated with the referee document as a search result according to the information code in the search information acquired by the obtaining unit.
  • the creating unit comprises:
  • a generating module configured to generate, according to the structure of the dimension level tree established by the establishing module, a corresponding information code according to the child node in the dimension level tree;
  • a storage module configured to save the information code generated by the generating module in a dictionary form to obtain an information code dictionary.
  • the generating module comprises:
  • a sub-module configured to set a structure of the information code, where the structure is ⁇ Id, CodeKeyword, CodeType, CodePath, Pid ⁇ , where Id is a unique identifier of the information code, CodeKeyword is a code keyword, and the code keyword is Corresponding to the node information of the child node, CodeType is a dimension name, CodePath is a code path, the code path is a branch path of the child node, and Pid is a parent node of the child node;
  • Obtaining a sub-module configured to acquire field information of each field in the structure of the information code set by the setting sub-module for each child node;
  • Generating a sub-module configured to: according to the order of the dimension hierarchy tree from the top layer to the lower layer, and the field information of each field in the structure of the information code corresponding to each of the child nodes acquired by the acquiring sub-module
  • the information code corresponding to each child node is generated layer by layer.
  • the storage module is further configured to: in the information code stored in the dictionary form, the key is CodeType_CodeKeyword, and the value is a structural object of the information code.
  • the association unit comprises:
  • An obtaining module configured to acquire preset association information of the referee document
  • a search module configured to search, according to a code path of the information code in the referee document, a referee file corresponding to another node in the branch path to which the code path belongs, and obtain the reference document from the corresponding referee document Correlation judgment documents of the same preset association information acquired by the acquisition module;
  • an association module configured to associate the related referee document obtained by the searching module with the referee document.
  • the marking unit comprises:
  • a parsing module configured to parse the referee document in the search database according to a preset classification dimension, to obtain dimension information corresponding to each dimension of the referee document;
  • a matching module configured to match, according to the dimension information obtained by the parsing module, a corresponding information code
  • An annotation module configured to mark the information code obtained by the matching module in the referee document.
  • the association unit comprises:
  • the obtaining module is further configured to acquire preset association information of the referee file
  • the searching module is further configured to: search, according to a classification dimension of the information code in the referee document, an associated referee document having the same preset association information as the referee document in the classification dimension;
  • the association module is further configured to associate the related referee document with the referee document.
  • the display unit comprises:
  • a first display module configured to extract a referee document marked with the information code, and display the same in the first search list
  • the second display module is configured to extract, according to the referee document in the first search list displayed by the first display module, the referee document having the same associated information as the referee document, and display the referee file in the second search list.
  • the present invention also provides a storage medium including a storage process And a method for controlling, by the device where the storage medium is located, to perform the retrieval method of the referee document according to any one of the above items.
  • the present invention provides a processor for running a program, wherein the program is executed to perform a retrieval method of a referee document according to any one of the above.
  • the user can not only match the vertical search according to the input search condition when searching for the judgment document.
  • the referee document marked with the retrieved information code can also obtain the referee document horizontally associated with the search condition, that is, the related referee document with the same latitude and different levels of the retrieved information code, so that the search result is more comprehensive and improved.
  • the intelligence of the retrieval reduces the requirement for the user's retrieval ability, so that the user can quickly and accurately obtain the required retrieval result with simplified query conditions.
  • FIG. 1 is a flow chart showing a method for retrieving a referee document according to an embodiment of the present invention
  • FIG. 2 is a flowchart of creating a referee document information code according to an embodiment of the present invention
  • FIG. 3 is a schematic structural diagram of a dimension hierarchy tree of a referee document according to an embodiment of the present invention
  • FIG. 4 is a flowchart of performing a tag information code operation on a referee document and performing association operations using the associated information according to an embodiment of the present invention
  • FIG. 5 is a block diagram showing the composition of a retrieval apparatus for a referee document according to an embodiment of the present invention
  • FIG. 6 is a block diagram showing the composition of another retrieval apparatus for a referee document according to an embodiment of the present invention.
  • the embodiment of the present invention provides a method for retrieving a judgment document. As shown in FIG. 1 , the method associates the documents in the judgment document library by means of labeling information codes before the retrieval, and outputs the retrieval result through the association relationship. At the same time, the matching referee documents and the associated referee documents are output together.
  • the specific steps of the method include:
  • This step is pre-processing of the search database for storing the referee documents before the user enters the search information, wherein first, the information code in each dimension is extracted according to the preset classification dimension according to the referee document in the search database, the information code It is an atomic data structure extracted from the judgment documents according to the preset classification dimension, which is used to distinguish and associate different judgment documents.
  • the preset classification dimension refers to the classification of different dimensions according to the labeling format of the judgment document.
  • a judgment document according to the information recorded in the content, generally according to the case, the party, the judge Classification of lawyers, types of documents, courts, trials, etc., and in each dimension, according to the corresponding information in different judgment documents, they can be divided into different levels, for example, in the dimensions of the trial.
  • the first-instance, second-instance, final-review and other levels include the high court, the middle court, and the grassroots level in the court's dimension, and there are further divisions in the same level. For example, in the middle court, you can also divide It is the First Intermediate People's Court of Beijing and the Second Intermediate People's Court of Beijing.
  • the preset classification dimension can be selected according to the regulatory standards, and the information code is the identification information generated according to the nodes in each level in different dimensions in the classification dimension, and the identification information is the smallest classification identifier, and the The data structure is the atomic data structure. After determining the classification dimension and the dimension level, the information code is correspondingly determined, and the split cannot be refined. The corresponding information code changes unless the hierarchy in the classification dimension or dimension is modified.
  • each of the referee documents in the search database is parsed, that is, the subdivision documents are determined according to the preset classification dimension.
  • the content of the information is analyzed, and the level corresponding to the content of the information and the node corresponding to the level are analyzed.
  • the information code corresponding to the node is marked in the judgment document.
  • an array field can be uniformly marked on the refereeing documents.
  • the array field includes field values of different dimensions, and the matched information code is saved in the field under the corresponding dimension.
  • the preset association information refers to common feature information extracted from different referee documents having the same information content. For example, for the first and second judgments of the same case, the two judgment documents are different in the dimension of the trial, and the two judgment documents are to be associated. The corresponding associated information is the case number of the case.
  • the first thing to be determined is the association information, which is preset, and the referee documents are associated one by one in the search database according to the set association information, and the referee documents having the same related information are associated. .
  • the above three steps, including this step, are processing operations on the referee documents stored in the search database before the user performs the search operation, wherein when updating the search database, the newly added referee documents also need to perform the above-mentioned Operation, the newly added referee documents are associated with the existing referee documents.
  • the subsequent retrieval operation, step 104 can be performed.
  • the system After the user enters the search information, the system will match the corresponding information code according to the search information.
  • the specific implementation may be that a specific search condition is preset, and different conditions correspond to different information codes or a combination of multiple information codes, and the user may select according to needs; or may be freely entered by the user.
  • the recorded information is parsed by the system, and the corresponding information code is matched according to the analysis result or a combination of matching multiple information codes is matched.
  • the referee document marked with the information code and the The referee documents associated with the referee documents are displayed as search results.
  • This step is to perform matching of the referee documents and output of the results in the search database according to the information code obtained in step 104.
  • the referee document having the information code is queried in the search database, and the referee document having the information code is output and displayed as part of the search result.
  • the referee document having the information code all the referee documents associated with the referee document having the search information code are extracted one by one, and the associated referee documents are also output and displayed as the search result of the current search.
  • the referee document may be displayed again to associate the related information, for example, the "vertical search result" is marked in the information of the displayed referee document or It is a "horizontal search result", “longitudinal search result” means a referee document containing a search information code, and "horizontal search result” is a referee document which has the same related information as a referee document containing a search information code.
  • the referee document in the horizontal search result can be further marked with which one of the "vertical search results" has a relationship, or a specific related information content.
  • a better display manner is to display the search results in different lists according to different search methods, for example, displaying the mark by the referee document of the search information code in the first search list, the list
  • the referee documents in the middle are "portrait search results", and the "horizontal search results" are displayed in the second search list, in which each of the referee documents is marked with the same as in the first search list.
  • the referee document of the associated information displays the correspondence with the content in the first search list.
  • the retrieval method of the referee document used in the embodiment of the present invention is related to the judgment document in the judgment document library, so that the user can not only retrieve the judgment document according to the input retrieval condition.
  • Matching the vertical search result that is, the referee document marked with the retrieved information code
  • the referee document horizontally associated with the search condition that is, the related judgment document with the same latitude and different levels of the retrieved information code, and the search result is obtained. It is more comprehensive, improves the intelligence of retrieval, reduces the requirement for user retrieval ability, and enables users to quickly and accurately obtain the required retrieval results with simplified query conditions.
  • the referee document retrieval method proposed in the above embodiment it can be seen that multiple angles are to be realized.
  • the processing mainly includes two steps of creating the information code and labeling the information with the referee document.
  • the specific implementations of the two steps in the actual application are respectively described separately:
  • the specific information code generation method is as shown in FIG. 2, including:
  • the number of classification dimensions can be customized according to requirements, and each dimension correspondingly generates a dimension hierarchy tree, and the hierarchy included in each hierarchical tree and the nodes in each hierarchical layer can be self-according according to the existing classification manner.
  • Defining settings for example, in the case of a court level tree, the tree can be set to have three levels, namely, a high court, an intermediate court, and a grassroots court.
  • the root node of the court level tree is a high court, and the intermediate court to which it belongs has two
  • the court hierarchy tree obtained according to this is shown in FIG. 3, and in practical applications, the user can add or delete nodes in the tree according to actual needs when setting the court level tree, for example, when there is a third intermediate court, Then, the node can be added at the intermediate court level in the tree, and the grassroots court to which it belongs can be set correspondingly. Or when there is no fourth base court, the corresponding node in the tree can be deleted.
  • the node where the intermediate court is located is the child node of the node where the high court is located.
  • the node where the intermediate court is located is the parent node of the node where the base court is located.
  • the node where the high court is located is called Is the root node.
  • the structure of the dimension hierarchy tree mainly generates a standard hierarchical tree according to regulations and related regulations. On this basis, adjustments are made according to the needs of actual applications, such as differentiating settings according to different regions, or according to regulations. Correct the structure of the hierarchical tree.
  • the data structure of an information code provided in the embodiment of the present invention is ⁇ Id, CodeKeyword, CodeType, CodePath, Pid ⁇ , where
  • CodeKeyword is the code keyword
  • the code keyword is the node information corresponding to the child node
  • CodeType is the dimension name
  • CodePath is the code path
  • the code path is the branch path of the child node
  • the Pid is the child level.
  • the branch path refers to the path information formed by the root node to the child node, and at least one child node is included in one branch path, and the code path may be a branch path, or Is a part of the path in a container path with multiple levels of nodes.
  • the field information of each field corresponding to the data structure of the information code is obtained for each child node in each dimension level tree.
  • the information code of the first base court node is The required field information is: Id is a grassroots court, CodeKeyword is the first grassroots court, CodeType is the court, CodePath is the first intermediate court - the first grassroots court, Pid is the first intermediate court, then the information for the node
  • the code can be expressed as ⁇ a grassroots court, first grassroots court, court, first intermediate court - first grassroots housing, first intermediate court ⁇ .
  • the other 6 child nodes will generate a corresponding information code.
  • the information code corresponding to each child node is generated layer by layer according to the dimension level tree from the top layer to the lower layer.
  • an information code is generated from a root node to a child node, and each of the child nodes is left to right in the same layer.
  • the information code obtained for the second base node in FIG. 3 is ⁇ two base level court, second base court, court, first intermediate court / second intermediate court - first grassroots housing, first The Intermediate Court/Second Intermediate Court ⁇ has multiple parent nodes in the node, that is, the correspondence between the parent node and the child nodes in the information code may be a many-to-many relationship.
  • the information code in the information code dictionary is stored in the form of a key-value pair, and the key is a dimension-keyword, that is, CodeType_CodeKeyword, and the value is a structural object of the information code.
  • the key value matched in the referee document in the search database the structural object of the corresponding information code can be found in the information code dictionary, and the information code is marked on the referee document.
  • the method includes:
  • the parsing of the referee document in this step can be implemented by using a document parser, which parses the dimensional information contained in the judging documents in each dimension according to the set classification dimension, wherein the classification dimension and the information code are created.
  • the set classification dimensions correspond.
  • One form of dimensional information is dimension-keyword, CodeType_CodeKeyword, for example, court-second intermediate court, trial-second trial, etc.
  • the parsed dimension information is mainly for obtaining the key value of the information code in the information code dictionary, thereby matching the corresponding information code in the information code dictionary for the judgment document.
  • the corresponding field content is extracted from the dimension information, combined into the key value of the referee document, and the key value is compared with the key value in the information code dictionary, when having the same key value,
  • the information code corresponding to the key value is marked in the referee document.
  • a referee document can mark a corresponding number of information codes, save the information codes in an array field corresponding to the referee document, and store the array field in the parsing database.
  • This step begins by horizontally associating the referee documents marked with the information code in the search database.
  • the basis of the association is related information, which is preset.
  • the related information may be different referee documents having the same case number, for example, for the same case, after being heard in different courts.
  • Different judgment documents, or different judgment documents obtained at different trial levels first-instance judgment documents, second-instance judgment documents).
  • the association may be performed according to the code path CodePath in the code information object, and when the reference document is classified according to the information code, the referee document having the same related information, that is, the same case Different refereeing documents of the number, in the dimension hierarchy tree corresponding to different classification dimensions, will be dispersed in nodes of different levels, and each node has indirect affiliation. Therefore, according to this feature, the mutually related referee documents can be stored in the form of a dictionary, wherein the key is a dimension-code path (CodeType_CodePath), and the value is an array of referee document names.
  • the dictionary is also stored in the parsing database.
  • the corresponding information code is parsed, and through the dimension information and the code path information in the information code, the referee document having the same related information can be quickly matched according to the dictionary stored in the parsing database, that is, the horizontal Carry out the search.
  • the user can perform the retrieval of the referee documents based on the search database, and obtain the search results having different horizontal and vertical directions, for example, when the user inputs the search.
  • the name of the obtained information code is “a grassroots hospital”, then the information code object is ⁇ a grassroots court, first grassroots court, court, first intermediate court - first grassroots housing, first intermediate Court ⁇ , the corresponding search results are as follows:
  • an embodiment of the present invention provides a device for retrieving a referee file, and the device embodiment corresponds to the foregoing method embodiment.
  • the device embodiment is no longer applicable to the foregoing method embodiment.
  • the details in the foregoing method are described one by one, but it should be clear that the device in this embodiment can implement all the contents in the foregoing method embodiments.
  • the device is mainly used for matching the judgment document data and the corresponding retrieval engine to perform the matching of the retrieval information entered by the user. Specifically, as shown in FIG. 5, the device includes:
  • the creating unit 41 is configured to create an information code, where the information code is an atomic data structure extracted from a referee document according to a preset classification dimension, and is used for distinguishing and associating different referee documents;
  • the marking unit 42 is configured to mark the referee document in the retrieval database by using the information code established by the creating unit 41;
  • the associating unit 43 is configured to associate the refereeing document marked with the information code by the marking unit 42 according to preset association information
  • An obtaining unit 44 configured to acquire a corresponding information code in the retrieval information
  • the display unit 45 is configured to output and display the referee document marked with the information code and the referee document associated with the referee document as a search result according to the information code acquired by the obtaining unit 44.
  • the creating unit 41 includes:
  • the establishing module 411 is configured to create a dimension level tree according to the preset classification dimension, where the classification dimension is used to classify the referee document;
  • a generating module 412 configured to generate, according to the structure of the dimension level tree established by the establishing module 411, a corresponding information code according to the child node in the dimension level tree;
  • the storage module 413 is configured to save the information code generated by the generating module 412 in a dictionary form to obtain an information code dictionary.
  • the generating module 412 includes:
  • the setting sub-module 4121 is configured to set the structure of the information code, where the structure is ⁇ Id, CodeKeyword, CodeType, CodePath, Pid ⁇ , where Id is a unique identifier of the information code, CodeKeyword is a code keyword, and the code key is The word corresponds to the node information of the child node, CodeType is the dimension name, CodePath is the code path, the code path is the branch path of the child node, and Pid is the parent node of the child node;
  • the obtaining sub-module 4122 is configured to acquire, for each sub-level node, field information of each field in the structure of the information code set by the setting sub-module 4121;
  • the generating sub-module 4123 is configured to: according to the order of the dimension hierarchy tree from the top layer to the lower layer, and the corresponding fields in the structure of the information code corresponding to each of the child nodes acquired by the acquiring sub-module 4122 The field information generates the information code corresponding to each child node layer by layer.
  • the storage module 413 is further configured to: in the information code in the form of a dictionary,
  • the key is CodeType_CodeKeyword, which is a structural object of the information code.
  • the association unit 43 includes:
  • the obtaining module 431 is configured to acquire preset association information of the referee document
  • the searching module 432 is configured to search, according to the code path of the information code in the referee document, a referee file corresponding to other nodes in the branch path to which the code path belongs, and obtain the referee document from the corresponding referee document An associated referee document having the same preset association information acquired by the obtaining module 431;
  • the association module 433 is configured to associate the associated referee document obtained by the search module 432 with the referee document.
  • the marking unit 42 includes:
  • the parsing module 421 is configured to parse the referee document in the search database according to the preset classification dimension, and obtain the dimension information corresponding to each dimension of the referee document;
  • the matching module 422 is configured to match the corresponding information code according to the dimension information obtained by the parsing module 421;
  • the labeling module 423 is configured to mark the information code obtained by the matching module 422 in the referee document.
  • the associating unit 43 includes:
  • the obtaining module is further configured to acquire preset association information of the referee file
  • the searching module is further configured to: search, according to a classification dimension of the information code in the referee document, an associated referee document having the same preset association information as the referee document in the classification dimension;
  • the association module is further configured to associate the related referee document with the referee document.
  • the display unit 45 includes:
  • a first display module 451 configured to extract a referee document marked with the information code, and display the same in the first search list;
  • the second display module 452 is configured to extract, according to the referee document in the first search list displayed by the first display module 451, the referee document having the same association information as the referee document, and display it in the second search list.
  • the method and device for retrieving the referee documents used in the embodiments of the present invention are Correlation processing is performed on the referee documents in the judgment document library, so that when searching for the judgment documents, the user can not only match the vertical search results according to the input search conditions, that is, the referee documents marked with the retrieved information codes, and can also obtain
  • the referee documents whose search conditions are horizontally related, that is, the related judgment documents with the same latitude and different levels of the retrieved information codes make the search results more comprehensive, improve the intelligence of the search, and reduce the requirements for the user's search ability, so that the user can Simplified query conditions quickly and accurately get the results of the search.
  • the retrieval device of the referee document includes a processor and a memory, and the above-mentioned creation unit, marking unit, association unit, acquisition unit, display unit, and the like are all stored as a program unit in a memory, and the program unit stored in the memory is executed by the processor. To achieve the corresponding function.
  • the processor contains a kernel, and the kernel removes the corresponding program unit from the memory.
  • the kernel can be set to one or more. By adjusting the kernel parameters, the information codes of the existing referee documents are marked, and the vertical and horizontal search is performed according to the association relationship of the information codes during the retrieval to provide a better comprehensive search result.
  • the memory may include non-persistent memory, random access memory (RAM), and/or non-volatile memory in a computer readable medium, such as read only memory (ROM) or flash memory (flash RAM), the memory including at least one Memory chip.
  • RAM random access memory
  • ROM read only memory
  • flash RAM flash memory
  • the present application also provides a computer program product, when executed on a data processing device, adapted to perform a program code that initializes a method of creating an information code, the information code being sorted from a referee file according to a preset
  • the atomic data structure extracted by the dimension is used for distinguishing and associating different refereeing documents; using the information code to mark the refereeing documents in the search database; and the refereeing documents marked with the information codes are associated according to the preset associated information; Obtaining a corresponding information code in the search information; and outputting and displaying the referee document marked with the information code and the referee document associated with the referee document as a search result according to the information code.
  • embodiments of the present application can be provided as a method, system, or computer program product.
  • the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment in combination of software and hardware.
  • the application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.
  • a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
  • processors CPUs
  • input/output interfaces network interfaces
  • memory volatile and non-volatile memory
  • the memory may include non-persistent memory, random access memory (RAM), and/or non-volatile memory in a computer readable medium, such as read only memory (ROM) or flash memory.
  • RAM random access memory
  • ROM read only memory
  • Memory is an example of a computer readable medium.
  • Computer readable media includes both permanent and non-persistent, removable and non-removable media.
  • Information storage can be implemented by any method or technology.
  • the information can be computer readable instructions, data structures, modules of programs, or other data.
  • Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read only memory. (ROM), electrically erasable programmable read only memory (EEPROM), flash memory or other memory technology, compact disk read only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, Magnetic A cassette, magnetic tape storage or other magnetic storage device or any other non-transportable medium can be used to store information that can be accessed by a computing device.
  • computer readable media does not include temporary storage of computer readable media, such as modulated data signals and carrier waves.
  • embodiments of the present application can be provided as a method, system, or computer program product.
  • the present application can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment in combination of software and hardware.
  • the application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Library & Information Science (AREA)
  • Technology Law (AREA)
  • Health & Medical Sciences (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • Computational Linguistics (AREA)
  • Software Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

一种裁判文书的检索方法及装置，涉及数据检索技术领域，主要用于检索裁判文书，主要目的在于对已有的裁判文书标记信息码，在检索时按照信息码的关联关系进行纵向与横向的检索，以提供更加全面的检索结果。所述方法包括：创建信息码（101），所述信息码是从裁判文书中按照预置的分类维度提取的原子数据结构，用于对不同的裁判文书进行区分与关联；利用所述信息码对检索数据库中的裁判文书进行标记（102）；将标记有信息码的裁判文书按照预置关联信息进行关联（103）；获取检索信息中对应的信息码（104）；根据所述信息码将标记有所述信息码的裁判文书以及与所述裁判文书相关联的裁判文书作为检索结果加以输出显示（105）。

Description

一种裁判文书的检索方法及装置
本申请基于申请号为201611247937.4，申请日为2016年12月29日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本发明涉及数据检索技术领域，尤其涉及一种裁判文书的检索方法及装置。
背景技术
裁判文书用于记载人民法院审理过程和结果，它是诉讼活动结果的载体，也是人民法院确定和分配当事人实体权利义务的惟一凭证。一份结构完整、要素齐全、逻辑严谨的裁判文书，既是当事人享有权利和负担义务的凭证，也是上级人民法院监督下级人民法院民事审判活动的重要依据。
目前裁判文书网中公开了两千多万份的裁判文书，提供了对案由、关键词、当事人、法官、律师、文书类型、法院等维度的检索与下载。一些相关的检索网站也会提供部分的裁判文书的检索与下载。但是，现有的检索方式基本上是通过检索人员录入的检索关键词进行匹配，一般的，所使用的检索关键词是按照既有的分类进行检索查询，如案由、当事人、法官、律师等，通过对裁判文书中的信息元素或关键词与检索关键词进行比对，这样所得到的检索结果基本上是对所有的命中检索条件的裁判文书进行直接罗列，这种检索方式可以视为对裁判文书的纵向检索。而该方式对于所检索出的裁判文书缺少横向比较或者关联，使得检索人员要得到所需的裁判文书时可能还需要再通过多次检索其他的关键词得到。
发明内容
有鉴于此，本发明提供一种裁判文书的检索方法及装置，主要目的在 于对已有的裁判文书标记信息码，在检索时按照信息码的关联关系进行纵向与横向的检索，以提供更佳全面的检索结果。
为达到上述目的，本发明主要提供如下技术方案：
一方面，本发明提供了一种裁判文书的检索方法，该方法包括：
创建信息码，所述信息码是从裁判文书中按照预置的分类维度提取的原子数据结构，用于对不同的裁判文书进行区分与关联；
利用所述信息码对检索数据库中的裁判文书进行标记；
将标记有信息码的裁判文书按照预置关联信息进行关联；
获取检索信息中对应的信息码；
根据检索信息中的信息码将标记有所述检索信息中的信息码的裁判文书以及与其相关联的裁判文书作为检索结果加以输出显示。
优选的，所述创建信息码包括：
根据预置的分类维度创建维度层级树，所述分类维度用于对裁判文书进行分类；
根据所述维度层级树的结构，按照所述维度层级树中的子级节点生成对应的信息码；
以字典形式保存所述信息码，得到信息码字典。
优选的，所述根据所述维度层级树的结构，按照所述维度层级树中的子级节点生成对应的信息码包括：
设置所述信息码的结构为{Id，CodeKeyword，CodeType，CodePath，Pid}，其中，Id为信息码唯一标识，CodeKeyword为码关键词，所述码关键词对应于所述子级节点的节点信息，CodeType为维度名称，CodePath为码路径，所述码路径为所述子级节点的树枝路径，Pid为所述子级节点的父级节点；
针对每个子级节点获取所述信息码的结构中对应的各字段的字段信息；
根据所述维度层级树由顶层至下层的顺序和每个所述子级节点所对应的所述信息码的结构中对应的各字段的字段信息，逐层生成各子级节点对应的信息码。
优选的，所述以字典形式保存所述信息码包括：
字典形式的信息码中，键为CodeType_CodeKeyword，值为所述信息码的结构对象。
优选的，所述将标记有信息码的裁判文书按照预置关联信息进行关联包括：
获取裁判文书的预置关联信息；
根据所述裁判文书中信息码的码路径查找所述码路径所属的树枝路径中其他节点所对应的裁判文书；
从所述所对应的裁判文书中获取与所述裁判文书具有相同预置关联信息的关联裁判文书；
将所述关联裁判文书与所述裁判文书进行关联。
优选的，所述利用所述信息码对检索数据库中的裁判文书进行标记包括：
根据预置的分类维度对所述检索数据库中的裁判文书进行解析，得到所述裁判文书对应于各维度的维度信息；
根据所述维度信息匹配对应的信息码；
将所述信息码标注在所述裁判文书中。
优选的，所述将标记有信息码的裁判文书按照预置关联信息进行关联包括：
获取裁判文书的预置关联信息；
根据所述裁判文书中的信息码的分类维度，在所述分类维度下查找与所述裁判文书具有相同预置关联信息的关联裁判文书；
将所述关联裁判文书与所述裁判文书进行关联。
优选的，所述根据检索信息中的信息码将标记有所述检索信息中的信息码的裁判文书以及与其相关联的裁判文书作为检索结果加以输出显示包括：
提取标记有所述检索信息中的信息码的裁判文书，将其显示在第一检索列表中；
根据所述第一检索列表中的裁判文书提取与所述裁判文书具有相同关联信息的裁判文书，将其显示在第二检索列表中。
另一方面，本发明还提供了一种裁判文书的检索装置，该装置包括：
创建单元，用于创建信息码，所述信息码是从裁判文书中按照预置的分类维度提取的原子数据结构，用于对不同的裁判文书进行区分与关联；
标记单元，用于利用所述创建单元建立的信息码对检索数据库中的裁判文书进行标记；
关联单元，用于将所述标记单元标记有信息码的裁判文书按照预置关联信息进行关联；
获取单元，用于获取检索信息中对应的信息码；
显示单元，用于根据所述获取单元获取的检索信息中的信息码将标记有所述检索信息中的信息码的裁判文书以及与所述裁判文书相关联的裁判文书作为检索结果加以输出显示。
优选的，所述创建单元包括：
建立模块，用于根据预置的分类维度创建维度层级树，所述分类维度用于对裁判文书进行分类；
生成模块，用于根据所述建立模块建立的维度层级树的结构，按照所述维度层级树中的子级节点生成对应的信息码；
存储模块，用于以字典形式保存所述生成模块生成的信息码，得到信息码字典。
优选的，所述生成模块包括：
设置子模块，用于设置所述信息码的结构，所述结构为{Id，CodeKeyword，CodeType，CodePath，Pid}，其中，Id为信息码唯一标识，CodeKeyword为码关键词，所述码关键词对应于所述子级节点的节点信息，CodeType为维度名称，CodePath为码路径，所述码路径为所述子级节点的树枝路径，Pid为所述子级节点的父级节点；
获取子模块，用于针对每个子级节点获取所述设置子模块设置的信息码的结构中对应的各字段的字段信息；
生成子模块，用于根据所述维度层级树由顶层至下层的顺序和所述获取子模块获取的每个所述子级节点所对应的所述信息码的结构中对应的各字段的字段信息，逐层生成各子级节点对应的信息码。
优选的，所述存储模块还用于，在存储字典形式的信息码中，键为CodeType_CodeKeyword，值为所述信息码的结构对象。
优选的，所述关联单元包括：
获取模块，用于获取裁判文书的预置关联信息；
查找模块，用于根据所述裁判文书中信息码的码路径查找所述码路径所属的树枝路径中其他节点所对应的裁判文书，从所述所对应的裁判文书中获取与所述裁判文书具有所述获取模块获取的相同预置关联信息的关联裁判文书；
关联模块，用于将所述查找模块得到的关联裁判文书与所述裁判文书进行关联。
优选的，所述标记单元包括：
解析模块，用于根据预置的分类维度对所述检索数据库中的裁判文书进行解析，得到所述裁判文书对应于各维度的维度信息；
匹配模块，用于根据所述解析模块解析得到的维度信息匹配对应的信息码；
标注模块，用于将所述匹配模块得到的信息码标注在所述裁判文书中。
优选的，所述关联单元包括：
所述获取模块还用于，获取裁判文书的预置关联信息；
所述查找模块还用于，根据所述裁判文书中的信息码的分类维度，在所述分类维度中查找与所述裁判文书具有相同预置关联信息的关联裁判文书；
所述关联模块还用于，将所述关联裁判文书与所述裁判文书进行关联。
优选的，所述显示单元包括：
第一显示模块，用于提取标记有所述信息码的裁判文书，将其显示在第一检索列表中；
第二显示模块，用于根据所述第一显示模块显示的第一检索列表中的裁判文书提取与所述裁判文书具有相同关联信息的裁判文书，将其显示在第二检索列表中。
另一方面，本发明还提供了一种存储介质，该存储介质包括存储的程 序，其中，在所述程序运行时控制所述存储介质所在设备执行上述任意一项所述的裁判文书的检索方法。
另一方面，本发明还提供了一种处理器，该处理器用于运行程序，其中，所述程序运行时执行上述任意一项所述的裁判文书的检索方法。
依据上述本发明所提出的一种裁判文书的检索方法及装置，通过对裁判文书库中的裁判文书进行关联处理，使得用户在检索裁判文书时，不仅能够根据输入的检索条件匹配出纵向的检索结果，也就是标注有检索的信息码的裁判文书，还能够得到与检索条件横向关联的裁判文书，即与检索的信息码同纬度且不同层级的关联裁判文书，让检索结果更加全面，提升了检索的智能化，降低了对用户检索能力的要求，使得用户能够以简化的查询条件快速、准确地得到需要的检索结果。
附图说明
通过阅读下文优选实施方式的详细描述，各种其他的优点和益处对于本领域普通技术人员将变得清楚明了。附图仅用于示出优选实施方式的目的，而并不认为是对本发明的限制。而且在整个附图中，用相同的参考符号表示相同的部件。在附图中：
图1示出了本发明实施例提出的一种裁判文书的检索方法的流程图；
图2示出了本发明实施例提出的一种裁判文书信息码的创建流程图；
图3示出了本发明实施例提出的一种裁判文书的维度层级树的结构示意图；
图4示出了本发明实施例提出的一种对裁判文书进行标记信息码操作以及利用关联信息进行关联操作的流程图；
图5示出了本发明实施例提出的一种裁判文书的检索装置的组成框图；
图6示出了本发明实施例提出的另一种裁判文书的检索装置的组成框图。
具体实施方式
下面将参照附图更详细地描述本发明的示例性实施例。虽然附图中显 示了本发明的示例性实施例，然而应当理解，可以以各种形式实现本发明而不应被这里阐述的实施例所限制。相反，提供这些实施例是为了能够更透彻地理解本发明，并且能够将本发明的范围完整的传达给本领域的技术人员。
本发明实施例提供了一种裁判文书的检索方法，如图1所示，该方法是在检索前对裁判文书库中的文书通过标注信息码的方式进行相互关联，通过关联关系在输出检索结果时，将符合的裁判文书以及相关联的裁判文书一同输出。本方法的具体步骤包括：
101、创建信息码。
本步骤是在用户录入检索信息之前，对保存裁判文书的检索数据库进行的预处理，其中，首先是根据检索数据库中的裁判文书按照预置的分类维度提取各个维度中的信息码，该信息码是从裁判文书中按照预置的分类维度提取的原子数据结构，用于对不同的裁判文书进行区分与关联。
具体而言，预置的分类维度是指按照裁判文书的标注格式进行不同维度的分类，例如，对于一篇裁判文书而言，根据其内容中所记录的信息，一般可以按照案由、当事人、法官、律师、文书类型、法院、审级等不同的维度进行分类，而在每个维度中，根据不同裁判文书中对应的信息还可以分为不同的层级，例如，在审级的维度中还包括一审、二审、终审等层级，在法院的维度中还包括高院、中院、基层院等层级，并且在同一层级中也还有可以进一步的进行区分，比如，在中院中，还可以分为北京市一中院、北京市二中院等。可见，预置的分类维度可根据法规标准进行选择，而信息码则是根据分类维度中不同维度内的各个层级中的节点生成的标识信息，该标识信息为最小的分类标识，而其所具有的数据结构就是原子数据结构，在确定分类维度以及维度层级后，该信息码就对应的确定下来，且不能再细化拆分。除非当修改分类维度或维度中的层级时，对应的信息码才会发生变化。
102、利用信息码对检索数据库中的裁判文书进行标记。
根据步骤101中所创建的信息码，对检索数据库中的每一篇裁判文书进行解析，也就是按照预置的分类维度确定裁判文书中在各分类维度下对 应的信息内容，分析该信息内容所对应的层级以及在层级中所对应的节点，当确定后，将该节点对应的信息码标记在裁判文书中。
需要说明的是，一篇裁判文书在进行信息码标记时，需要根据预置的分类维度逐一的进行匹配，也就是说，预置的分类维度越多，一篇裁判文书中所标记的信息码也就越多。
本步骤中，由于一篇裁判文书中往往会标记由多个信息码，而这些信息码在后续的检索匹配步骤中需要用到，因此，在标记时，可以对裁判文书统一标记一个数组字段，该数组字段中包括有不同维度的字段值，将所匹配出的信息码保存在对应维度下的字段中。
103、将标记有信息码的裁判文书按照预置关联信息进行关联。
其中，预置关联信息是指从具有相同信息内容的不同裁判文书中提取出的共同特征信息。例如，针对同一个案件进行的一审、二审后得到的两份裁判文书，那么这两份裁判文书在审级的维度下所标记的信息码是不同，而要将两份裁判文书进行关联，所对应的关联信息就是该案件的案件号。
在本步骤中，首先要确定的是关联信息，该关联信息是预先设置的，根据所设置的关联信息在检索数据库中对裁判文书逐一地进行关联，将具有相同关联信息的裁判文书建立关联关系。
包括本步骤在内的以上三个步骤均是在用户进行检索操作之前，对检索数据库中保存的裁判文书进行的处理操作，其中，对于更新检索数据库时，新增加的裁判文书也需要执行上述的操作，将新增加的裁判文书与已有的裁判文书进行关联操作。在此基础上，即创建了信息码以及建立了裁判文书之间的关联关系后，才可以执行后续的检索操作，即步骤104。
104、获取检索信息中对应的信息码。
当用户录入检索信息后，系统将根据检索信息匹配出对应的信息码。在本步骤中，具体实现可以是预先设定具体的检索条件，不同的条件对应不同的信息码或者是对应多个信息码的组合，由用户根据需要进行选择；也可以是由用户自由录入，由系统对所录入的信息进行解析，根据解析结果匹配对应的信息码或者是匹配多个信息码的组合。
105、根据检索信息中的信息码将标记有该信息码的裁判文书以及与该 裁判文书相关联的裁判文书作为检索结果加以输出显示。
本步骤是根据步骤104中得到的信息码在检索数据库中进行裁判文书的匹配以及结果的输出。
对于匹配过程，首先根据所得到的信息码，在检索数据库中查询具有该信息码的裁判文书，将具有该信息码的裁判文书作为检索结果的一部分加以输出显示。其次，再根据具有该信息码的裁判文书，逐一提取与具有检索信息码的裁判文书相关联的所有的裁判文书，将所关联的裁判文书也作为本次检索的检索结果进行输出显示。
进一步的，为了让用户清楚检索结果中各篇裁判文书与检索信息的关系，可以再显示裁判文书是对其标注关联信息，比如，在所显示的裁判文书的信息中标注“纵向检索结果”或者是“横向检索结果”，“纵向检索结果”表示含有检索信息码的裁判文书，“横向检索结果”则是表示与含有检索信息码的裁判文书具有相同关联信息的裁判文书。此外，对于横向检索结果中的裁判文书还可以再详细标注其与“纵向检索结果”中的哪一篇裁判文书具有关联关系，或者是具体的关联信息内容等。
在具体输出显示时，更优的一种显示方式是将检索结果按照不同的检索方式显示在不同的列表中，比如，将标记由检索信息码的裁判文书显示在第一检索列表中，该列表中的裁判文书为“纵向检索结果”，而将“横向检索结果”显示在第二检索列表中，在该列表中，每一篇裁判文书后还会标记出其与第一检索列表中具有相同关联信息的裁判文书，即显示与第一检索列表中内容的对应关系。
结合上述的实现方式可以看出，本发明实施例所采用的裁判文书的检索方法，通过对裁判文书库中的裁判文书进行关联处理，使得用户在检索裁判文书时，不仅能够根据输入的检索条件匹配出纵向的检索结果，也就是标注有检索的信息码的裁判文书，还能够得到与检索条件横向关联的裁判文书，即与检索的信息码同纬度且不同层级的关联裁判文书，让检索结果更加全面，提升了检索的智能化，降低了对用户检索能力的要求，使得用户能够以简化的查询条件快速、准确地得到需要的检索结果。
根据上述实施例所提出的裁判文书检索方法可以看出，要实现多角度 地检索出具有关联性的裁判文书，就需要对检索数据库中的裁判文书进行预先处理，而该处理主要包括信息码的创建以及对裁判文书标注信息码并进行关联两个步骤。以下，针对这个两个步骤在实际应用中的具体实现分别进行分别说明：
首先，在创建信息码的过程，具体的信息码生成方式如图2所示，包括：
201、根据预置的分类维度创建维度层级树。
其中，分类维度的数量可根据需求自定义设定，每一个维度对应生成一个维度层级树，在每个层级树中所包含的层级以及各层级中的节点均可以根据已有的分类方式进行自定义设置，例如，在对于法院层级树，可以设置该树具有三个层级，分别为高级法院、中级法院和基层法院，其中，法院层级树的根节点为高级法院，其所属的中级法院有两个，分别为第一中级法院和第二中级法院，第一中级法院下属三个基层法院，分别为第一基层法院、第二基层法院和第三基层法院，第二中级法院下属三个基层法院，分别为第二基层法院、第三基层法院和第四基层法院。据此得到的法院层级树如图3所示，而在实际应用中，用户可在设置法院层级树时根据实际需要对树中的节点进行增加或删除，比如，当存在第三中级法院时，则可以在树中的中级法院层增加该节点，并对应地设置其所属的基层法院。或者在没有第四基层法院时，可以将树中的对应节点删除。其中，中级法院所在的节点为高级法院所在节点的子级节点，同时，中级法院所在的节点又为基层法院所在节点的父级节点，一般地，在该层级树中，高级法院所在节点被称为根节点。
本步骤中，维度层级树的结构主要根据法规以及相关的规定生成标准的层级树，在此基础上，根据实际应用的需要进行调整，比如根据地域的不同进行区别化设置，或者根据法规的修改对层级树的结构进行修正。
202、根据维度层级树的结构，按照维度层级树中的子级节点生成对应的信息码。
首先，需要设定信息码的具体数据结构，本发明实施例中提供的一种信息码的数据结构为{Id，CodeKeyword，CodeType，CodePath，Pid}，其中，Id 为信息码唯一标识，CodeKeyword为码关键词，该码关键词就是对应于子节点的节点信息，CodeType为维度名称，CodePath为码路径，该码路径为子级节点的树枝路径，Pid为子级节点的父级节点。需要说明的是，在维度层级树中，树枝路径是指根节点到子级节点所构成的路径信息，在一个树枝路径中至少含有一个子级节点，而码路径可以为一个树枝路径，也可以为一个含有多级节点的树枝路径中的一部分路径。
其次，针对各个维度层级树中的每个子级节点获取信息码的数据结构中所对应的各字段的字段信息，以图3中的法院层级树为例，针对第一基层法院节点的信息码，所需的字段信息为：Id为一基层院，CodeKeyword为第一基层法院，CodeType为法院，CodePath为第一中级法院-第一基层房源，Pid为第一中级法院，那么针对该节点的信息码可以表示为{一基层院，第一基层法院，法院，第一中级法院-第一基层房源，第一中级法院}。在图3的层级树中所包含的7个节点，除了根节点“高级法院外”，另外6个子节点都会生成对应的一个信息码。
第三，根据维度层级树由顶层至下层的顺序逐层生成各子级节点对应的信息码。本发明实施例中，是从根节点向子节点，在同一层中由左至右逐一对每个子级节点生成信息码。
需要说明的是，对于图3中的第二基层节点所得到的信息码为{二基层院，第二基层法院，法院，第一中级法院/第二中级法院-第一基层房源，第一中级法院/第二中级法院}，在该节点中有多个父级节点，也就是说，信息码中的父级节点与子级节点的对应关系可以是多对多的关系。
203、以字典形式保存所生成的信息码，得到信息码字典。
在信息码字典中的信息码以键值对的形式进行存储，键为维度-关键词，即CodeType_CodeKeyword，值为信息码的结构对象。如此，根据检索数据库中的裁判文书中所匹配出的键值，就可以在信息码字典中查找到对应的信息码的结构对象，进而对该裁判文书进行信息码的标注。
其次，在完成上述的建立信息码以及信息码字典的操作后，接着执行对检索数据库中的裁判文书标注信息码并进行关联的操作，具体如图4所示，包括：
301、根据预置的分类维度对检索数据库中的裁判文书进行解析，得到裁判文书对应于各维度的维度信息。
本步骤中对于裁判文书的解析可以采用文书解析器实现，该文书解析器将根据设置的分类维度，解析出每个维度下裁判文书中所包含的维度信息，其中的分类维度与创建信息码时所设置的分类维度相对应。
维度信息的一种表现形式为维度-关键词，CodeType_CodeKeyword，例如，法院-第二中级法院、审级-二审等。解析出的维度信息主要是为了得到信息码字典中信息码的键值，从而为裁判文书在信息码字典中匹配对应的信息码。
302、根据维度信息匹配对应的信息码，并将该信息码标注在该裁判文书中。
根据信息码字典中键值的格式，从维度信息中提取对应的字段内容，组合成裁判文书的键值，使用该键值与信息码字典中的键值比对，当具有相同键值时，就将该键值所对应的信息码标注在该裁判文书中。一般的，根据设置的维度数量，一篇裁判文书能够标记出对应数量的信息码，将这些信息码保存在该裁判文书对应的数组字段中，并将该数组字段存储在解析数据库中。通过该解析数据库中记载的数据，就能够为用户快速匹配出含有信息码的裁判文书，也就是纵向的进行检索。
303、获取裁判文书的预置关联信息。
本步骤开始，是将检索数据库中标记有信息码的裁判文书进行横向的关联。而关联的基础是关联信息，该关联信息是预先设置的，在本发明实施例中，关联信息可以为具有同一案号的不同裁判文书，比如，针对同一个案件，在不同法院进行审理后得到的不同裁判文书，或者是在不同审级下得到的不同裁判文书(一审裁判文书、二审裁判文书)。
304、根据裁判文书中的信息码对应的分类维度，在该分类维度中查找与该裁判文书具有相同关联信息的关联裁判文书，并将关联裁判文书与裁判文书进行关联。
具体的，可以根据码信息对象中的码路径CodePath进行关联，在根据信息码对裁判文书进行分类时，具有相同关联信息的裁判文书，即同一案 号的不同裁判文书，在对应不同分类维度的维度层级树中，一定会分散在不同的层级的节点中，并且各个节点间接具有从属关系。因此，根据该特点，可通过字典的形式存储相互关联的裁判文书，其中，键为维度-码路径(CodeType_CodePath)，值为裁判文书名称数组。将该字典同样存储在解析数据库中。这样，根据用户录入的检索条件解析出对应的信息码，通过信息码中的维度信息以及码路径信息，就可以根据解析数据库中存储的字典快速匹配出具有相同关联信息的裁判文书，也就是横向的进行检索。
在经过上述对检索数据库中的裁判文书进行的标记信息码和关联处理后，用户就可以基于该检索数据库进行裁判文书的检索，得到具有横向与纵向不同的检索结果，例如，当用户输入的检索条件经解析后，得到的信息码的名称为“一基层院”，那么该信息码对象为{一基层院，第一基层法院，法院，第一中级法院-第一基层房源，第一中级法院}，对应得到的检索结果如下表中的示意：
表1，纵向检索结果示意
第一基层法院裁判文书
案件1一审
案件1再审
案件2一审
案件3一审
表2，横向检索结果示意
关联裁判文书
案件1第一中级法院一审
案件1第一中级法院再审
案件1高级法院一审
案件2第一中级法院一审
进一步的，作为对上述方法的实现，本发明实施例提供了一种裁判文书的检索装置，该装置实施例与前述方法实施例对应，为便于阅读，本装置实施例不再对前述方法实施例中的细节内容进行逐一赘述，但应当明确，本实施例中的装置能够对应实现前述方法实施例中的全部内容。该装置主要用于裁判文书数据以及对应检索引擎实现对用户录入的检索信息进行裁判文书的匹配，具体如图5所示，该装置包括：
创建单元41，用于创建信息码，所述信息码是从裁判文书中按照预置的分类维度提取的原子数据结构，用于对不同的裁判文书进行区分与关联；
标记单元42，用于利用所述创建单元41建立的信息码对检索数据库中的裁判文书进行标记；
关联单元43，用于将所述标记单元42标记有信息码的裁判文书按照预置关联信息进行关联；
获取单元44，用于获取检索信息中对应的信息码；
显示单元45，用于根据所述获取单元44获取的信息码将标记有所述信息码的裁判文书以及与所述裁判文书相关联的裁判文书作为检索结果加以输出显示。
进一步的，如图6所示，所述创建单元41包括：
建立模块411，用于根据预置的分类维度创建维度层级树，所述分类维度用于对裁判文书进行分类；
生成模块412，用于根据所述建立模块411建立的维度层级树的结构，按照所述维度层级树中的子级节点生成对应的信息码；
存储模块413，用于以字典形式保存所述生成模块412生成的信息码，得到信息码字典。
进一步的，如图6所示，所述生成模块412包括：
设置子模块4121，用于设置所述信息码的结构，所述结构为{Id，CodeKeyword，CodeType，CodePath，Pid}，其中，Id为信息码唯一标识，CodeKeyword为码关键词，所述码关键词对应于所述子级节点的节点信息，CodeType为维度名称，CodePath为码路径，所述码路径为所述子级节点的树枝路径，Pid为所述子级节点的父级节点；
获取子模块4122，用于针对每个子级节点获取所述设置子模块4121设置的信息码的结构中对应的各字段的字段信息；
生成子模块4123，用于根据所述维度层级树由顶层至下层的顺序和所述获取子模块4122获取的每个所述子级节点所对应的所述信息码的结构中对应的各字段的字段信息，逐层生成各子级节点对应的信息码。
进一步的，所述存储模块413还用于，在存储字典形式的信息码中， 键为CodeType_CodeKeyword，值为所述信息码的结构对象。
进一步的，如图6所示，所述关联单元43包括：
获取模块431，用于获取裁判文书的预置关联信息；
查找模块432，用于根据所述裁判文书中信息码的码路径查找所述码路径所属的树枝路径中其他节点所对应的裁判文书，从所述所对应的裁判文书中获取与所述裁判文书具有所述获取模块431获取的相同预置关联信息的关联裁判文书；
关联模块433，用于将所述查找模块432得到的关联裁判文书与所述裁判文书进行关联。
进一步的，如图6所示，所述标记单元42包括：
解析模块421，用于根据预置的分类维度对所述检索数据库中的裁判文书进行解析，得到所述裁判文书对应于各维度的维度信息；
匹配模块422，用于根据所述解析模块421解析得到的维度信息匹配对应的信息码；
标注模块423，用于将所述匹配模块422得到的信息码标注在所述裁判文书中。
进一步的，所述关联单元43包括：
所述获取模块还用于，获取裁判文书的预置关联信息；
所述查找模块还用于，根据所述裁判文书中的信息码的分类维度，在所述分类维度中查找与所述裁判文书具有相同预置关联信息的关联裁判文书；
所述关联模块还用于，将所述关联裁判文书与所述裁判文书进行关联。
进一步的，如图6所示，所述显示单元45包括：
第一显示模块451，用于提取标记有所述信息码的裁判文书，将其显示在第一检索列表中；
第二显示模块452，用于根据所述第一显示模块451显示的第一检索列表中的裁判文书提取与所述裁判文书具有相同关联信息的裁判文书，将其显示在第二检索列表中。
综上所述，本发明实施例所采用的裁判文书的检索方法及装置，通过 对裁判文书库中的裁判文书进行关联处理，使得用户在检索裁判文书时，不仅能够根据输入的检索条件匹配出纵向的检索结果，也就是标注有检索的信息码的裁判文书，还能够得到与检索条件横向关联的裁判文书，即与检索的信息码同纬度且不同层级的关联裁判文书，让检索结果更加全面，提升了检索的智能化，降低了对用户检索能力的要求，使得用户能够以简化的查询条件快速、准确地得到需要的检索结果。
所述裁判文书的检索装置包括处理器和存储器，上述创建单元、标记单元、关联单元、获取单元和显示单元等均作为程序单元存储在存储器中，由处理器执行存储在存储器中的上述程序单元来实现相应的功能。
处理器中包含内核，由内核去存储器中调取相应的程序单元。内核可以设置一个或以上，通过调整内核参数来实现对已有的裁判文书标记信息码，在检索时按照信息码的关联关系进行纵向与横向的检索，以提供更佳全面的检索结果。
存储器可能包括计算机可读介质中的非永久性存储器，随机存取存储器(RAM)和/或非易失性内存等形式，如只读存储器(ROM)或闪存(flash RAM)，存储器包括至少一个存储芯片。
本申请还提供了一种计算机程序产品，当在数据处理设备上执行时，适于执行初始化有如下方法步骤的程序代码：创建信息码，所述信息码是从裁判文书中按照预置的分类维度提取的原子数据结构，用于对不同的裁判文书进行区分与关联；利用所述信息码对检索数据库中的裁判文书进行标记；将标记有信息码的裁判文书按照预置关联信息进行关联；获取检索信息中对应的信息码；根据所述信息码将标记有所述信息码的裁判文书以及与所述裁判文书相关联的裁判文书作为检索结果加以输出显示。
本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
在一个典型的配置中，计算设备包括一个或多个处理器(CPU)、输入/输出接口、网络接口和内存。
存储器可能包括计算机可读介质中的非永久性存储器，随机存取存储器(RAM)和/或非易失性内存等形式，如只读存储器(ROM)或闪存(flash RAM)。存储器是计算机可读介质的示例。
计算机可读介质包括永久性和非永久性、可移动和非可移动媒体可以由任何方法或技术来实现信息存储。信息可以是计算机可读指令、数据结构、程序的模块或其他数据。计算机的存储介质的例子包括，但不限于相变内存(PRAM)、静态随机存取存储器(SRAM)、动态随机存取存储器(DRAM)、其他类型的随机存取存储器(RAM)、只读存储器(ROM)、电可擦除可编程只读存储器(EEPROM)、快闪记忆体或其他内存技术、只读光盘只读存储器(CD-ROM)、数字多功能光盘(DVD)或其他光学存储、磁 盒式磁带，磁带磁磁盘存储或其他磁性存储设备或任何其他非传输介质，可用于存储可以被计算设备访问的信息。按照本文中的界定，计算机可读介质不包括暂存电脑可读媒体(transitory media)，如调制的数据信号和载波。
还需要说明的是，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、商品或者设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、商品或者设备所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括要素的过程、方法、商品或者设备中还存在另外的相同要素。
本领域技术人员应明白，本申请的实施例可提供为方法、系统或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
以上仅为本申请的实施例而已，并不用于限制本申请。对于本领域技术人员来说，本申请可以有各种更改和变化。凡在本申请的精神和原理之内所作的任何修改、等同替换、改进等，均应包含在本申请的权利要求范围之内。

Claims (12)

  1. 一种裁判文书的检索方法，其特征在于，所述方法包括：
    创建信息码，所述信息码是从裁判文书中按照预置的分类维度提取的原子数据结构，用于对不同的裁判文书进行区分与关联；
    利用所述信息码对检索数据库中的裁判文书进行标记；
    将标记有信息码的裁判文书按照预置关联信息进行关联；
    获取检索信息中对应的信息码；
    根据检索信息中的信息码将标记有所述检索信息中的信息码的裁判文书以及与其相关联的裁判文书作为检索结果加以输出显示。
  2. 根据权利要求1所述的方法，其特征在于，所述创建信息码包括：
    根据预置的分类维度创建维度层级树，所述分类维度用于对裁判文书进行分类；
    根据所述维度层级树的结构，按照所述维度层级树中的子级节点生成对应的信息码；
    以字典形式保存所述信息码，得到信息码字典。
  3. 根据权利要求2所述的方法，其特征在于，所述根据所述维度层级树的结构，按照所述维度层级树中的子级节点生成对应的信息码包括：
    设置所述信息码的结构为{Id，CodeKeyword，CodeType，CodePath，Pid}，其中，Id为信息码唯一标识，CodeKeyword为码关键词，所述码关键词对应于所述子级节点的节点信息，CodeType为维度名称，CodePath为码路径，所述码路径为所述子级节点的树枝路径，Pid为所述子级节点的父级节点；
    针对每个子级节点获取所述信息码的结构中对应的各字段的字段信息；
    根据所述维度层级树由顶层至下层的顺序和每个所述子级节点所对应的所述信息码的结构中对应的各字段的字段信息，逐层生成各子级节点对应的信息码。
  4. 根据权利要求3所述的方法，其特征在于，所述以字典形式保存所述信息码包括：
    字典形式的信息码中，键为CodeType_CodeKeyword，值为所述信息码的结构对象。
  5. 根据权利要求4所述的方法，其特征在于，所述将标记有信息码的裁判文书按照预置关联信息进行关联包括：
    获取裁判文书的预置关联信息；
    根据所述裁判文书中信息码的码路径查找所述码路径所属的树枝路径中其他节点所对应的裁判文书；
    从所述所对应的裁判文书中获取与所述裁判文书具有相同预置关联信息的关联裁判文书；
    将所述关联裁判文书与所述裁判文书进行关联。
  6. 根据权利要求1-5中任一项所述的方法，其特征在于，所述利用所述信息码对检索数据库中的裁判文书进行标记包括：
    根据预置的分类维度对所述检索数据库中的裁判文书进行解析，得到所述裁判文书对应于各维度的维度信息；
    根据所述维度信息匹配对应的信息码；
    将所述信息码标注在所述裁判文书中。
  7. 根据权利要求1所述的方法，其特征在于，所述将标记有信息码的裁判文书按照预置关联信息进行关联包括：
    获取裁判文书的预置关联信息；
    根据所述裁判文书中的信息码的分类维度，在所述分类维度下查找与所述裁判文书具有相同预置关联信息的关联裁判文书；
    将所述关联裁判文书与所述裁判文书进行关联。
  8. 根据权利要求1或7所述的方法，其特征在于，所述根据检索信息中的信息码将标记有所述检索信息中的信息码的裁判文书以及与其相关联的裁判文书作为检索结果加以输出显示包括：
    提取标记有所述检索信息中的信息码的裁判文书，将其显示在第一检索列表中；
    根据所述第一检索列表中的裁判文书提取与所述裁判文书具有相同关联信息的裁判文书，将其显示在第二检索列表中。
  9. 一种裁判文书的检索装置，其特征在于，所述装置包括：
    创建单元，用于创建信息码，所述信息码是从裁判文书中按照预置的分类维度提取的原子数据结构，用于对不同的裁判文书进行区分与关联；
    标记单元，用于利用所述创建单元建立的信息码对检索数据库中的裁判文书进行标记；
    关联单元，用于将所述标记单元标记有信息码的裁判文书按照预置关联信息进行关联；
    获取单元，用于获取检索信息中对应的信息码；
    显示单元，用于根据所述获取单元获取的检索信息中的信息码将标记有所述检索信息中的信息码的裁判文书以及与所述裁判文书相关联的裁判文书作为检索结果加以输出显示。
  10. 根据权利要求9所述的装置，其特征在于，所述创建单元包括：
    建立模块，用于根据预置的分类维度创建维度层级树，所述分类维度用于对裁判文书进行分类；
    生成模块，用于根据所述建立模块建立的维度层级树的结构，按照所述维度层级树中的子级节点生成对应的信息码；
    存储模块，用于以字典形式保存所述生成模块生成的信息码，得到信息码字典。
  11. 一种存储介质，其特征在于，所述存储介质包括存储的程序，其中，在所述程序运行时控制所述存储介质所在设备执行权利要求1至权利要求8中任意一项所述的裁判文书的检索方法。
  12. 一种处理器，其特征在于，所述处理器用于运行程序，其中，所述程序运行时执行权利要求1至权利要求8中任意一项所述的裁判文书的检索方法。
PCT/CN2017/113044 2016-12-29 2017-11-27 一种裁判文书的检索方法及装置 WO2018121153A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/331,467 US11288326B2 (en) 2016-12-29 2017-11-27 Retrieval method and device for judgment documents

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201611247937.4 2016-12-29
CN201611247937.4A CN108255862B (zh) 2016-12-29 2016-12-29 一种裁判文书的检索方法及装置

Publications (1)

Publication Number Publication Date
WO2018121153A1 true WO2018121153A1 (zh) 2018-07-05

Family

ID=62707850

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/113044 WO2018121153A1 (zh) 2016-12-29 2017-11-27 一种裁判文书的检索方法及装置

Country Status (3)

Country Link
US (1) US11288326B2 (zh)
CN (1) CN108255862B (zh)
WO (1) WO2018121153A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110569360A (zh) * 2019-09-06 2019-12-13 成都深思科技有限公司 网络会话数据标注与自动关联的方法
US11288326B2 (en) * 2016-12-29 2022-03-29 Beijing Gridsum Technology Co., Ltd. Retrieval method and device for judgment documents
CN117807280A (zh) * 2024-02-29 2024-04-02 山东佰泰丰信息科技有限公司 一种静默自动触发式文档搜集方法

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109656941A (zh) * 2018-12-27 2019-04-19 上海百事通信息技术股份有限公司 案例推送系统
CA3130468A1 (en) * 2019-03-14 2020-09-17 Yadong Li Distributed system generating rule compiler engine apparatuses, methods, systems and media
CN110209760B (zh) * 2019-06-13 2022-04-15 北京百度网讯科技有限公司 历审案件关联的方法和装置、电子设备、计算机可读介质
CN110321439B (zh) * 2019-07-10 2022-02-25 北京市律典通科技有限公司 一种电子标注管理方法及系统
CN112581322A (zh) * 2019-09-29 2021-03-30 北京国双科技有限公司 裁判文书的处理方法及相关装置
CN111177240A (zh) * 2019-12-13 2020-05-19 贝壳技术有限公司 API数据导入方法、系统以及Mock数据生成方法
CN112085464B (zh) * 2020-08-24 2023-08-08 北京金堤征信服务有限公司 一种关联数据处理方法和装置
CN114237588A (zh) * 2021-12-16 2022-03-25 深圳壹账通创配科技有限公司 一种代码仓库选择方法、装置、设备及存储介质
CN114996400A (zh) * 2022-05-26 2022-09-02 平安银行股份有限公司 裁判文书处理方法、装置、电子设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101192237A (zh) * 2006-11-30 2008-06-04 国际商业机器公司 查询多方面信息的方法和系统
CN101952826A (zh) * 2008-02-21 2011-01-19 微软公司 基于文档关联的搜索
CN104090875A (zh) * 2013-04-01 2014-10-08 鸿富锦精密工业（深圳）有限公司 信息检索系统及方法
CN104281648A (zh) * 2014-05-12 2015-01-14 浙江大学 基于维度标签的搜索结果多维度导航方法
US20160299967A1 (en) * 2013-11-12 2016-10-13 International Business Machines Corporation Document retrieval using internal dictionary-hierarchies to adjust per-subject match results

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5875259A (en) * 1990-02-05 1999-02-23 Cummins-Allison Corp. Method and apparatus for discriminating and counting documents
US5799268A (en) * 1994-09-28 1998-08-25 Apple Computer, Inc. Method for extracting knowledge from online documentation and creating a glossary, index, help database or the like
US6236985B1 (en) * 1998-10-07 2001-05-22 International Business Machines Corporation System and method for searching databases with applications such as peer groups, collaborative filtering, and e-commerce
US6496568B1 (en) * 1999-04-12 2002-12-17 Avaya Technology Corp. Method and apparatus for providing automated notification to a customer of a real-time notification system
US6519586B2 (en) * 1999-08-06 2003-02-11 Compaq Computer Corporation Method and apparatus for automatic construction of faceted terminological feedback for document retrieval
AU2001243459A1 (en) * 2000-03-09 2001-09-17 The Web Access, Inc. Method and apparatus for performing a research task by interchangeably utilizinga multitude of search methodologies
US6865568B2 (en) * 2001-07-16 2005-03-08 Microsoft Corporation Method, apparatus, and computer-readable medium for searching and navigating a document database
US7519589B2 (en) * 2003-02-04 2009-04-14 Cataphora, Inc. Method and apparatus for sociological data analysis
US7237369B2 (en) * 2003-10-03 2007-07-03 Tipper Tie, Inc. Automated clipping packaging systems
US9158837B2 (en) * 2007-10-10 2015-10-13 International Business Machines Corporation Methods and apparatus for adaptive source filtering and load shedding for data stream processing
US9996567B2 (en) * 2014-05-30 2018-06-12 Georgetown University Process and framework for facilitating data sharing using a distributed hypergraph
US8286191B2 (en) * 2009-05-14 2012-10-09 International Business Machines Corporation Dynamically composing data stream processing applications
US20120327779A1 (en) * 2009-06-12 2012-12-27 Cygnus Broadband, Inc. Systems and methods for congestion detection for use in prioritizing and scheduling packets in a communication network
US8675654B2 (en) * 2010-10-05 2014-03-18 Cisco Technology, Inc. System and method for providing smart grid communications and management
EP2973226A4 (en) * 2013-03-13 2016-06-29 Kofax Inc CLASSIFICATION OF OBJECTS ON DIGITAL IMAGES RECORDED BY MOBILE DEVICES
CN104008171A (zh) * 2014-06-03 2014-08-27 中国科学院计算技术研究所 一种法律数据库构建方法及法律检索服务方法
WO2016141491A1 (en) * 2015-03-10 2016-09-15 Royal Bank Of Canada Systems and methods for managing data
US9699205B2 (en) * 2015-08-31 2017-07-04 Splunk Inc. Network security system
CN105930473B (zh) * 2016-04-25 2019-04-05 安徽富驰信息技术有限公司 一种基于随机森林技术的相似文件检索方法
CN108255862B (zh) * 2016-12-29 2019-09-17 北京国双科技有限公司 一种裁判文书的检索方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101192237A (zh) * 2006-11-30 2008-06-04 国际商业机器公司 查询多方面信息的方法和系统
CN101952826A (zh) * 2008-02-21 2011-01-19 微软公司 基于文档关联的搜索
CN104090875A (zh) * 2013-04-01 2014-10-08 鸿富锦精密工业（深圳）有限公司 信息检索系统及方法
US20160299967A1 (en) * 2013-11-12 2016-10-13 International Business Machines Corporation Document retrieval using internal dictionary-hierarchies to adjust per-subject match results
CN104281648A (zh) * 2014-05-12 2015-01-14 浙江大学 基于维度标签的搜索结果多维度导航方法

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11288326B2 (en) * 2016-12-29 2022-03-29 Beijing Gridsum Technology Co., Ltd. Retrieval method and device for judgment documents
CN110569360A (zh) * 2019-09-06 2019-12-13 成都深思科技有限公司 网络会话数据标注与自动关联的方法
CN117807280A (zh) * 2024-02-29 2024-04-02 山东佰泰丰信息科技有限公司 一种静默自动触发式文档搜集方法
CN117807280B (zh) * 2024-02-29 2024-05-03 山东佰泰丰信息科技有限公司 一种静默自动触发式文档搜集方法

Also Published As

Publication number Publication date
US20190347294A1 (en) 2019-11-14
US11288326B2 (en) 2022-03-29
CN108255862A (zh) 2018-07-06
CN108255862B (zh) 2019-09-17

Similar Documents

Publication Publication Date Title
WO2018121153A1 (zh) 一种裁判文书的检索方法及装置
WO2018072071A1 (zh) 知识图谱构建系统及方法
US9361317B2 (en) Method for entity enrichment of digital content to enable advanced search functionality in content management systems
CN110399515B (zh) 图片检索方法、装置及图片检索系统
US9330104B2 (en) Indexing and searching heterogenous data entities
CN112347123B (zh) 数据血缘的分析方法、装置和服务器
CN108694178B (zh) 一种推荐司法知识的方法及装置
US9224103B1 (en) Automatic annotation for training and evaluation of semantic analysis engines
CN114625732B (zh) 基于结构化查询语言sql的查询方法和系统
US20160292275A1 (en) System and method for extracting and searching for design
US8626737B1 (en) Method and apparatus for processing electronically stored information for electronic discovery
US10831820B2 (en) Content based image management and selection
CN108228612B (zh) 一种提取网络事件关键词以及情绪倾向的方法及装置
CN111553556A (zh) 业务数据分析方法、装置、计算机设备及存储介质
CN109101512B (zh) 法律数据库的构建方法、法律数据查询方法及装置
CN106802899B (zh) 网页正文抽取方法及装置
CA3012647A1 (en) Content based image management and selection
CN106372123B (zh) 一种基于标签的相关内容推荐方法和系统
CN116090416A (zh) 基于标准知识图谱的标准编写方法、系统、设备及介质
CN110555199B (zh) 基于热点素材的文章生成方法、装置、设备及存储介质
CN111401047A (zh) 法律文书的争议焦点生成方法、装置及计算机设备
CN114328844A (zh) 一种文本数据集管理方法、装置、设备及存储介质
CN113722278A (zh) 一种基于pdf文件的知识元抽取方法、设备及介质
Pavlova-Draganova et al. Modelling the Functionality of the Multimedia Digital Library for Fashion Objects
Sumikawa et al. Annotated dataset of history-related tweets

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17888687

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17888687

Country of ref document: EP

Kind code of ref document: A1