| 摘要 |
A name identification rule generating method, includes: generating an abstract syntax tree by removing a portion of an input sentence unrelated to a process in analysis of syntax of the input sentence by a computer; setting, in generating the abstract syntax tree, nodes corresponding to a plurality of arguments at the same layer; and generating, in generating the abstract syntax tree, a first character string pattern including a second character string corresponding to a node of the abstract syntax tree where a number of types of terminal symbols on the node is equal to or smaller than a certain multiple of a number of types of processes that call the input sentence. |
| 主权项 |
1. A name identification rule generating method comprising:
performing, by a computer, a detecting process to detect a first character string pattern which is used for identifying, from a plurality of input sentences corresponding to a plurality of requests which request to perform a plurality of processes, sentences which are rendered as the same with each other; and classifying the plurality of requests based on the first character string to perform a system process including the plurality of processes, wherein the detecting process includes operations of:
generating each of a plurality of abstract syntax trees by removing a portion of each of the plurality of input sentences unrelated to each of the plurality of processes in analysis of syntax of the input sentences;setting, in generating the abstract syntax trees, nodes corresponding to a plurality of arguments at the same layer;classifying the abstract syntax trees into a set of first abstract syntax trees having substantially identical nonterminal symbols of nodes excluding leaf nodes from a first layer corresponding to a root node of the abstract syntax trees to a preceding layer of the leaf nodes;listing, as a first character string pattern, a first character string at first leaf nodes of the leaf nodes, a first number of types of terminal symbols at the first leaf nodes which are located at the same position in the set of first abstract syntax trees is equal to or smaller than a certain multiple of a number of types of the processes; anddeleting, as the first character string pattern, a second character string at second leaf nodes of the leaf nodes, a second number of types of terminal symbols at the second leaf nodes which are located at the same position in the set of first abstract syntax trees is larger than the certain multiple of the number of types of the processes. |
