Intelligent law analysis method and system based on semantic graph model

JP2025077914AActive Publication Date: 2025-05-19ZHEJIANG NORMAL UNIV
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
JP2023197632
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-11-03
Filing Date
2023-11-21
Publication Date
2025-05-19
Estimated Expiration
2043-11-21

AI Technical Summary

Benefits of technology

【0020】 <有益な効果> 1)法学分野におけるGPT汎用モデルの応用革新を実現する。GPT汎用モデルと法律分野の具体的な判例のコンサルティング分析作業を組み合わせることで、従来の法学判例の分析はキーワード検索による単一の相互作用しかできないという問題を解決し、人間と機械の質問と回答の間のマルチラウンド相互作用という新しい応用効果を実現し、認知モードと判例分析の考え方を再構築する。 2)LawGPT専用モデルの適応的改造の技術革新を実現する、法学用語の専門性が高く、論理推論が複雑であるという独特な需要に対して、汎用大型モデルの言語処理、グラフニューラルネットワークの特徴、下流タスク利用などのモジュールに対して適応的な技術革新を行い、的確なLawGPTモデルを構築し、LawGPTモデルの技術的な有効性のテスト検証に合格した。 3)法学判例と法規間の知識を融合する方法の革新を実現する。

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2025077914000001_ABST
    Figure 2025077914000001_ABST
Patent Text Reader

Abstract

To provide an intelligent law analysis method and system based on a semantic graph model that efficiently provides users with services such as legal precedent feature extraction and marching.SOLUTION: An intelligent law analysis method based on a semantic graph model includes steps of: GPT language processing for adopting a deep learning model Transform network with a self-attention mechanism to convert an input legal text into a high-dimensional feature vector that can be processed by a computer; graph neural network feature optimization for optimizing the high-dimensional feature vector generated by a GPT language processing module, and realizing connection between nodes by constructing a semantic and knowledge relation so as to generate a law semantic feature, and converting text data into graph representation; and downstream task utilization for accepting the graph representation as input, and then outputting a corresponding result.SELECTED DRAWING: Figure 1
Need to check novelty before this filing date? Find Prior Art

Claims

1. A bill intelligent analysis method based on a semantic graph model, comprising: It includes three steps: a GPT language processing step, a graph neural network feature optimization step, and a downstream task step; In the GPT language processing step, a deep learning model Transformer network with a self-attention mechanism is used to convert the input legal text into a high-dimensional feature vector that can be processed by a computer; In the graph neural network feature optimization step, the high-dimensional feature vector by the GPT language processing module is further optimized and improved, and the connection between the nodes is realized by building the relationship between semantics and knowledge, thereby generating bill semantic features, and converting the text data into a graphic representation; In the downstream task utilization step, the graphic representation in the graph neural network feature optimization step is received as input, and then the corresponding result is output, thereby realizing the understanding and processing of legal text and the analysis of legal precedents.

2. The method for intelligent bill analysis based on a semantic graph model according to claim 1 , wherein the downstream tasks include bill comprehension, bill summarization, bill preparation, bill compliance, bill simulation, and bill management.

3. The GPT language processing module performs supervised tasks based on the GPT-2 framework with unsupervised pre-trained models, and its core lies in language modeling, which is a form of unsupervised distribution estimation. Natural language text is sequence data composed of a set of words or phrases of variable length, and since language is naturally sequenced, the joint probability of symbols is decomposed into a product of conditional probabilities; [0010] Here, p(s) is the probability that the language model generates phrase s, and the length of phrase s after word segmentation is N. The conditional probability in the above formula is the probability of generating the first i-1 (2≦i≦N) words s in the language model. 1 , …, s i-1 When we give the i-th word probability estimate p(s i |s 1 , …, s i-1 2. The method for intelligent analysis of bills based on a semantic graph model according to claim 1, further comprising:

4. The method for intelligent analysis of bills based on semantic graph models, as described in claim 3, further comprising: for each sub-block of the standard Transformer model, placing a layer of regularization for each layer before each sub-block, adding a layer of regularization layer after the last self-attention region, expanding the size of the context to 1024 tokens, and correcting to use a batchsize of 512.

5. In the GPT language processing step, before inputting the text into the model, a quantization process is performed, and then the text is divided into words, a thesaurus is constructed, and then the token is mapped as an ID. The method for intelligent analysis of bills based on a semantic graph model as claimed in claim 4, characterized in that in the step of quantization processing, the input Chinese text is converted into Unicode, unrepresentable characters are deleted, and space characters are converted into displayable space characters, and then spaces are added before and after the Chinese characters, and words are split by spaces.

6. The Transformer uses a self-attention mechanism to process long sequences of sentences at the input, modeling dependencies and serially connecting different positions of a sequence so that each word can establish weighted dependencies on itself and other words at the reconstruction time. The weights are calculated as follows: Each word vector is divided into one query vector q i and one key vector k i and q i And calculate the similarity or correlation of all key vectors, and normalize it with probability estimation through Softmax; [0025] Here, sim ij =q i T k j and a ij is the i-th query vector q i and the j-th key vector k j is the attention coefficient of , e is a natural number, T denotes the matrix transpose, In the third step, the Attention operation in the Transformer is performed. [0030] The query, key, and value vector sums of each word in the sentence are spliced ​​into a matrix and parallel operations are performed, where [0045] is a matrix representation of the query vector, [0050] is a matrix representation of the key vector, [006] is a matrix representation of the value vector, [0070] is the matrix representation of the output vector, and d k The method for intelligent analysis of bills based on a semantic graph model according to claim 5, wherein is the number of dimensions of the query, key and value vectors.

7. The method for intelligent analysis of bills based on a semantic graph model as claimed in claim 1, characterized in that the graph neural network feature optimization includes classifying texts based on the text features extracted in the text analysis part and calculating the similarity between texts, specifically, first performing a linear transformation using a shared weight matrix on the input embedding, then using a self-attention mechanism for each adjacent node, and finally normalizing all adjacent nodes of a node using a softmax function, thereby giving a stable distribution to the output of each node.

8. A multi-head attention mechanism with multiple trainable attention vectors is used to calculate attention coefficients and node feature convolution for each vector separately, and after calculating the output structure, a nonlinear transformation of the mean function and activation function is performed; [0080] Here, W k is the linear layer weight of the kth head, the superscript k denotes the index of the head in the multi-head attention mechanism, σ is a nonlinear activation function, and h i is the input word vector of the i-th word, and h i ’ The method for intelligent analysis of bills based on semantic graph model according to claim 7, wherein i is the output word vector of the i-th word.

9. Downstream task utilization steps include feature extraction and task adaptation; Feature extraction includes three steps: feature selection, which selects optimal features from the preprocessed data; feature extraction, which extracts the most representative features from the selected features; and feature representation, which represents the extracted features as vectors. The method for intelligent analysis of bills based on a semantic graph model as claimed in claim 1, characterized in that task adaptation includes two steps: task classification, which divides downstream tasks into different categories and processes them using different models for each category, and feature adjustment, which adjusts the extracted features according to the downstream tasks.

10. A system for intelligent analysis of bills based on a semantic graph model, which is used to implement the method according to any one of claims 1 to 9, a GPT language processing module that converts input legal text into a high-dimensional feature vector that can be processed by a computer; A graph neural network feature optimization module further optimizes and improves the high-dimensional feature vectors from the GPT language processing module to convert the text data into a graphical representation; and a downstream task utilization module for receiving as input the graphic representation in the graph neural network feature optimization step, and then outputting corresponding results, thereby realizing legal text understanding and processing, and legal precedent analysis.

Citation Information

Cited By

  • Knowledge base establishment method and system of service platform

    CN120671793A