JP2009015395A - Dictionary construction support device and dictionary construction support program - Google Patents

Abstract

[PROBLEMS] To support the construction of dictionary information for character string pattern matching processing for a user who does not have knowledge of natural language processing or a user who cannot disclose all technical information.
A regular expression generation unit 14 of a dictionary construction support apparatus 1 refers to a regular expression generation rule database to describe a description of a morpheme analysis result of a user-specified character string, a dictionary registration corresponding expression described in regular expressions, and a dictionary registration exclusion. Convert to representation. The user output generation unit 15 refers to the user output generation rule, converts the dictionary registration corresponding expression and the dictionary registration exclusion expression into expressions not described in regular expressions, and outputs the converted expressions to the user terminal device 2. As a result, it is possible to obtain dictionary registration corresponding expressions and dictionary registration exclusion expressions including know-how of dictionary registration expressions, and make them subject to registration in dictionary information. Also, there is little knowledge of natural language processing and disclosure of all technical information Output suitable for users who cannot.
[Selection] Figure 1

Description

  The present invention relates to a dictionary construction support apparatus and a dictionary construction support program for creating a dictionary for character string pattern matching processing.

In order to support the construction of a conventional dictionary for character string pattern matching processing, there is one that analyzes an expression input by a user and converts it into a paraphrase expression prepared in advance. For example, as disclosed in Patent Document 1, morphological analysis and syntactic analysis are performed on expressions input by a user to determine part of speech and syntax patterns, and dictionary registration is performed by referring to paraphrase patterns prepared in advance according to part of speech utilization. There is something to get a representation for.
JP 2003-173338 A

  However, the processing results of morphological analysis and syntactic analysis, and regular expressions used for describing paraphrased expressions have a problem that it is difficult for a user who does not have knowledge of natural language processing to decipher them.

  In addition, even if a user who has knowledge of natural language processing uses it, if it is not appropriate to disclose technical information included in the paraphrase expression, output information is controlled only to the extent that it may be disclosed. There was a problem that there was no means to do.

  Accordingly, an object of the present invention is to provide dictionary construction support that can support construction of dictionary information for character string pattern matching processing for users who do not have knowledge of natural language processing or who cannot be disclosed all technical information. It is to provide a device and a dictionary construction support program.

  That is, the dictionary construction support apparatus according to the present invention includes an input unit for inputting a character string for registration in dictionary information, a morpheme analysis unit for performing a morpheme analysis process on the input character string, a morpheme analysis regular expression pattern, and a dictionary. A first pattern storage means for storing the registered regular expression pattern in association with the first pattern storage means; a second pattern storage means for storing the dictionary registered regular expression pattern and the output regular expression pattern in association with each other; The portion that matches the morphological analysis regular expression pattern stored in the first pattern storage means is converted into a dictionary registered regular expression pattern that is associated with the matching pattern, and the second pattern storage means of the conversion result A regular expression for output that associates a part that matches the dictionary registered regular expression pattern stored in Into a turn, the description of the conversion result, and outputs by converting the description which does not contain a regular expression.

  According to the present invention, it is possible to support the construction of dictionary information for character string pattern matching processing for a user who does not have knowledge of natural language processing or a user who cannot be disclosed all technical information.

Embodiments of the present invention will be described below with reference to the drawings.
(First embodiment)
First, a first embodiment of the present invention will be described.
FIG. 1 is a block diagram showing a configuration example of a dictionary construction support device of a document processing device according to the first embodiment of the present invention. FIG. 2 is a block diagram showing a configuration example of the user terminal device of the document processing device according to the first embodiment of the present invention.
As shown in FIG. 1, the dictionary construction support apparatus 1 includes a control unit 11, a storage device 12, a morpheme analysis unit 13, a regular expression generation unit 14, a user output generation unit 15, and an input / output interface 16 that are responsible for processing of the entire apparatus. Are connected to each other via a bus 17.

  The storage device 12 is a storage device configured by hardware such as a hard disk drive or a nonvolatile memory device. The storage device 12 includes a regular expression rule storage unit 31 for storing a regular expression generation rule database in addition to a control program by the control unit 11, the morpheme analysis unit 13, the regular expression generation unit 14, and the user output generation unit 15. And an output rule storage unit 32 for storing an output generation rule database for users. These rule databases will be described later. The storage device 12 also functions as a work memory for various processes performed by the control unit 11, the morphological analysis unit 13, the regular expression generation unit 14, and the user output generation unit 15.

  The morpheme analysis unit 13 performs a morpheme analysis process on the user-specified character string input by the user. The morpheme analysis process is a process of dividing an input character string into words and adding parts of speech.

  The regular expression generation unit 14 refers to the regular expression generation rule database stored in the regular expression rule storage unit 31 of the storage device 12, converts the result of the morphological analysis processing of the user-specified character string into a dictionary registration expression, and converts this conversion The result is stored in the storage device 12. The regular expression generation unit 14 includes a rule acquisition unit 41, a match determination unit 42, a dictionary registered expression conversion unit 43, an exclusion expression determination unit 44, and an exclusion expression processing unit 45. These functions will be described later.

  The user output generation unit 15 refers to the user output generation rule database recorded in the output rule storage unit 32 of the storage device 12, converts the dictionary registration expression into the user output expression, and the conversion result is stored in the storage device 12. To record. The user output generation unit 15 includes a rule acquisition unit 51, a match determination unit 52, an output conversion unit 53, a morpheme analysis symbol processing unit 54, and a regular expression expansion processing unit 55. These functions will be described later.

  The user terminal device 2 is a terminal device handled by a user who creates dictionary data. The user terminal device 2 includes a control unit 21 that controls processing of the entire device, a storage device 22, a display device 23, an input device 24, and a communication interface 25, which are connected to each other via a bus 26.

The storage device 22 is a storage device configured by hardware such as a hard disk drive or a non-volatile memory device, and stores a control program. The storage device 22 also functions as a work memory for various processes performed by the control unit 21.
The display device 23 is a liquid crystal display, for example, and displays a dictionary created by the user. The input device 24 is a keyboard or a mouse, for example, and accepts an operation related to new creation of dictionary data.
The communication interface 25 is connected to the dictionary construction support device 1 via a cable, and exchanges dictionary data created in the user terminal device 2 and processing results of the dictionary construction support device 1. The communication interface 25 can be connected to an external storage device via a cable, and dictionary data can be input / output to / from the external storage device.

FIG. 3 is a diagram showing, in tabular form, a configuration example of a regular expression generation rule database stored in the storage device of the dictionary construction support device according to the first embodiment of the present invention. In the regular expression generation rule database, morphological analysis results, corresponding expressions for dictionary registration, and exclusion expressions for dictionary registration are managed in association with each other.
The morpheme analysis result in the regular expression generation rule database is a pattern resulting from morphological analysis of a user-specified character string, and a character string pattern included in the morpheme analysis result is described in regular expressions. The dictionary registered corresponding expression in the regular expression generation rule database is obtained by describing, as a regular expression, a character string pattern registered as a corresponding expression in the dictionary with respect to the result of the morphological analysis processing of the user-specified character string. In addition, the dictionary registration exclusion expression in the regular expression generation rule database is a pattern matching among the expressions corresponding to the dictionary registration corresponding expression for the result of morphological analysis processing of the user-specified character string and the dictionary registration corresponding expression. When there is an expression to be excluded from, a regular expression of the character string pattern is described.

In the first line of the regular expression generation rule database shown in FIG. 3, the morpheme analysis result regular expression pattern “-ha \ [attached word \]” to be converted by the regular expression generation rule, the dictionary registration corresponding expression “-[ Homoga] \ [Attachment word \] "is stored, and dictionary registration exclusion expressions are not stored. In the second line, the morphological analysis result “\ [adjective \]-[Ishi]”, the dictionary registration corresponding expression “\ [adjective \]-[A-n] ^* ”, and the dictionary registration exclusion expression “\ [adjective \ ]-(Not | not) "is stored.

FIG. 4 is a diagram showing, in tabular form, a configuration example of a user output generation rule database stored in the storage device of the dictionary construction support device according to the first embodiment of the present invention. In the user output generation rule database, dictionary registration expressions and user output are associated and managed.
The dictionary registration expression in the user output generation rule database describes a character string generated as a dictionary registration corresponding expression and a dictionary registration exclusion expression. Further, the user output generation rule database user output describes a character string obtained by converting a dictionary registration corresponding expression or a dictionary registration exclusion expression for a user.

In the first line of the user output generation rule database shown in FIG. 4, the dictionary registered expression pattern “-[Hamoga] \ [Attachment \]” to be converted by the user output generation rule, the output for the user The expression “(ha | also |) \ [attached word \]” is stored.
In the second line, a dictionary registration expression pattern “\ [adjective \]-[an-] ^* ” and an output expression “\ [adjective \]-(I | Kat | kute)” for the user are stored. In the third line, a dictionary registration expression pattern “\ [adjective \]-(not | not)” and an output expression “\ [adjective \]-(not | not)” for the user are stored.

Next, the operation of the document processing apparatus having the configuration shown in FIGS. 1 and 2 will be described. FIG. 5 is a flowchart showing an example of the processing operation of the document processing apparatus according to the first embodiment of the present invention.
First, when a dictionary structure including a user-specified character string is input by an operation on the input device 24 of the user terminal device 2 (step S1), the control unit 21 stores this document data in the storage device 22.

  When an operation related to the dictionary construction support processing request is performed on the input device 24, the control unit 21 changes the user-specified character string from the dictionary structure including the user-specified character string stored in the storage device 22 in units of lines of the dictionary structure. Is output to the dictionary construction support apparatus 1 via the communication interface 25.

FIG. 6 is a diagram showing an example of a dictionary structure including a designated character string input by the dictionary construction support apparatus according to the first embodiment of the present invention.
The dictionary structure shown in FIG. 6 includes a concept class “good”, a key concept “no problem”, and a user-specified character string “no problem”. The key concept is a name of a concept that is determined as information included in a document when a user-specified character string exists in the document. The concept class is a group of key concepts, and one or more key concepts correspond to the concept class. The dictionary structure is not limited to this structure, and may be a structure having no concept class, for example.

When the input / output interface 16 of the dictionary construction support apparatus 1 inputs a user-specified character string from the user terminal device 2, the morpheme analysis unit 13 performs morphological analysis on the user-specified character string, divides the character string into words, and gives parts of speech. (Step S2).
When the morphological analysis unit 13 inputs the character string “no problem” shown in FIG. 6, the morphological analysis result “/ problem [noun] -is [an adjunct] / na [adjective] -i [utilization ending]” is obtained. obtain.

  Then, the regular expression generation unit 14 generates a regular expression for dictionary registration from the morphological analysis result of the user-specified character string obtained by the morpheme analysis unit 13 (step S3).

  Here, the details of the regular expression generation process which is the process of step S4 by the regular expression generation unit 14 will be described. FIG. 7 is a flowchart showing an example of regular expression generation processing by the dictionary construction support apparatus according to the first embodiment of the present invention. FIG. 8 is a diagram showing an example of data transition by the regular expression generation process by the dictionary construction support device according to the first embodiment of the present invention.

  In order to perform the regular expression generation process, the regular expression generation unit 14 determines the description of the morpheme analysis result obtained in the process of step S2 as the dictionary registration corresponding expression initial state and the dictionary registration exclusion expression initial state (step S41). . Then, the rule acquisition unit 41 of the regular expression generation unit 14 acquires the uppermost rule from the regular expression generation rule database stored in the storage device 12 (step S42).

Next, the match determination unit 42 of the regular expression generation unit 14 determines whether the morphological analysis result regular expression pattern of the acquired rule matches the morphological analysis result of the user-specified character string as a regular expression (step S43). .
When it is determined that the dictionary registration expression conversion unit 43 of the regular expression generation unit 14 matches (YES in Step S43), the rule that acquired the matching portion in the description of the initial state of the dictionary registration corresponding expression from the regular expression generation rule database The morpheme analysis result is converted to a dictionary-relevant expression that is associated with the regular expression pattern, and the matching part in the initial description of the dictionary-excluded expression is associated with the regular expression pattern of the rule obtained from the regular expression generation rule database The dictionary registration exclusion expression is converted (step S44).

If it is determined “NO” after the process of step S44 or the process of step S43, the regular expression generation unit 14 determines whether the regular expression generation rule database includes the next rule (step S45).
If the regular expression generation unit 14 determines that there is the next rule (YES in step S45), the regular expression generation unit 14 returns to the process of step S42 and acquires the next lower rule in the regular expression generation rule database. When the regular expression generation unit 14 determines that there is no next rule (NO in step S45), the exclusion expression determination unit 44 determines that the dictionary registration exclusion expression conversion result obtained in the process of step S44 corresponds to the dictionary registration. It is determined whether the result is the same as the expression conversion result (step S46).

  When the excluded expression determination unit 44 of the regular expression generation unit 14 determines “YES” in the process of step S46, the excluded expression processing unit 45 deletes the dictionary registration excluded expression conversion result obtained in the process of step S44. (Step S47), the remaining dictionary registration corresponding expression conversion result is output as a dictionary registration corresponding expression.

  On the other hand, if the exclusion expression determination unit 44 of the regular expression generation unit 14 determines “NO” in the process of step S46, the exclusion expression processing unit 45 uses the dictionary registration exclusion expression conversion result obtained in the process of step S44. The dictionary registration exclusion expression is output, and the dictionary registration corresponding expression conversion result is output as the dictionary registration corresponding expression.

As shown in FIG. 8, the regular expression generation unit 14, when the description of the morphological analysis result is “/ problem [noun] -is [attachment] / na [adjective] -i [utilization ending]”. The same description is used as the description of the dictionary registration corresponding expression initial state and the dictionary registration exclusion expression initial state.
In this case, in the description of the morphological analysis result “/ problem [noun]-is an [adjunct] / na [adjective] -i [utilization ending]”, “-is an [adjunct]” is the regular expression generation shown in FIG. Since the regular expression pattern “-ha \ [attached word \]” in the first line of the rule database is matched, the dictionary registration expression conversion unit 43 performs a description “ / Problem [Noun]-is an [adjunct] / na [adjective] -i [utilization ending] "-" [adjunct] "is the first line morpheme of the regular expression generation rule database shown in FIG. It is converted into a dictionary registered corresponding expression “-[Hamoga] \ [Attachment word \]” associated with the regular expression pattern of the analysis result.

  In addition, the dictionary registration exclusion expression associated with the regular expression pattern of the morpheme analysis result on the first line is blank. In this case, the dictionary registration expression conversion unit 43 performs the description of the initial state of the dictionary registration exclusion expression by the process of step S44. Morphological analysis of the first line of the regular expression generation rule database showing "-is an [adjunct]" in "/ problem [noun]-is an [adjunct] / na [adjective] -i [utilization ending]" Result It is converted to the dictionary registered corresponding expression “-[Hamoga] \ [Attachment word \]” associated with the regular expression pattern.

Furthermore, in the description of the morphological analysis result “/ problem [noun] -is [adjunct] / na [adjective] -i [utilization ending]”, “[adjective] -i” is the regular expression generation rule database shown in FIG. Since the morpheme analysis result regular expression pattern “\ [adjectives \]-[Ishi]” in the second line of “” is matched, the dictionary registration expression conversion unit 43 performs a description “ / Problem [Noun]-is an [adjective] / na [adjective] -i [utilization ending]] and the [morpheme] in the second line of the regular expression generation rule database shown in FIG. The result of the analysis is converted to the dictionary registration corresponding expression “\ [adjective \]-[an] ^* ” associated with the regular expression pattern, and the description of the dictionary registration corresponding expression exclusion state “/ problem [noun]-is an [adjunct]” / [[Adjective] -i [utilization ending] "" [adjective] "is the same two lines in the regular expression generation rule database shown in FIG. Morphological analysis result dictionary registration exclude representations associated with the regular expression pattern "\ [adjective \] - (wards | Cala'n)" of converting into.

By performing such conversion, as shown in FIG. 8, the dictionary registration expression conversion unit 43 of the regular expression generation unit 14 describes the initial state “/ problem [noun] − ] / Na [adjective] -i [utilization ending] ”, description of the corresponding dictionary conversion result“ / problem \ [noun \]-[hamamo] \ [adjunct \] / na \ [ Get the adjective \]-[an-] ^* \ [utilization ending \] ".

  Further, as shown in FIG. 8, the dictionary registration expression conversion unit 43 reads the description of the initial state of the dictionary registration exclusion expression “/ problem [noun] -is [attachment] / na [adjective] -i [utilization ending]”. Based on the description of the dictionary registration exclusion expression conversion result "/ problem \ [noun \]-[Hamoga] \ [adjunct \] / na \ [adjectives \]-(not | not) \ [ Take advantage ending \] ".

Then, as shown in FIG. 8, the regular expression generation unit 14 describes the description of the dictionary registration exclusion expression conversion result “/ problem \ [noun \]-[hamamo] \ [attachment \] / na \ [adjective \ ]-(Not | Kazuzazu) \ [Utilization ending \] "is output as a dictionary registration exclusion expression, and the description of the dictionary registration corresponding expression conversion result" / problem \ [noun \]-[hamamo] \ [included] Word \] / na \ [adjective \]-[an-] ^* \ [utilization ending \] "is output as a dictionary registered corresponding expression. This is the end of the detailed description of the processing in step S3.

  The control unit 11 outputs the dictionary registration corresponding expression and the dictionary registration exclusion expression output from the regular expression generation unit 14 to the user output generation unit 15. The user output generation unit 15 performs a user output generation process based on the input dictionary registration corresponding expression and dictionary registration exclusion expression (step S4).

  FIG. 9 is a flowchart showing an example of an output generation process for the user by the dictionary construction support apparatus according to the first embodiment of the present invention. FIG. 10 is a diagram showing an example of data transition by the output generation process for the user by the dictionary construction support apparatus according to the first embodiment of the present invention.

  The user output generation unit 15 outputs the dictionary registration corresponding expression and the dictionary registration exclusion expression, which are output results from the regular expression generation unit 14, to the user output corresponding expression initial state and the user output, respectively, in order to perform user output generation processing. The excluded expression initial state is set (step S51). The rule acquisition unit 51 of the user output generation unit 15 acquires the uppermost rule from the user output generation rule database stored in the storage device 12 (step S52).

Next, the match determination unit 52 of the user output generation unit 15 sets the description of the dictionary registration expression of the acquired rule to the user output corresponding expression initial state or the user output exclusion expression initial state which is the processing result of step S51. It is determined whether it is included (step S53).
If the output conversion unit 53 of the output generation unit for user 15 determines “YES” in the process of step S53, the output conversion unit 53 of the acquired rule among the descriptions of the initial output corresponding expression for the user and the initial expression for the output exclusion expression for the user. The matching part is converted into a description of the user output associated on the user output generation rule database (step S54).

The user output generation unit 15 determines whether or not there is a lower-level rule on the user output generation rule database after the process of step S54 or the determination of “NO” in the process of step S53 (step S55). .
If there is a next lower rule (YES in step S55), the user output generation unit 15 returns to step S53 and repeats the process for the next rule.
On the other hand, when the user output generation unit 15 determines that there is no lower rule (NO in step S55), the output conversion unit 53 determines the corresponding expression and the exclusion expression of the user output.

As shown in FIG. 8, the output conversion unit 53 of the user output generation unit 15 has a description of the corresponding dictionary registration corresponding to “/ problem \ [noun \]-[hamamo] \ [attached word \] / In the case of \ [adjective \]-[an] ^* \ [utilization ending \] ", this description is a description of the initial state of the output corresponding expression for the user as shown in FIG.
In this case, “-[Homoga] \ [Attachment \]” in the description of the initial state of the corresponding output expression for the user is the dictionary registration expression “-[Homoga] in the first line of the output rule database for the user shown in FIG. ”\ [Attached word \]”, the output conversion unit 53 adds the description “-[Homoga] \ [attached word \]” of the output corresponding expression initial state for the user by the process of step S54. The user-generated output “-(ha | also | is) \ [attached word \]” associated with the dictionary registration expression in the first line of the user generation rule database shown in FIG. 4 is converted.

Also, “\ [adjective \]-[an] ^* ” in the description of the initial state of the corresponding output expression for the user is the dictionary registration expression “\ [adjective \” on the second line of the user output rule database shown in FIG. ]-[Ann] ^* ”, the output conversion unit 53 outputs the description“ \ [adjective \]-[Ann] ^* ”of the output corresponding expression initial state for the user by the process of step S54. The output is converted into a user output “\ [adjective \]-(I | Kat | Kute)” associated with the dictionary registration expression on the first line of the user generation rule database shown in FIG.

  As shown in FIG. 8, the output conversion unit 53 of the user output generation unit 15 has a description of the dictionary registration exclusion expression “/ problem \ [noun \]-[hamamo] \ [attached word \] / In the case of \ [adjective \]-(not | not) \ [utilized ending \] ", this description is the description of the output exclusion expression initial state for the user as shown in FIG.

  In this case, “-[Homoga] \ [Attachment word \]” in the description of the user output exclusion expression initial state is the dictionary registration expression “-[Hamoga” on the first line of the user output rule database shown in FIG. ”\ [Attached word \]”, the output converting unit 53 performs the process of step S54 to add “-[Homoga] \ [attached word \” included in the description of the output exclusion expression initial state for the user. ] ”Is converted into a user output“-(ha | also |) ”\ [attachment word]] associated with the dictionary registration expression in the first line of the user generation rule database shown in FIG.

  In addition, “\ [adjectives \]-(not | karazazu)” in the description of the initial state corresponding to the user output corresponding expression is “\ [adjective” in the third line of the user output rule database shown in FIG. \ "-(Not | not)", the output conversion unit 53 performs the process of step S54 to describe the initial state corresponding to the user output corresponding expression "\ [adjective \]-(not | not ) "Is converted into a user output" \ [adjective \]-(not | not) "associated with the dictionary registration expression on the third line of the user generation rule database shown in FIG.

That is, as shown in FIG. 10, the output conversion unit 53 describes the initial state of the output corresponding expression for the user “/ problem \ [noun \]-[hamamo] \ [adjunct \] / na \ [adjective \ ]-[A-n] ^* \ [utilization ending \] ", the corresponding expression" / problem \ [noun \]-(ha | mo | ga) \ [adjunct \] / na \ [adjective \] ]-(I | Kat | Kute) \ [Utilization ending \] ".

  Also, as shown in FIG. 10, the output conversion unit 53 describes the initial state of the output exclusion expression for the user “/ problem \ [noun \]-[hamamo] \ [adjunct \] / na \ [adjective \ ]-(Not | Kazuzazu) \ [Utilization ending \] ", the exclusion expression" / problem \ [noun \]-(ha | mo |) "\ [adjunct \] / na \ [adjective \]-(Not | not) \ [utilization ending \] ".

  After the corresponding expression and the excluded expression are determined, the morpheme analysis symbol processing unit 54 deletes the morpheme analysis result symbol and the backslash \ symbol from the corresponding expression and the excluded expression that are the processing results of step S54 (step S56).

As shown in FIG. 10, the morphological analysis symbol processing unit 54 stores the description of the corresponding expression as the processing result of step S54 as “/ problem \ [noun \]-(ha | also |) | [attachment \]”. / Na \ [adjective \]-(I | Kat | kute) \ [practical ending \] ", the corresponding expression" problem excluding the morphological analysis result symbol and backslash \ symbol from this description (Has also | is |
Further, as shown in FIG. 10, the morphological analysis symbol processing unit 54 indicates that the description of the exclusion expression as the processing result of step S54 is “/ problem \ [noun \]-(ha | also | \] / Na \ [adjectives \]-(not | deletion | not use) \ [utilization ending \] ", the mnemonic analysis result symbol and backslash \ symbol are excluded from this description. (Has | is not (not | not)) ”.

The regular expression expansion processing unit 55 of the user output generation unit 15 expands the regular expression OR of the corresponding expression and the excluded expression, which is the processing result of step S56 (step S57).
As shown in FIG. 10, the regular expression expansion processing unit 55 has a description of the corresponding expression as a processing result of step S56 as “problem (ha | also | In this case, the corresponding output for the user is “no problem”, “no problem”, “no problem”, “no problem”, “no problem”, “no problem” , Get "no problem", "no problem" and "no problem".

  Further, as shown in FIG. 10, the regular expression development processing unit 55 indicates that the description of the excluded expression, which is the processing result of step S56, is “problem (is | is also | is not | not |)”. In this case, the output corresponding expressions for the user are “no problem”, “no problem”, “no problem”, “no problem”, “no problem” and “ Get no problem ". This is the end of the detailed description of the process in step S4.

  The user output generation unit 15 outputs the user output corresponding expression and the user output exclusion expression, which are the processing results of step S <b> 56, to the user terminal device 2 via the input / output interface 16.

  When the communication interface 25 of the user terminal device 2 receives the user output corresponding expression and the user output exclusion expression from the dictionary construction support apparatus 1, the control unit 21 stores this information in the storage device 22. The control unit 21 acquires the user output corresponding expression and the user output exclusion expression stored in the storage device 22, and outputs them to the display device 23 together with the input dictionary structure (step S5).

FIG. 11 is a diagram illustrating an example of an output screen for a user displayed on the user terminal device according to the first embodiment of the present invention.
The control unit 11 of the dictionary construction support apparatus 1 stores the dictionary registration corresponding expression and the dictionary registration exclusion expression of the processing result by the regular expression generation unit 14 together with the dictionary structure of the user-specified character string input in the process of step S1. It is stored as dictionary information in the device 12 (step S6).

FIG. 12 is a diagram showing an example of dictionary information stored in the dictionary construction support apparatus according to the first embodiment of the present invention.
The example shown in FIG. 12 is an example in which there is one concept class, one key concept, one user-specified character string, one dictionary registration corresponding expression, and one dictionary registration exclusion expression. One line of dictionary information consists of the contents shown in FIG. In the dictionary information, there may be a plurality of lines having the contents shown in FIG.
For example, a plurality of key concept rows may exist with the same concept class name. Further, a plurality of “user-specified character strings, dictionary registration corresponding expressions, dictionary registration exclusion expressions” may exist with the same concept class name and the same key concept class name.

  As described above, in the dictionary construction support apparatus of the document processing apparatus according to the first embodiment of the present invention, the regular expression generation rule database in which the user-specified character strings input by the user are gathered together with the know-how related to the dictionary registration expressions. Since it is referred to and converted into a dictionary registration expression, advanced dictionary information can be constructed even for users who have little knowledge of natural language processing and know-how about dictionary registration expressions.

  In addition, since this dictionary construction support device performs an output generation process for the user and displays the dictionary registration expression converted into the output for the user, it can perform an output that is easy to understand even for a user with little knowledge of natural language processing. . Furthermore, this dictionary construction support apparatus is able to hide the technical know-how because the dictionary registration expression is not directly shown to the user.

(Second Embodiment)
Next, a second embodiment of the present invention will be described. Note that, in the configuration of the document processing apparatus according to each embodiment described below, the description of the same parts as those shown in FIGS. 1 and 2 is omitted.
FIG. 13 is a block diagram showing a configuration example of the dictionary construction support device of the document processing device according to the second embodiment of the present invention.
The dictionary construction support apparatus 1 according to the second embodiment of the present invention includes a dictionary registered expression generation unit 60 instead of the regular expression generation unit 14 as compared with the first embodiment. In addition, the storage device 12 includes a regular expression second rule storage unit 33 for storing a regular expression generation second rule database, as compared with the first embodiment. In this embodiment, the regular expression generation rule database stored in the regular expression rule storage unit 31 described in the first embodiment is referred to as a regular expression generation first rule database.

  The dictionary registration expression generation unit 60 includes a rule acquisition unit 61, a match determination unit 62, a dictionary registration expression conversion unit 63, a dictionary registration expression generation unit 64, an exclusion expression determination unit 65, and an exclusion expression processing unit 66. These functions will be described later.

FIG. 14 is a diagram showing, in a tabular form, a configuration example of the regular expression generation second rule database stored in the storage device of the dictionary construction support device according to the first embodiment of the present invention.
In the regular expression generation second rule database, morphological analysis results and dictionary registration expressions are managed in association with each other.

The morpheme analysis result regular expression pattern in the regular expression generation second rule database is converted by comparing the morpheme analysis result of the user-specified character string with the regular expression generation first rule database as described in the first embodiment. When a dictionary registration corresponding expression and a dictionary registration exclusion expression are obtained, a character string pattern to be collated for determining the presence or absence of synonyms or notation of these expressions is described in a regular expression.
Moreover, the dictionary registration expression in the regular expression generation second rule database is a character string pattern that is registered in the dictionary information as a corresponding expression or an exclusion expression for the user-specified character string.

  In the first line of the regular expression generation second rule database shown in FIG. 14, the morphological analysis result regular expression pattern “/ (problem | trouble) \ [noun \]” and the dictionary registered corresponding expression “/ (problem | trouble) \ [ Noun \] "is stored. In the second line, the morphological analysis result regular expression pattern “/ (na | no) \ [adjectives \]” and the dictionary registration corresponding expression “/ (na | no) \ [adjectives \]” are stored.

  Next, the processing operation of the document processing apparatus according to the second embodiment of the present invention will be described. FIG. 15 is a flowchart showing an example of the processing operation of the document processing apparatus according to the second embodiment of the present invention.

  First, steps S1 and S2 described in the first embodiment are performed. Then, the dictionary registration expression generation unit 60 generates a regular expression for dictionary registration from the morpheme analysis result of the user-specified character string obtained by the morpheme analysis unit 13 (step S11).

  Here, the details of the dictionary registration expression generation process which is the process of step S11 by the dictionary registration expression generation unit 60 will be described. FIG. 16 is a flowchart showing an example of dictionary registration expression generation processing by the dictionary construction support apparatus according to the second embodiment of the present invention. FIG. 17 is a diagram showing an example of data transition by dictionary registration expression generation processing by the dictionary construction support apparatus according to the second embodiment of the present invention.

In order to perform the dictionary registration expression generation process, the dictionary registration expression generation unit 60 determines the description of the morpheme analysis result obtained in the process of step S2 as the dictionary registration corresponding expression initial state and the dictionary registration exclusion expression initial state (step S61).
And the rule acquisition part 61 of the dictionary registration expression production | generation part 60 acquires the uppermost rule from the regular expression production | generation 1st rule database memorize | stored in the memory | storage device 12 (step S62).

Next, the match determination unit 62 of the dictionary registered expression generation unit 60 determines whether the morphological analysis result regular expression pattern of the acquired rule matches the morphological analysis result of the user-specified character string as a regular expression (step S63). ).
If the dictionary registration expression conversion unit 63 of the dictionary registration expression generation unit 60 determines that there is a match (YES in step S63), the matching part in the description of the dictionary registration corresponding expression initial state is extracted from the regular expression generation first rule database. Morphological analysis result of the rule obtained by converting to the dictionary registered corresponding expression associated with the regular expression pattern of the acquired rule, and the matching part in the description of the initial state of the dictionary registration excluded expression obtained from the regular expression generation first rule database Conversion into a dictionary registration exclusion expression associated with the regular expression pattern is performed (step S64).

If it is determined “NO” after the process of step S64 or the process of step S63, the dictionary registration expression generation unit 60 determines whether there is a next rule in the regular expression generation first rule database (step S65).
If it is determined that there is the next rule (YES in step S65), the dictionary registration expression generation unit 60 returns to the process in step S62 and acquires the next lower rule in the regular expression generation first rule database. If the dictionary registration expression generation unit 60 determines that there is no next rule (NO in step S65), the exclusion expression determination unit 65 determines that the dictionary registration exclusion expression conversion result obtained in step S64 is the dictionary registration. It is determined whether the result is the same as the corresponding expression conversion result (step S66).

If the excluded expression determination unit 65 determines “YES” in the process of step S66, the excluded expression processing unit 66 deletes the dictionary registration excluded expression conversion result obtained in the process of step S64 (step S67). The remaining dictionary registered corresponding expression conversion result is output as a dictionary registered corresponding expression.
On the other hand, if the exclusion expression determination unit 65 determines “NO” in the process of step S66, the exclusion expression processing unit 66 outputs the dictionary registration exclusion expression conversion result obtained in the process of step S64 as a dictionary registration exclusion expression. Then, the dictionary registration corresponding expression conversion result is output as the dictionary registration corresponding expression.

  And the rule acquisition part 61 of the dictionary registration expression production | generation part 60 acquires the uppermost rule from the regular expression production | generation 2nd rule database memorize | stored in the memory | storage device 12 (step S68).

  Next, the match determination unit 62 of the dictionary registered expression generation unit 60 determines whether the description of the acquired morphological analysis result regular expression pattern of the rule matches the output result from the exclusion expression processing unit 66 as a regular expression ( Step S69).

  If the dictionary registration expression generation unit 64 of the dictionary registration expression generation unit 60 determines that there is a match (YES in step S69), it matches in the description of the dictionary registration corresponding expression and dictionary registration exclusion expression output by the exclusion expression processing unit 66. The part to be converted is converted into a dictionary registered expression associated with the regular expression pattern of the morphological analysis result of the rule acquired from the regular expression generation second rule database (step S70).

If it is determined as “NO” after the process of step S70 or the process of step S69, the dictionary registration expression generation unit 60 determines whether there is a next rule in the regular expression generation second rule database (step S71).
If it is determined that there is the next rule (YES in step S71), the dictionary registration expression generation unit 60 returns to the process in step S68 and acquires the next lower rule in the regular expression generation second rule database. When the dictionary registration expression generation unit 60 determines that there is no next rule (NO in step S71), the dictionary registration expression generation unit 60 determines the dictionary registration expression generation result.

As shown in FIG. 17, the corresponding expression registered in the dictionary output by the excluded expression processing unit 66 is “/ problem \ [noun \]-[hamamo] \ [adjunct \] / na \ [adjective \]-". [A-n] ^* \ [utilization ending \] ", the" / problem \ [noun \] "in this description is the normal result of the morphological analysis in the first line of the regular expression generation second rule database shown in FIG. Since it matches the expression pattern “/ (problem | trouble) \ [noun \]”, the dictionary registration expression generation unit 64 performs the process of step S70 to add “/ problem \ [noun \” at the beginning of the description of the corresponding dictionary registration expression. ] ”Is converted into a dictionary registered expression“ / (problem | trouble) \ [noun \] ”associated with the regular expression pattern in the first line of the regular expression generation second rule database shown in FIG.

  Further, as shown in FIG. 17, “/ na \ [adjectives \]” in the description of the corresponding dictionary registered output outputted by the excluded expression processing unit 66 is the second in the regular expression generation second rule database shown in FIG. Since the morphological analysis result of the line matches the regular expression pattern “/ (NA | NONE) \ [Adjective \]”, the dictionary registration expression generation unit 64 performs “// "\ (Adjective \]" is the dictionary registered expression "/ (NA | NONE) \ [adjective \]" associated with the regular expression pattern of the second morpheme analysis result in the second rule database of the regular expression generation shown in FIG. Convert to

By performing such conversion, as shown in FIG. 17, the dictionary registration expression generation unit 64 of the dictionary registration expression generation unit 60 describes the description “/ problem \ [noun \]-[mohama] of the dictionary registration corresponding expression. ) \ [Adjunct \] / na \ [adjective \]-[an-] ^* \ [utilization ending \] ", the description of the dictionary registration expression generation result (corresponding expression)" / (problem | Trouble) \ [Noun \]-[Hamoga] \ [Adjunct \] / (Na | None) \ [Adjectives \]-[Ahn] ^* \ [Utilized ending \] ".

  Further, as shown in FIG. 17, the dictionary registration exclusion expression output by the exclusion expression processing unit 66 is “/ problem \ [noun \]-[hamamo] \ [adjunct \] / na \ [adjective \". ]-(Not | Kazuzazu) \ [Utilized ending \] ", the" / problem \ [noun \] "in this description is the morpheme in the first line of the regular expression generation second rule database shown in FIG. Since the analysis result matches the regular expression pattern “/ (problem | trouble) \ [noun \]”, the dictionary registration expression generation unit 64 performs “S / problem \” at the beginning of the description of the dictionary registration exclusion expression by the process of step S70. [Noun \] "is converted into the dictionary registered expression" / (problem | trouble) \ [noun \] "associated with the regular expression pattern of the morphological analysis result of the first line of the regular expression generation second rule database shown in FIG. .

  Further, as shown in FIG. 17, “/ na \ [adjectives \]” in the description of the dictionary registration exclusion expression output by the exclusion expression processing unit 66 is the second in the regular expression generation second rule database shown in FIG. Since the morpheme analysis result of the line matches the regular expression pattern “/ (NA | NONE) \ [adjective \]”, the dictionary registration expression generation unit 64 performs the process of step S70 to describe “// "\ (Adjective \]" is the dictionary registered expression "/ (NA | NONE) \ [adjective \]" associated with the regular expression pattern of the second morpheme analysis result in the second rule database of the regular expression generation shown in FIG. Convert to

  That is, as illustrated in FIG. 17, the dictionary registration expression generation unit 64 of the dictionary registration expression generation unit 60 performs the description of the dictionary registration exclusion expression “/ problem \ [noun \]-[hamamo] \ [attached word \]”. Based on / na \ [adjective \]-(not | deletion | kazuzazu) \ [utilization ending \] ", the description of the dictionary registration expression generation result (exclusion expression)" / (problem | trouble) \ [noun \] -[Hamoga] \ [Adjunct \] / (Na | None) \ [Adjectives \]-(Not | Kazurashi) \ [Utilized ending \] ". This is the end of the detailed description of the processing in step S11.

The control unit 11 outputs the dictionary registration expression generation result output from the dictionary registration expression generation unit 60 to the user output generation unit 15.
Thereafter, the process proceeds to step S5 and subsequent steps described in the first embodiment. FIG. 18 is a diagram showing an example of data transition by the output generation process for the user by the dictionary construction support apparatus according to the second embodiment of the present invention.

  As described above, the dictionary construction support device of the document processing device according to the second embodiment obtains a dictionary registration expression corresponding to synonyms and notation fluctuations in addition to the processing described in the first embodiment. Therefore, the accuracy of the dictionary information is further improved.

(Third embodiment)
Next, a third embodiment of the present invention will be described. FIG. 19 is a block diagram showing a configuration example of the dictionary construction support device of the document processing device according to the third embodiment of the present invention.
The storage device 12 of the dictionary construction support device 1 according to the third embodiment of the present invention is a set of already created document data, instead of the output rule storage unit 32, as compared with the first embodiment. A document data storage unit 34 for storing a document database is provided.
Further, unlike the first embodiment, the dictionary construction support apparatus 1 includes a user output extraction unit 70 instead of the user output generation unit 15. The user output extraction unit 70 includes a document acquisition unit 71, a match determination unit 72, and a list generation unit 73. These functions will be described later.

  Next, the processing operation of the document processing apparatus according to the third embodiment of the present invention will be described. In this embodiment, the user output extraction process is performed instead of the user output generation process which is the process of step S4 after the execution of the processes of steps S1 to S3 described in the first embodiment.

FIG. 20 is a flowchart showing an example of an output generation process for a user by the dictionary construction support apparatus according to the third embodiment of the present invention.
The user output extraction unit 70 outputs the dictionary registration corresponding expression and the dictionary registration exclusion expression, which are output results from the regular expression generation unit 14, to the user output corresponding expression initial state and the user output, respectively, in order to perform the user output extraction process. The excluded expression initial state is set (step S81).
The document acquisition unit 71 of the user output extraction unit 70 acquires the first document data included in the document database in the document data storage unit 34 of the storage device 12 (step S82).

  Next, the match determination unit 72 of the user output extraction unit 70 matches the description of the acquired document data with the description of the user output corresponding expression initial state or the user output exclusion expression initial state as the processing result of step S51. It is determined whether or not to perform (step S83).

If the list generation unit 73 of the user output extraction unit 70 determines “YES” in the process of step S83, the user output corresponding expression initial state and the user output exclusion expression in the acquired description of the document data. A description that matches the description in the initial state is output as an output extraction result for the user (step S84).
If the user-oriented output extraction unit 70 determines “NO” after the process in step S84 or in the process in step S83, and determines that there is a next document (YES in step S85), the user output extraction unit 70 proceeds to the process in step S82. Returning, the next document in the document database is acquired, and the processing from step S83 is performed on the acquired document.

For example, a description of “no problem”, “no problem”, “no problem”, “no problem”, “no problem” in the document database stored in the document data storage unit 34 Is included, and the description of the corresponding output initial state for the user is "/ problem \ [noun \]-[hamamo] \ [adjunct \] / na \ [adjective \]-[an] ^* The description of the initial state of output exclusion expression for users is \ / problem \ [noun \]-[hamamo] \ [adjunct \] / na \ [adjective \]-(not | Kazuzazu) \ [Usage Suffix \] "," No problem "," No problem ", and" No problem "in the document data match the description of the output corresponding expression initial state for the user Therefore, the list generation unit 73 performs “no problem”, “no problem”, and “no problem” as corresponding expressions of the output extraction result for the user by the process of step S84. Forces.

  Further, since the result of the morphological analysis processing of “no problem” and “no problem” in the document data matches the description of the output exclusion expression initial state for the user, the list generation unit 73 performs the process of step S84. Thus, “no problem” and “no problem” are output as exclusion expressions for the output extraction result for the user.

  Further, the user output extraction unit 70 describes an expression example, which is a sentence including a description of the output extraction result for the user to be output, among the descriptions of the document data included in the document data storage unit 34. It is extracted as information combined with the document data ID. The user output extraction unit 70 outputs information on the corresponding expression, the excluded expression, and the expression example of the user output extraction result, which is the processing result of step S84, to the user terminal device 2 via the input / output interface 16.

When the communication interface 25 of the user terminal device 2 inputs the user output extraction result and expression example from the dictionary construction support device 1, the control unit 21 stores this information in the storage device 22. The control unit 21 acquires the corresponding expression, the excluded expression, and the expression example of the output extraction result for the user stored in the storage device 22, and outputs them to the display device 23 together with the input dictionary structure.
FIG. 21 is a diagram showing an example of an output screen for the user displayed on the user terminal device according to the third embodiment of the present invention.

  As described above, in the dictionary construction support device 1 of the document processing device according to the third embodiment of the present invention, the user output extraction unit 70 includes the output result of the regular expression generation unit 14, the created document data, The pattern matching process is executed, and the matched expression is output as an output for the user. Therefore, it is possible to extract a user output expression based on the processing result by the regular expression generation unit 14 without constructing a user output generation rule database as in the first embodiment. This representation of the output for the user is not generated based on the regular expression, but is a description of the prepared document data stored in the document data storage unit 34, so that it is compared with the first embodiment. It becomes possible to obtain an output that can be easily understood by the user.

  By the way, the expressions output as the corresponding expressions or the excluded expressions on the screen as shown in FIG. 21 may be arranged in the character code order, and the number of matches in the document data stored in the document data storage unit 34 is large. You may arrange in order. Further, only the case where the number of matches in the document data stored in the document data storage unit 34 is equal to or greater than a preset numerical value may be output.

(Fourth embodiment)
Next, a fourth embodiment of the present invention will be described. FIG. 22 is a block diagram showing a configuration example of the dictionary construction support device of the document processing device according to the fourth embodiment of the present invention.
Compared to the first embodiment, the dictionary construction support apparatus 1 of the document processing apparatus according to the fourth embodiment of the present invention performs a search processing unit 18 for performing a search process for confirming a dictionary registration expression. Is further provided. The search processing unit 18 includes a dictionary registration expression acquisition unit 81 and a dictionary registration expression match determination unit 82.

FIG. 23 is a flowchart illustrating an example of a dictionary registration determination process by the dictionary construction support apparatus according to the fourth embodiment of the present invention. This dictionary registration determination process is a process performed after the dictionary information is constructed and output for the user as described in the first embodiment. FIG. 24 is a diagram showing an example of data transition by dictionary registration determination processing by the dictionary construction support apparatus according to the fourth embodiment of the present invention.
First, when a dictionary structure including a user-specified character string for checking whether or not dictionary information is registered is input by an operation on the input device 24 of the user terminal device 2, the control unit 21 stores this document data in the storage device 22.
When an operation relating to a registration information confirmation request for dictionary information is performed on the input device 24, the control unit 21 obtains a user-specified character string from the dictionary structure including the user-specified character string for registration presence / absence confirmation stored in the storage device 22. It is acquired and output to the dictionary construction support apparatus 1 via the communication interface 25.
When the input / output interface 16 of the dictionary construction support apparatus 1 inputs a user-specified character string from the user terminal device 2, the morpheme analysis unit 13 performs morphological analysis on the user-specified character string, divides the character string into words, and gives parts of speech. (Step S91).

Next, the dictionary registration expression acquisition unit 81 of the search processing unit 18 acquires information for one line from the dictionary information stored in the storage device 12 (step S92). Then, the dictionary registration expression match determination unit 82 determines whether the acquired dictionary registration corresponding expression and dictionary registration exclusion expression match each of the morphological analysis results of the user input character string (step S93).
If the dictionary registration expression match determination unit 82 determines that there is a match in the process of step S93 (YES in step S93), the dictionary registration expression match determination unit 82 distinguishes and stores the expression that does not match the matching expression among the dictionary registration corresponding expression and the dictionary registration exclusion expression. The message information indicating the match result is generated in the buffer area of the device 12 (step S94).

When it is determined “NO” after the process of step S94 or the process of step S93, the search processing unit 18 determines whether there is a next dictionary line in the dictionary information (step S95).
If the search processing unit 18 determines that there is a next dictionary line (YES in step S95), the search processing unit 18 returns to the process in step S92 and acquires the expression one step lower in the dictionary information. If the search processing unit 18 determines that there is no next dictionary line (NO in step S95), the search processing unit 18 determines that the processing related to all the lines of the dictionary information has been completed, and uses the information stored in the buffer area as input characters. A search processing result associated with the dictionary information of the column and message information indicating the match result is generated. The search processing unit 18 generates a dictionary registration search process result for the user based on the search process result, and outputs it to the user terminal device 2 via the input / output interface 16.

  When the communication interface 25 of the user terminal device 2 receives the user output corresponding expression and the user output exclusion expression from the dictionary construction support apparatus 1, the control unit 21 stores this information in the storage device 22. The control unit 21 acquires the user output corresponding expression and the user output exclusion expression stored in the storage device 22, and outputs them to the display device 23 together with the input dictionary structure (step S5).

When the user-specified character string is “no machine trouble”, the concept class is “good”, and the key concept is “no problem”, the corresponding expression on the first line of the dictionary information is “/ (problem). | Trouble) \ [noun \]-(ha | mo | ga) \ [adjunct \] / na \ [adjectives \]-[a-n] ^* \ [utilization ending \] " (Problem | Trouble) \ [Noun \]-(Ha | Mor |) \ [Adjunct \] / Na \ [Adjective \]-(Not | Karazazu) \ [Utilization End \] " The input character string matches the exclusion expression on the first line of the dictionary information. As shown in FIG. 24, the search processing result in this case includes the dictionary corresponding line “1”, the concept class, the key concept, the corresponding expression of the corresponding dictionary line, the excluded expression of the corresponding dictionary line, and the match result “matched excluded expression”. "

  As a result, the display target on the user terminal device 2, that is, the dictionary registration search processing result for the user, the user-specified character string “no machine trouble” and the output message “concept class“ good ”, key concept“ no problem ” "There is no trouble" is registered as an exclusion expression. "

Here, a modified example of the dictionary registration search process will be described. FIG. 25 is a diagram showing an example of a dictionary registration search process result by the dictionary construction support apparatus according to the fourth embodiment of the present invention.
The dictionary registration search processing result by the dictionary construction support apparatus according to the fourth embodiment of the present invention is not limited to the configuration shown in FIG. 24, but as shown in FIG. For the description of the corresponding expression and the excluded expression of the line corresponding to the input character string, the generation of the corresponding expression and the excluded expression of the user output by the user output generation unit 15, and the first embodiment for the generation of these expressions The user-applicable output expressions and user-excluded expressions obtained by performing the symbol deletion process of step S5 and the regular expression OR expansion process of step S6 described in step S5 are user-specified character strings, concept classes, and key concepts. You may output together.

  The example shown in FIG. 20 shows a case where the number of dictionary registration lines to be output is one, but there may be a plurality of dictionary registration lines to be output. Further, when a plurality of lines are output, not only the order of registration as dictionary information is output, but also the created document data as described in the third embodiment of the present invention is searched and matched. You may sort and output in order with the largest number of documents.

  As described above, the dictionary construction support apparatus 1 of the document processing apparatus according to the fourth embodiment of the present invention allows the user to execute the search processing unit 18 in addition to the process described in the first embodiment. Since it is searched whether or not the expression to be registered as dictionary information has already been registered, the user can easily confirm whether or not the expression to be registered in the dictionary information has already been registered. .

  In each embodiment, it has been described that the dictionary construction is performed using the dictionary construction support device and the user terminal device. However, the dictionary construction is performed using a single device having all the functions of the dictionary construction support device and the user terminal device. You may go.

  The present invention is not limited to the above-described embodiment as it is, and can be embodied by modifying the constituent elements without departing from the scope of the invention in the implementation stage. Various inventions can be formed by appropriately combining a plurality of constituent elements disclosed in the embodiment. For example, some components may be omitted from all the components shown in the embodiment. Furthermore, you may combine suitably the component covering different embodiment.

  In addition, the method described in the embodiment is a program (software means) that can be executed by a computer (computer), such as a magnetic disk (flexible disk, hard disk, etc.), an optical disk (CD-ROM, DVD, MO, etc.), It can be stored in a recording medium such as a semiconductor memory (ROM, RAM, flash memory, etc.), or transmitted and distributed by a communication medium. Note that the program stored on the medium side includes a setting program that configures in the computer software means (including not only the execution program but also a table and data structure) to be executed by the computer. A computer that implements this apparatus reads a program recorded on a recording medium, constructs software means by a setting program as the case may be, and executes the processing described above by controlling the operation by this software means. The recording medium referred to in this specification is not limited to distribution, but includes a storage medium such as a magnetic disk or a semiconductor memory provided in a computer or a device connected via a network.

1 is a block diagram showing a configuration example of a dictionary construction support device of a document processing device according to a first embodiment of the present invention. 1 is a block diagram showing a configuration example of a user terminal device of a document processing device according to a first embodiment of the present invention. The figure which shows the structural example of the regular expression production | generation rule database memorize | stored in the memory | storage device of the dictionary construction assistance apparatus according to the 1st Embodiment of this invention in a table format. The figure which shows the structural example of the output generation rule database for users memorize | stored in the memory | storage device of the dictionary construction assistance apparatus according to the 1st Embodiment of this invention in a table format. 5 is a flowchart showing an example of processing operation of the document processing apparatus according to the first embodiment of the present invention. The figure which shows an example of the dictionary structure containing the designated character string which the dictionary construction assistance apparatus according to the 1st Embodiment of this invention inputs. The flowchart which shows an example of the regular expression production | generation process by the dictionary construction assistance apparatus according to the 1st Embodiment of this invention. The figure which shows an example of the data transition by the regular expression production | generation process by the dictionary construction assistance apparatus according to the 1st Embodiment of this invention. The flowchart which shows an example of the output production | generation process for users by the dictionary construction assistance apparatus according to the 1st Embodiment of this invention. The figure which shows an example of the data transition by the output production | generation process for users by the dictionary construction assistance apparatus according to the 1st Embodiment of this invention. The figure which shows an example of the output screen for users displayed on the user terminal device according to the first embodiment of the present invention. The figure which shows an example of the dictionary information preserve | saved at the dictionary construction assistance apparatus according to the 1st Embodiment of this invention. The block diagram which shows the structural example of the dictionary construction assistance apparatus of the document processing apparatus according to the 2nd Embodiment of this invention. The figure which shows the structural example of the regular expression production | generation 2nd rule database memorize | stored in the memory | storage device of the dictionary construction assistance apparatus according to the 1st Embodiment of this invention in a table format. 10 is a flowchart showing an example of processing operation of the document processing apparatus according to the second embodiment of the present invention. The flowchart which shows an example of the dictionary registration expression production | generation process by the dictionary construction assistance apparatus according to the 2nd Embodiment of this invention. The figure which shows an example of the data transition by the dictionary registration expression production | generation process by the dictionary construction assistance apparatus according to the 2nd Embodiment of this invention. The figure which shows an example of the data transition by the output production | generation process for users by the dictionary construction assistance apparatus according to the 2nd Embodiment of this invention. The block diagram which shows the structural example of the dictionary construction assistance apparatus of the document processing apparatus according to the 3rd Embodiment of this invention. The flowchart which shows an example of the output production | generation process for users by the dictionary construction assistance apparatus according to the 3rd Embodiment of this invention. The figure which shows an example of the output screen for users displayed on the user terminal device according to the 3rd Embodiment of this invention. The block diagram which shows the structural example of the dictionary construction assistance apparatus of the document processing apparatus according to the 4th Embodiment of this invention. The flowchart which shows an example of the dictionary registration discrimination | determination process by the dictionary construction assistance apparatus according to the 4th Embodiment of this invention. The figure which shows an example of the data transition by the dictionary registration discrimination | determination process by the dictionary construction assistance apparatus according to the 4th Embodiment of this invention. The figure which shows an example of the dictionary registration search process result by the dictionary construction assistance apparatus according to the 4th Embodiment of this invention.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 1 ... Dictionary construction assistance apparatus, 2 ... User terminal device, 11, 21 ... Control part, 12, 22 ... Memory | storage device, 13 ... Morphological analysis part, 14 ... Regular expression production | generation part, 15 ... Output generation part for users, 16 ... Input / output interface, 17, 26 ... bus, 23 ... display device, 24 ... input device, 25 ... communication interface, 31 ... regular expression rule storage unit, 32 ... output rule storage unit, 33 ... regular expression second rule storage unit, 34 ... Document data storage unit, 41, 51, 61 ... Rule acquisition unit, 42, 52, 62 ... Match determination unit, 43, 63 ... Dictionary registration expression conversion unit, 44, 64 ... Exclusion expression determination unit, 45, 65 ... Exclusion expression processing unit, 53... Output conversion unit, 54... Morpheme analysis symbol processing unit, 55... Regular expression expansion processing unit, 60 ... dictionary registration expression generation unit, 70. , 82 ... dictionary registration expression match determination unit.

Claims (4)

First pattern storage means for storing a morphological analysis regular expression pattern and a dictionary registered regular expression pattern in association with each other;
Second pattern storage means for storing the dictionary registered regular expression pattern and the output regular expression pattern in association with each other;
An input means for inputting a character string for registration in dictionary information;
Morpheme analysis means for performing morpheme analysis processing of the input character string;
Of the morpheme analysis result, a first conversion unit that converts a portion that matches a morpheme analysis regular expression pattern stored in the first pattern storage unit into a dictionary registered regular expression pattern that is associated with the matching pattern; ,
Of the conversion result by the first conversion means, a part that matches the dictionary registered regular expression pattern stored in the second pattern storage means is converted into an output regular expression pattern that is associated with the matching pattern. Two conversion means;
Third conversion means for converting the description of the conversion result by the second conversion means into a description not including a regular expression;
A dictionary construction support apparatus comprising: output means for outputting a conversion result obtained by the third conversion means. Pattern storage means for storing a morphological analysis regular expression pattern and a dictionary registered regular expression pattern in association with each other;
Document information storage means for storing the created document information;
An input means for inputting a character string for registration in dictionary information;
Morpheme analysis means for performing morpheme analysis processing of the input character string;
Of the morpheme analysis results, a conversion unit that converts a portion that matches the morphological analysis regular expression pattern stored in the pattern storage unit into a dictionary registered regular expression pattern that is associated with the matching pattern;
Extraction means for extracting a description that matches the conversion result by the conversion means from the document information stored in the document information storage means;
A dictionary construction support apparatus comprising: output means for outputting an extraction result by the extraction means. Dictionary information storage means for storing a dictionary registration regular expression pattern as a conversion result by the second conversion means as dictionary information related to the input character string;
Second input means for inputting a character string for confirming whether or not to register in the dictionary information;
Discriminating means for discriminating whether or not the character string input by the second input means matches the dictionary registration regular expression pattern of the dictionary information stored in the dictionary information storage means;
The dictionary construction support apparatus according to claim 1, further comprising: a discrimination result output unit that outputs a discrimination result by the discrimination unit. First pattern storage means for storing a morphological analysis regular expression pattern and a dictionary registered regular expression pattern in association with each other; and a second pattern storage means for storing the dictionary registration regular expression pattern and an output regular expression pattern in association with each other. A program for controlling a computer comprising:
The computer,
An input means for inputting a character string for registration in dictionary information,
Morphological analysis means for performing morphological analysis processing of the input character string,
Of the morpheme analysis result, a first conversion unit that converts a portion that matches the morpheme analysis regular expression pattern stored in the first pattern storage unit into a dictionary registered regular expression pattern that is associated with the matching pattern;
Of the conversion result by the first conversion means, a part that matches the dictionary registered regular expression pattern stored in the second pattern storage means is converted into an output regular expression pattern that is associated with the matching pattern. 2 conversion means,
Third conversion means for converting the description of the conversion result by the second conversion means into a description not including a regular expression;
A dictionary construction support program that functions as output means for outputting a conversion result by the third conversion means.

Images