JP4111941B2 - Apparatus, method and program for converting lexical data to data - Google Patents

Description

  The present invention relates to an apparatus, a method, and a program for converting a lexical phrase including a plurality of words into another data including one piece of information specified by the plurality of words.

  For example, a bank or the like may require a customer information (CIF) analysis process using a computer for a settlement instruction message received (CIF means a customer information file). .) Specifically, for example, a combination of a plurality of words “GETRONICS”, “FOODS”, “CO., LTD”, and “AKASAKA” in the word “GETRONICS FOODS CO., LTD 1-2-34 AKASAKA” It is necessary to convert the customer code (that is, the CIF code) to “1234567”.

  Conventionally, this conversion processing is performed as follows. That is, a customer code table of a combination of a plurality of words specifying a customer code and a corresponding customer code is stored in the storage device in advance. Next, a plurality of words to be converted are extracted from the input data, and the extracted plurality of words and a plurality of words in the customer code table are subjected to character string comparison. (See Patent Document 1 for such an example.)

  However, since such character string comparison is performed for each character (in 1-byte units), especially when a large amount of data is targeted, the processing is performed at high speed due to the search time required for the processing. There was a problem that could not be done.

  As a method for overcoming such a problem, prior to this patent application, a dictionary used for converting a lexical in a message to a CIF code is symbolized as a main memory on a memory address as a symbol. (See Patent Document 2). Specifically, a basic word dictionary associated with each of a plurality of words and their attribute information and registered in the secondary storage device in advance, a combination of two words registered in the basic word dictionary, and a key The nuclear name dictionary that is pre-registered in the secondary storage device in association with the selected word in the set and the symbol specified by the set, the symbol and another word not included in the set, and the The full name dictionary registered in advance in the secondary storage device in association with the symbol and the CIF code specified by another word is symbolized on the main memory using the memory address as a symbol. By referring to the symbolized basic word dictionary, an address corresponding to the word included in the converted lexical phrase is acquired. A pair that matches two addresses (one of which is a key) is found from the symbolized nuclear name dictionary, and then a pair that matches the other address is found from the symbolized full name dictionary, The conversion token is converted into a target CIF code.

  As described above, this method is a specification in which a key (symbol) that associates each dictionary is directly assigned to a physical memory address. When such a specification is used, the memory address is dynamically allocated as a characteristic of the computer. Therefore, each time the program is loaded into the memory, the key relationship between the dictionaries is changed to the acquired memory address. It is necessary to replace and generate, and in this respect, high load and required time are required in the program initial processing.

  As a method for overcoming such a problem, a logical index representing each word is allocated in advance, and the word and the corresponding logical index are stored in a dictionary in association with each other, and this is expanded in a memory. It was proposed in patent applications prior to this patent application (see Patent Documents 3 and 4).

In addition, a method is known in which an index is attached to a word on a dictionary and the access time is shortened by associating the index with a storage position of a disk (see, for example, Patent Document 5).
JP 2002-56005 A Patent application for Japanese Patent Application No. 2003-115287 Patent application for Japanese Patent Application No. 2004-89101 Patent application No. 2004-89121 JP-A-7-36900

  In Patent Documents 3 and 4, since it is necessary to uniquely define a CIF code by a combination of one word, there is no duplication in registered word combinations, and a certain word combination is combined with another word Is registered so that it does not have the relationship that includes. That is, Patent Documents 3 and 4 are based on the premise that the inclusion relationship described later does not occur in the combination of words corresponding to the CIF code. However, in practice, as indicated by reference numeral 1000 in FIG. 9, there may be an inclusion relationship between logical index sets registered in association with CIF codes or the like. In the example indicated by the reference number 1000, the name corresponding to the CIF code “6950000” is “NAKAMORI ELECTRIC CO., LTD. MARUNOUCHI” and the logical index set is (105, 106, 107, 300), while the CIF code “ The name corresponding to “6760000” is “NAKAMORI CO., LTD. MARUNOUCHI”, and the logical index set is (105, 107, 300). Therefore, both are inclusive because "NAKAMORI", "CO., LTD", "MARUNOUCHI" are duplicated in the combination of words in the name, and 105, 107, 300 are duplicated in the logical index set. It has occurred. The inclusion relationship is a state in which registration occurs in such a manner as to occur between a plurality of logical index sets registered in a dictionary such as a customer name, and one includes the other logical index set.

  As described above, when an important part such as a customer name is represented by a logical index set, an inclusion relationship in which one includes the other may occur between different CIF codes. In the example indicated by reference numeral 1000 in FIG. 9, the CIF code “6950000” is expressed as (105, 106, 107, 300) as the logical index set, and the CIF code “6760000” of the logical index set (105, 107, 300). Is included. In this case, even if a smaller logical index set (in the above example, “676000” as the CIF code) can be completely analyzed from the input character string, whether it is a normal analysis result or a larger logical index set. It cannot be determined because the inclusion relationship is established in the dictionary registration. Describing in more detail with reference to FIG. 9, it is assumed that “NAKAMORI AND CO., LTD. MARUNOUCHI” including “AND” in which a logical index is not fixed is input more generally. The input is divided into words and converted into a logical index using the dictionary 1002 (see “Dictionary application” column with reference number 1004). At this time, “AND” is not registered in the dictionary, and thus is not converted. Accordingly, the logical index set used for CIF analysis is (105, 107, 300) (see the column “CIF analysis” of reference number 1004). When this logical index set is analyzed by referring to the correspondence table between the CIF code indicated by reference number 1000 and the logical index set, as shown in the “Analysis result” column of reference number 1004, “6950000” or It cannot be determined as “6760000”. Therefore, in the techniques of Patent Documents 3 and 4, when such a state is reached, the target CIF code is unspecified and thus must be handled as an error. If an error / return is not performed, an inaccurate process may be allowed.

  An object of the present invention is to improve the accuracy of analysis processing by converting a lexical phrase into data so that it can be correctly converted even when an inclusion relationship has occurred.

According to one aspect of the present invention, there is provided an apparatus for converting a lexical phrase including a plurality of words into another data including one piece of information specified by the plurality of words, wherein each of the plurality of words is converted. A basic word dictionary previously registered in the storage means in association with a logical index representing each word, and a set of logical indexes corresponding to a set of words obtained by combining words registered in the basic word dictionary associating one of information specified by a set of said word, and when said set between the logical index is subsumption relation, set for the logical index subsumed, the word corresponding to the set of logical root indexes are the subsumption A word that is unnecessary in that it is not used when directly specifying the one piece of information because it is not included in the set, but assists in finally specifying the one piece of information A logical index corresponding to a certain unnecessary word is associated with the one information in advance and registered in a storage means in advance, and a lexical word including the plurality of words is converted into another data including the specified information. A processing engine, and the processing engine associates a word registered in the basic word dictionary with a logical index representing each word, expands the memory in a memory, and registers the word in the name dictionary A logical index set and a logical index of an unnecessary word are associated with the specified one information corresponding to each logical index set and expanded in the memory, and a lexical word to be converted is decomposed into words, Referring to the basic word dictionary expanded in memory on the memory, the logical index corresponding to the decomposed word is obtained, converted, and the unnecessary word A logical index set that matches the logical index set corresponding to the decomposed word is selected from the memory expanded logical index sets including the logical index, and the selected logical index set is selected. By using one piece of information specified by a set, the problem is solved by a device that converts a lexical phrase including the plurality of words into another data including the specified one piece of information.

  According to one aspect of the apparatus of the present invention, the apparatus further comprises input means for inputting information including data, and display means for displaying information including data, and the processing engine is further expanded in the memory. When referring to the basic word dictionary and obtaining and converting the logical index corresponding to the decomposed word, if there is a word for which the logical index cannot be obtained, the word is identified and displayed on the display means, In response to the information input by the input means indicating that the word displayed on the display means is an unnecessary word, the word is written in the basic word dictionary in association with the corresponding logical index; and The name dictionary is associated with one piece of information specified from a set of words excluding a word that is regarded as an unnecessary word among words included in a lexical word to be converted. It is preferable to write the logical index of the word, which is the word.

  According to another aspect of the apparatus of the present invention, the processing engine further includes a logic corresponding to the decomposed word from the memory expanded logical index set including a logical index of unnecessary words. Before selecting the logical index set that matches the index set, the logical index corresponding to the decomposed word is selected from the memory expanded logical index set that does not include the logical index of unnecessary words. Selecting a logical index set that is a set of logical indexes that matches a set of logical indexes composed of a plurality of logical indexes, and that is composed only of the logical indexes of the set of logical indexes, By using one piece of information specified by the set of the selected logical indexes, It is preferable to convert the token containing the word to another data including one of information the identified.

According to another aspect of the present invention, there is provided an apparatus for converting a lexical phrase including a plurality of words into another data including one piece of information specified by the plurality of words. A basic word dictionary registered in advance in the storage means in association with a logical index representing each word, and a logical index corresponding to a set of words obtained by combining words registered in the basic word dictionary If a name dictionary registered in advance in the storage means a set in association with one information specified by a set of said word, set between the logical index is subsumption relation, set for the logical index subsumed, one is a required wherein in that is not used in identifying said one information directly because it is not contained in the set of words that correspond to the set of logical root indexes are the subsumption An unnecessary word dictionary in which a logical index of an unnecessary word, which is a word that assists in finally specifying information, is associated with the one information in advance and registered in a storage unit, and a phrase including the plurality of words is specified. A processing engine that converts the data registered in the basic word dictionary to a logical index representing each word in a memory. The memory is expanded, the set of logical indexes registered in the name dictionary is associated with the specified one information corresponding to each set of logical indexes, the memory is expanded on the memory, and is registered in the unnecessary word dictionary A logical index of an unnecessary word that is generated is associated with the one information and expanded in the memory, and a lexical word to be converted is decomposed into words, The logical index corresponding to the decomposed word is obtained by referring to the basic word dictionary expanded in memory on the memory and converted from the set of logical indexes expanded in memory. One of the logical indexes corresponding to the selected word is selected from a plurality of logical indexes among the logical indexes corresponding to the word, and one specified by the selected logical index set is selected. When the information is temporarily acquired and there is an inclusion relationship, the logical index of the unnecessary word corresponding to the one temporarily acquired information in the memory expanded unnecessary word dictionary is If the logical index corresponding to the decomposed word matches the logical index that was not used when temporarily acquiring the one information, The one piece of information acquired temporarily is determined as one piece of information to be specified, and the lexical word including the plurality of words is determined by using the one piece of information. Solved by a device that converts data.

  According to one aspect of the apparatus of the present invention, the apparatus further comprises input means for inputting information including data, and display means for displaying information including data, and the processing engine is further expanded in the memory. When referring to the basic word dictionary and obtaining and converting the logical index corresponding to the decomposed word, if there is a word for which the logical index cannot be obtained, the word is identified and displayed on the display means, In response to the information input by the input means indicating that the word displayed on the display means is an unnecessary word, the word is written in the basic word dictionary in association with the corresponding logical index; and The unnecessary word dictionary is associated with one piece of information specified from a set of words excluding a word that is an unnecessary word among words included in a lexical word to be converted. It is preferable to write the logical index of words that are the Yogo.

  According to another aspect of the apparatus of the present invention, the processing engine further includes a plurality of logical indexes of the logical indexes corresponding to the decomposed words from the memory expanded logical index set. Before the temporary acquisition of one piece of information specified by the selected logical index set, the memory expansion is performed. A set of logical indexes that match a set of logical indexes composed of a plurality of logical indexes among the logical indexes corresponding to the decomposed words, and any of the set of logical indexes Select a logical index set consisting only of the logical indexes of the set of logical indexes, and By using one of the information specified by logical index set that is, it is preferable to convert the token comprising a plurality of words to another data including one of information the identified.

Further, according to one aspect of the present invention, there is provided a basic word dictionary in which each of a plurality of words is associated with a logical index representing each word and registered in storage means in advance, and the basic word dictionary If a set of logical indexes corresponding to a set of words that is a combination of words registered in is associated with one piece of information specified by the set of words, and the sets of logical indexes are in an inclusion relationship, The set of logical indexes that are not included in the set of words corresponding to the included set of logical indexes and are not used when directly specifying the one piece of information, but the one piece of information A name that is pre-registered in the storage means in association with the one information, a logical index corresponding to an unnecessary word that is a word that assists in finally identifying And a writing, a lexical including a plurality of words in a computer to be converted to another data including one of the information specified by the plurality of words, a word registered in the basic word dictionary, each word A step of generating memory on a memory in association with a logical index to be represented to generate a basic word dictionary expanded in the memory , a set of logical indexes registered in the name dictionary, and a logical index of unnecessary words for each logical index Expanding the memory on the memory in association with the specified one information corresponding to the set of information, generating a memory expanded name dictionary, decomposing the lexical word to be converted into words, and the memory A step of acquiring and converting a logical index corresponding to the decomposed word by referring to the basic word dictionary expanded in the memory above. And a logical index that matches the logical index set corresponding to the decomposed word from the set of memory expanded logical indexes including the logical index of unnecessary words when there is an inclusion relationship Converting a lexical phrase including the plurality of words into another data including the specified information by using a piece of information specified by the selected set of logical indexes. It is solved by the method of executing .

According to one aspect of the method of the present invention, the computer refers to the basic word dictionary expanded in the memory and acquires and converts the logical index corresponding to the decomposed word. and Luz step displays on the display means to identify the word if there is a word that can not be acquired logical index has been input by the input means, the information indicating that the displayed words is unnecessary word on the display means In response, the word is written in the basic word dictionary in association with the corresponding logical index, and the word included in the lexical word to be converted is excluded from the unnecessary words in the name dictionary. It is preferable to further execute a step of writing a logical index of the word determined as the unnecessary word in association with one piece of information specified from the set of words.

According to another aspect of the present invention, the computer includes a set of logical indexes corresponding to the decomposed words out of the memory expanded logical index sets including the logical indexes of unnecessary words. Before performing the step of selecting a set of matching logical indexes, the logic corresponding to the decomposed word from the memory expanded logical index set that does not include the logical index of unwanted words. A logical index set that matches a logical index set that is composed of a plurality of logical indexes of the indexes and that is composed only of the logical indexes of the logical index set is selected. And using one piece of information specified by the set of selected logical indexes More further it is preferable to perform the step of converting the other data including one of information the identified lexical including the plurality of words.

According to another aspect of the present invention, there is provided a basic word dictionary in which each of a plurality of words is associated with a logical index representing each word and registered in advance in storage means, and the basic word dictionary A name dictionary pre-registered in storage means in association with one piece of information specified by the set of words, a set of logical indexes corresponding to a set of words obtained by combining registered words, When a set is inclusive, a set of included logical indexes is not included in the included set of words and is unnecessary in that it is not used when directly specifying the one information. Unnecessary words in which a logical index corresponding to an unnecessary word, which is a word that assists in finally identifying one piece of information, is registered in advance in the storage means in association with the one information. And a writing, a lexical including a plurality of words in a computer to be converted to another data including one of the information specified by the plurality of words, a word registered in the basic word dictionary, each word A step of generating memory on a memory in association with a logical index to be represented and generating a memory-expanded basic word dictionary, and a set of logical indexes registered in the name dictionary corresponding to each logical index set and memory development on the memory in association with one information specified, and generating a memory expanded name dictionary, the logical indexes of unnecessary words said registered in the unnecessary word dictionary and the one information association and memory development on the memory Te, decomposing and generating a memory expanded unnecessary word dictionary, lexical be converted into words A step of acquiring and converting a logical index corresponding to the decomposed word by referring to the basic word dictionary expanded in the memory on the memory, and in the set of logical indexes expanded in the memory From the logical index corresponding to the decomposed word, a logical index set that matches any logical index set composed of a plurality of logical indexes is selected, and the selected logical index set is selected. A step of temporarily acquiring one piece of information specified by, and corresponding to the one piece of temporarily acquired information in the memory expanded unnecessary word dictionary when there is an inclusion relationship A logical index of unnecessary words is used to temporarily acquire the one information among the logical indexes corresponding to the decomposed words. If there is a match with the logical index that did not exist, the one piece of temporarily acquired information is determined as one piece of information to be specified, and by using the one piece of information, the phrase including the plurality of words is specified. It is solved by a method and a step of converting the other data including one of the information.

According to one aspect of the present invention, when the computer acquires a logical index corresponding to the decomposed word by referring to the basic word dictionary expanded in the memory, the logical index is converted into the computer. If a word can not be obtained, and displaying on the display means to identify the word, is input by the input means, in response to information indicating that the words displayed on said display means is unnecessary word A word obtained by writing the word in the basic word dictionary in association with a corresponding logical index and excluding a word that is an unnecessary word from words included in a lexical word to be converted in the unnecessary word dictionary It is preferable to further execute a step of writing a logical index of the word determined as the unnecessary word in association with one piece of information specified from the set of

According to another aspect of the method of the present invention, the computer comprises a plurality of logical indexes among the logical indexes corresponding to the decomposed words from the set of memory-expanded logical indexes. Before selecting the set of logical indexes that matches any set of logical indexes to be executed and temporarily performing the step of obtaining one piece of information specified by the selected set of logical indexes. A set of logical indexes that matches one of the sets of logical indexes of the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in memory. And a logical index composed only of logical indexes of any one of the logical index pairs. Converting a lexical phrase including the plurality of words into another data including the specified information by using a piece of information specified by the selected set of logical indexes. It is preferable to further execute .

According to one aspect of the present invention, there is provided a basic word dictionary in which each of a plurality of words is associated with a logical index representing each word and registered in advance in a storage unit, and is registered in the basic word dictionary. It is one of information that the set of logical root indexes corresponding to the set of words that combine words together are identified by the set of words and associating, and when said set between the logical index is subsumption relation, subsumed The logical index set is not included in the word set corresponding to the included logical index set and is not used when directly specifying the one information, but the one information is finalized. A name dictionary that is pre-registered in the storage means in association with the one piece of information, a logical index corresponding to an unnecessary word that is an assisting word A computer that converts a lexical word including a plurality of words into another data including one piece of information specified by the plurality of words, and a word representing each word registered in the basic word dictionary A step of expanding a memory on a memory in association with an index to generate a basic word dictionary expanded in the memory, a set of logical indexes registered in the name dictionary, and a logical index of unnecessary words into each set of logical indexes Expanding the memory on the memory in association with the corresponding one specified information, generating a memory expanded name dictionary, decomposing the lexical word to be converted into words, and storing the memory on the memory Obtaining and converting a logical index corresponding to the decomposed word with reference to the expanded basic word dictionary; When there is an inclusion relationship, a set of logical indexes matching the set of logical indexes corresponding to the decomposed words is selected from the set of logical indexes expanded in memory including the logical indexes of unnecessary words. Selecting and using one piece of information specified by the set of selected logical indexes to convert the lexical word containing the plurality of words into another data containing the one piece of specified information. It is solved by the program to make.

According to one aspect of the program of the present invention, when acquiring and converting a logical index corresponding to the decomposed word with reference to the basic word dictionary expanded in the memory on the computer, If there is a word for which a logical index cannot be obtained, the step of identifying the word and displaying it on the display means, and responding to information input by the input means and indicating that the word displayed on the display means is an unnecessary word Then, the word is written in the basic word dictionary in association with the logical index corresponding to the word, and the unnecessary word is excluded from the words included in the lexical word to be converted in the name dictionary. It is preferable to further execute a step of writing a logical index of the word determined as the unnecessary word in association with one piece of information specified from the set of words. .

  According to another aspect of the present invention, the computer includes a set of logical indexes corresponding to the decomposed words out of the memory expanded logical index sets including the logical indexes of unnecessary words. Before performing the step of selecting a set of matching logical indexes, the logic corresponding to the decomposed word from the memory expanded logical index set that does not include the logical index of unwanted words. A logical index set that matches a logical index set that is composed of a plurality of logical indexes of the indexes and that is composed only of the logical indexes of the logical index set is selected. And using one piece of information specified by the set of selected logical indexes More further it is preferable to perform the step of converting the other data including one of information the identified lexical including the plurality of words.

According to another aspect of the present invention, there is provided a basic word dictionary in which each of a plurality of words is associated with a logical index representing each word and registered in advance in storage means, and the basic word dictionary A name dictionary pre-registered in storage means in association with one piece of information specified by the set of words, a set of logical indexes corresponding to a set of words obtained by combining registered words, If set to each other in subsumption relation, for a set of logical index subsumed, not used in identifying said one information directly because it is not contained in the set of words that correspond to the set of logical root indexes are the subsumption A logical index corresponding to an unnecessary word that is unnecessary in terms of the word but assists in finally identifying the one information is associated with the one information. Registered in the basic word dictionary in a computer having an unnecessary word dictionary pre-registered in a memory and converting a lexical word including a plurality of words into another data including one information specified by the plurality of words A word which is associated with a logical index representing each word and expanded in memory to generate a basic word dictionary expanded in memory, and a set of logical indexes registered in the name dictionary A step of expanding the memory on the memory in association with the specified one information corresponding to each set of logical indexes, generating a name dictionary expanded in the memory, and an unnecessary word registered in the unnecessary word dictionary And a logical index corresponding to each of the unnecessary words is associated with the one information corresponding to the logical index corresponding to each unnecessary word and is expanded in the memory. A step of generating an unnecessary word dictionary expanded in a memory, a step of decomposing a lexical word to be converted into a word, and a reference to the basic word dictionary expanded in the memory to correspond to the decomposed word A logical index corresponding to the decomposed word out of the set of logical indexes expanded in the memory, and a step of acquiring and converting the logical index Selecting a set of logical indexes that matches the set of logical indexes, and temporarily acquiring one piece of information specified by the selected set of logical indexes; In the unnecessary word dictionary, the logical index of the unnecessary word corresponding to the one piece of temporarily acquired information is converted into the decomposition If the logical index corresponding to the word is identical to the logical index that was not used when the one piece of information was temporarily obtained, the one piece of the temporarily obtained information is to be identified. This is solved by a program that executes the step of determining as one piece of information and converting the lexical phrase including the plurality of words into another data including the specified one piece of information by using the one piece of information.

  According to one aspect of the program of the present invention, when acquiring and converting a logical index corresponding to the decomposed word with reference to the basic word dictionary expanded in the memory on the computer, When there is a word for which a logical index cannot be obtained, the step of identifying the word and displaying it on the display means, and responding to information input by the input means and indicating that the word displayed on the display means is an unnecessary word The word is written in the basic word dictionary in association with the corresponding logical index, and the unnecessary word among the words included in the lexical word to be converted is excluded from the unnecessary word dictionary. It is preferable to execute a step of writing a logical index of the word determined as an unnecessary word in association with one piece of information specified from a set of words.

  According to another aspect of the program of the present invention, the computer comprises a plurality of logical indexes among the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in the memory. Before selecting the set of logical indexes that matches any set of logical indexes to be executed and temporarily performing the step of obtaining one piece of information specified by the selected set of logical indexes. A set of logical indexes that matches one of the sets of logical indexes of the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in memory. And a logical in of only one logical index set of the logical index set. A lexical phrase including the plurality of words is converted into another data including the specified information by using a piece of information specified by the selected set of logical indexes. Preferably, the steps are further performed.

  According to the present invention, when a lexical phrase is converted into data, the inclusion of a set of logical indexes or words to be included is included even when an inclusion relationship is generated between sets of logical indexes or sets of words. A word that is not used when directly specifying one piece of information to be obtained because it is not included in the set of included words, but is a word that assists in finally specifying the one piece of information. When matching a set of logical indexes of input lexical words and a logical index set of a name dictionary using a certain unnecessary word, matching is performed in consideration of the logical index of unnecessary words, so it is accurate to one piece of information to be obtained. Can be converted to That is, by determining the presence / absence of unnecessary words, it is possible to improve the analysis accuracy of the included logical index set.

Preferred embodiments of the present invention will be described below with reference to the drawings. Throughout the drawings, the same or similar reference numerals indicate the same or similar components.
FIG. 1 shows an apparatus for converting a lexical word into data according to a preferred embodiment when the present invention is applied to a customer customer information (CIF) analysis process using a computer for a settlement instruction message received at a bank or the like. It is a figure which shows the basic composition. In FIG. 1, 10 is a processing engine composed of an arbitrary data processing device such as a main frame computer, personal computer, microprocessor, 12 is a main memory, 14 is a basic word dictionary, and 16 is a name. Reference numeral 18 denotes an unnecessary word dictionary. The device for converting this lexical into data may also include a main frame computer, an input device 20 such as a keyboard normally connected to a personal computer, and a display device 22 such as a normal liquid crystal display. The basic word dictionary 14, the name dictionary 16, and the unnecessary word dictionary 18 are stored in a hard disk (not shown) such as a magnetic disk, but are not limited thereto, and are stored in any other type of storage device. Can be done. The data processing device functioning as the processing engine 10, the main memory 12, the hard disk storing the basic word dictionary 14, the name dictionary 16 and the unnecessary word dictionary 18, the input device 20, and the display device 22 are configured with normal data They are coupled to each other by a bus or the like (not shown).

  FIG. 2 shows a state where words (hereinafter, also referred to as “basic words”) registered in advance in the basic word dictionary 14 are expanded in the main memory 12. The input data handled in the CIF analysis processing in a bank or the like is usually composed of alphabets and numerics (numeric characters), and therefore the words registered in the basic word dictionary 14 are also composed of alphabets and numerics (numeric characters). Note that the word or basic word in this specification includes not only common nouns, proper nouns, and abbreviations, but also any set of symbols having a certain meaning. As shown in FIG. 2, an example of the basic word dictionary 14 includes, as items, words, parts of speech, name attributes, code attributes, and logical indexes represented by numbers corresponding to the registered words. The number of the logical index is preferably a number expressed in binary to reduce the number of CPU processing units. The basic word dictionary of the present invention may include at least a word column for registering a basic word and a logical index column for storing a logical index of a number corresponding to the word. It is not limited to things. When a basic word is registered in the word column of the basic word dictionary 14, the logical index is assigned a number (fixed value) corresponding to the word, and is registered in the logical index column of the basic word dictionary 14. The number is also stored, that is, registered in association with. When the basic word dictionary 14 includes a basic word that is not registered in the lexical phrase to be converted, the basic word dictionary 14 registers a new basic word and a corresponding logical index, and when the basic word dictionary 14 is no longer used in the registered basic word, the basic word dictionary 14 A word and its corresponding logical index can be deleted.

  The processing engine 10 expands the basic words registered in the basic word dictionary 14 in the main memory 12 as shown in FIG. 2 before starting the conversion process. Since memory addresses are dynamically allocated, the same word is not stored at the same memory address location each time a program is memory loaded, and the memory addresses are typically different. Thus, in this example, for the basic word “AKASAKA” in the word column, as indicated by reference numeral 100, on the main memory 12 that is dynamically allocated when the program is memory loaded at a given time. Number 50 is assigned as the memory address, and information relating to “AKASAKA” is stored at that location. Note that the basic word “AKASAKA” is stored in the main memory 12 in association with a fixed logical index “# 100”, in contrast to the memory address. From the viewpoint of high-speed processing, it is preferable that all the basic word dictionaries 14 are expanded in the main memory 12, but this is used when the basic words included in the lexical terms to be converted are known in advance. Only basic words may be expanded in the main memory 12, and depending on the application, the conversion processing speed may be slow, but a part of the basic words registered in the basic word dictionary 14 is expanded in the memory. When the basic word of expansion becomes necessary for the conversion process, the memory may be additionally expanded.

  FIG. 3 shows a state in which the logical index set registered in advance in each of the name dictionary 16 and the unnecessary word dictionary 18 is expanded on the main memory 12. FIG. 3 also shows a state in which basic words registered in advance in the basic word dictionary 14 similar to FIG. 2 are expanded in the main memory 12.

  As shown in FIG. 3, the item in the name dictionary 16 includes one piece of information specified by a combination of a logical index set, a name, and a word indicated in the name, for example, a CIF code in this bank application example, and Consists of an inclusion code to specify where the inclusion relationship is occurring. This inclusion code can clarify the state that the CIF code must not be specified because an inclusion relationship has occurred for input data that was unconditionally analyzed before the inclusion relationship. It helps to reduce misanalysis. The inclusion code can clarify the existence of a plurality of logical index sets having an inclusion relationship when the inclusion relationship is generated. Among the basic words registered in the basic word dictionary 14, basic words included in combinations of basic words for which the CIF code is specified are registered in advance in the name column of the name dictionary 16. As an example, it is assumed that the CIF code “6950000” is specified by the word combination “NAKAMORI ELECTRIC CO., LTD. MARUNOUCHI” and “676000” is specified by “NAKAMORI CO., LTD. MARUNOUCHI”. Therefore, “NAKAMORI ELECTRIC CO., LTD. MARUNOUCHI” is registered in the first line of the name dictionary 16, and “NAKAMORI CO., LTD. MARUNOUCHI” is registered as a character string in the second line. A set of logical indexes corresponding to these combined basic words is registered in the logical index set column. For example, “# 105, # 106, # 107, # 300” is associated with the name “NAKAMORI ELECTRIC CO., LTD. MARUNOUCHI” in the first line of the name dictionary 16, and the name “ Corresponding to “NAKAMORI CO., LTD. MARUNOUCHI”, “# 105, # 107, # 300” are registered as a set of logical indexes of the basic word dictionary 14, respectively. A unique number corresponding to each name is registered in the CIF code column. For example, the first line of the name dictionary 16 has a CIF code “6950000” corresponding to “NAKAMORI ELECTRIC CO., LTD MARUNOUCHI”, and the second line has a CIF code corresponding to “NAKAMORI CO., LTD MARUNOUCHI”. “6760000” is registered.

  In this example, the CIF codes “6950000” and “6760000” have an inclusion relationship, that is, the former logical index set is the latter logical index set “# 105, # 107, # 300”. including. That is, the latter set of logical indexes is included in the former set of logical indexes. Therefore, “# 4000” is assigned as the inclusion code number for this set, and “# 4000” is registered in both lines of the inclusion code column as shown in FIG. A logical index that is not a common part is registered in the inclusion code column of the CIF code “6950000”. In this example, “# 106” (the word “ELECTRIC” is registered in the inclusion code column.

  The name dictionary 16 can be deleted when there is a combination of basic words that are not registered in the lexical phrase to be converted, and a combination that includes a new basic word is registered, and when the combination that has been registered is no longer used.

  As shown in FIG. 3, the items in the unnecessary word dictionary 18 are composed of a CIF code and a logical index of unnecessary words. The unnecessary word is not registered in the logical index set of the name dictionary 16 and is unnecessary in that it is not used when directly specifying the CIF code, but it is a word that assists in finally specifying the CIF code. The unnecessary word is often a single word, but may be composed of a plurality of words. In the example shown in FIG. 3, “6760000” is registered in the CIF code column, and “AND” and “OR” are unnecessary words for this “6760000”. ”And“ # 108 ”(see the basic word dictionary 14 shown in FIG. 2) are registered in the logical index column for unnecessary words. Although there may be one unnecessary word, a plurality of words can become unnecessary words in this way, and therefore the unnecessary word column of the unnecessary word dictionary 18 can register a logical index of a plurality of words. Have

The unnecessary word dictionary 18 can be changed when a new inclusion relationship occurs or disappears, or when a new unnecessary word occurs or disappears.
Next, the operation of the apparatus shown in FIG. 1 will be described with reference to the flowchart of FIG.

  The processing engine 10 performs initial processing in step 100. As described with reference to FIG. 2, the words registered in the basic word dictionary 14 are expanded in the main memory 12 (the expanded state is shown as 14a in FIG. 3). Next, the logical index set registered in the name dictionary 16 is associated with the CIF code and the inclusion code, and expanded into the main memory 12 as indicated by reference numeral 16a in FIG. Are associated with the logical index of the unnecessary word, and are expanded in the main memory 12 as indicated by reference numeral 18a in FIG.

  Next, the processing engine 10 performs input data analysis 20. This will be described with reference to an example of input data shown in FIG. In step 102, it is assumed that input data 30, that is, “NAKAMORI AND CO., LTD. MARUNOUCHI” is input, as indicated by 1 in FIG. Next, as shown in 2 of FIG. 5, the space is used as a clue to break it into words. In step 104, the processing engine 10 refers to the basic word dictionary 14 a expanded in the main memory 12 as shown in 3 of FIG. 5 and acquires a logical index as indicated by reference numeral 60. Next, as shown by 4 in FIG. 5, the input data is converted into a logical index.

Next, the processing engine 10 performs a matching process 22.
In step 106, the processing engine 10 determines whether there is a word that could not be converted into a logical index because the logical index could not be acquired. In the example shown in FIG. 5, since there are no unconverted words, the processing process proceeds to step 108.

  In step 108, the processing engine 10 determines whether or not the set of converted logical indexes and the logical index set of the name dictionary 16a (FIG. 3) expanded in the main memory 12 are completely matched. . Perfect matching means that both logical indexes match with each other without excess or deficiency. Here, it is assumed that “NAKAMORI AND CO., LTD. MARUNOUCHI” has not been given a CIF code and is not registered. Therefore, since the processing engine 10 does not have the logical index set “# 105, # 301, # 107, # 300” (4 in FIG. 5) corresponding to the input data in the name dictionary 16a (FIG. 3), complete matching is performed. Judge that it is not. Therefore, the process proceeds to step 110.

  In step 110, the processing engine 10 performs the conversion of the converted logical index set, the logical index set of the name dictionary 16 a and the unnecessary word dictionary 18 a (FIG. 3) expanded in the main memory 12, and the logical index of the unnecessary word. Are partially matched. Here, the partial matching means that the logical index set including the logical index of unnecessary words is selected from the logical index set that most matches the logical index converted in step 104, that is, includes the most. To do. Specifically, since the set of logical indexes converted in step 104 includes “# 105”, “# 107”, and “# 300”, the first row and the second row of the name dictionary 16a are targeted, Next, it is confirmed whether there is a registration of an unnecessary word logical index in the unnecessary word dictionary 18a using the CIF code as a key. The CIF code “6950000” has no unnecessary word registered in the unnecessary word dictionary 18a, while “67601” has “# 301” registered therein. Accordingly, the processing engine 10 does not select the first row of the name dictionary 16a, selects the logical index set “# 105, # 107, # 300” for the second row, and further does not need the unnecessary word dictionary 18a. The logical index set including the logical index “# 301” or “# 108” of the word is set as a set of logical indexes “# 105, # 301, # 107, # 300” (4 in FIG. 5) corresponding to the input data. Determine if they match. At this time, it is assumed that there are two sets of logical index sets on the dictionary side, “# 105, # 107, # 300, # 301” and “# 105, # 107, # 300, # 108”. Compare the set with the set of logical indexes on the input data side. That is, the number of logical index sets on the dictionary side is the same as the number of unnecessary words registered, and all of them are compared. In the example of FIG. 5, the logical index set “# 105, # 107, # 300, # 301” on the dictionary side matches the logical index set “# 105, # 301, # 107, # 300” on the input data side. Therefore, the processing engine 10 selects and acquires the CIF code “6760000” in the second line of the name dictionary 16a (see reference numeral 32 in FIG. 1).

  Therefore, even when the names have an inclusion relationship, by using partial matching including unnecessary words, a correct CIF code can be acquired and input data can be converted into a correct CIF code.

  In step 112, the processing engine 10 converts the input data “NAKAMORI AND CO., LTD. MARUNOUCHI” into the acquired CIF code “6760000”.

Next, the processing process when the input data of FIG. 5 is input when “AND” is not registered as an unnecessary word will be described below with reference to FIGS. 4 and 6.
The initial processing in step 100 shown in FIG. 4 is as described above and will not be described.

  The processing engine 10 performs input data analysis 20. In step 102, it is assumed that input data, that is, “NAKAMORI AND CO., LTD. MARUNOUCHI” is input, as indicated by 1 in FIG. Next, as in the case of the input data shown in FIG. 5, the space is used as a clue to decompose the word (see 2 in FIG. 6). In step 104, the processing engine 10 refers to the basic word dictionary 14 a expanded in the main memory 12 as indicated by 3 in FIG. 6 and acquires a logical index as indicated by reference numeral 62. At this time, since “AND” is not registered in the basic word dictionary 14, a logical index cannot be acquired. Next, as shown in 4 of FIG. 6, the input data is converted into a logical index. Here, since “AND” has not acquired a logical index, it is not converted into a logical index and is left as it is.

The processing engine 10 then proceeds to the matching process 22.
In step 106, the processing engine 10 determines whether there is a word that could not be converted into a logical index because the logical index could not be acquired. Since “AND” has not been converted, the processing engine 10 proceeds to step 120. In step 120, for example, a set of logical indexes shown in 4 of FIG. 6 and unconverted words, that is, “# 105 <AND># 107 # 300”, and input data “NAKAMORI AND CO., LTD” are displayed on the display device 22. MARUNOUCHI "is displayed. From the displayed information and information related to the input data, for example, information on the transmission source (or destination), transmission point, etc., the input data is “NAKAMORI CO., LTD. MARUNOUCHI” and the CIF code is “ 2, and when it is determined that “AND” has a character as an unnecessary word, for example, when “AND” is input from the input device 20, the processing engine 10 is referred to by the reference number in FIG. 2. As indicated by 64, this “AND” is registered in the basic word dictionary 14 in association with a unique logical index. Next, when the operator inputs an instruction from the input device 20 to register “AND” as an unnecessary word in the unnecessary word dictionary 18, the processing engine 10 has a CIF code “6760000” as indicated by reference numeral 66 in FIG. And the logical index “# 301” of “AND” is registered. Therefore, when the input data “NAKAMORI AND CO., LTD MARUNOUCHI” is input after registration in the unnecessary word dictionary 18, even if this input has an inclusion relationship, the processing described above with reference to FIG. According to the process, it is correctly converted to CIF code “6760000”.

  Here, it is assumed that “OR” in the input data “NAKAMORI OR CO., LTD. MARUNOUCHI” has a character as an unnecessary word like “AND”. When the data “NAKAMORI OR CO., LTD. MARUNOUCHI” is first input, it is processed in the same manner as in the case of “NAKAMORI AND CO., LTD. MARUNOUCHI”, and as indicated by reference numeral 68 in FIG. “OR” is registered in the basic word dictionary 14 in association with the unique logical index “# 108”, and further, as indicated by reference numeral 66 in FIG. 3, the logical index “#” is associated with the CIF code “6760000”. 108 "is registered. As described above, the unnecessary word dictionary 18 has a structure in which a plurality of unnecessary words can be registered in association with the CIF code. When “NAKAMORI OR CO., LTD MARUNOUCHI” is input after registration of the unnecessary word “OR”, the processing process for specifying the correct CIF code is the case of the aforementioned input data “NAKAMORI AND CO., LTD MARUNOUCHI” It is the same.

  The basic word dictionary 14 and the unnecessary word dictionary 18 relating to unnecessary words can be registered in advance by assuming unnecessary words that the operator may possibly have. The unique logical index assigned to the unnecessary word may be automatically determined by the processing engine 10 or selected by the operator. In short, if the unique logical index is assigned. Any method may be used.

  Next, a processing process when “NAKAMORI CO., LTD. MARUNOUCHI” is input as input data will be described with reference to FIGS. 4 and 7. Since step 100 in FIG. 4 is the same as the above example, description thereof is omitted. In step 102 of FIG. 4, the input data is broken down into words, as shown at 1 and 2 in FIG. Next, in step 104 of FIG. 4, a logical index corresponding to the decomposed word is obtained as indicated by reference numeral 70 as shown in 3 of FIG. 7, and further, as shown in 4 of FIG. The set is converted into logical indexes “# 105, # 107, # 300”. In the determination in step 106 of FIG. 4, since there is no word that has not been converted, the processing process proceeds to step 108.

  Next, at step 108, the converted logical index set “# 105, # 107, # 300” and the logical index set of the name dictionary 16a (FIG. 3) expanded in the main memory 12 are completely matched. It is determined whether or not. Since the converted logical index set “# 105, # 107, # 300” matches the logical index set “# 105, # 107, # 300” in the second row of the name dictionary 16a without any excess or deficiency, The processing process by the processing engine 10 proceeds to step 122. In step 122, the processing engine 10 selects the CIF code “6760000” corresponding to the logical index set “# 105, # 107, # 300” in the second row of the name dictionary 16a, and the input data “NAKAMORI CO.,”. “LTD MARUNOUCHI” is converted to CIF code “6760000”. Therefore, “NAKAMORI CO., LTD. MARUNOUCHI” having an inclusion relationship with “NAKAMORI ELECTRIC CO., LTD. MARUNOUCHI” can also be converted into a correct CIF code.

  When “NAKAMORI ELECTRIC CO., LTD. MARUNOUCHI” is input as data, the first process of the name dictionary 16a of FIG. 3 is performed in step 108 by the same processing as that of the input data “NAKAMORI CO., LTD. It is completely matched with the logical index set “# 105, # 106, # 107, # 300” of the row, and converted to CIF code “6950000” in step 122. Therefore, it is possible to convert the input data having the inclusion relationship and the inclusion into a correct CIF code.

  If the partial matching is not established in step 110 of FIG. 4, it is displayed on the display device 22 as being incapable of analysis as indicated by reference numeral 124, the analysis is stopped, and the analysis is left to the operator. This is to avoid inaccurate analysis.

Next, the deformation | transformation aspect of the structure of the name dictionary 16 and the unnecessary word dictionary 18 is demonstrated with reference to FIG.
Instead of providing the unnecessary word dictionary 18 independently, as shown in FIG. 8, a main column 80 and an unnecessary word column 82 are provided in the column of the logical index set of the name dictionary 16 ', and a CIF code and a pair are set in the main column 80. The logical index set corresponding to one is registered in the unnecessary word column 82 with the logical index corresponding to the word of the unnecessary word. Note that the unnecessary word column 82 has a structure in which when there are a plurality of words of unnecessary words, each logical index corresponding to each word can be registered. Further, when there is no unnecessary word, the unnecessary word column 82 is empty.

  Only differences from the operation of the embodiment shown in FIG. 3 will be described below. It is assumed that the name dictionary 16 ′ is expanded on the main memory 12. The complete matching in step 108 in FIG. 4 is a combination of the logical index set obtained by converting the input data and only the logical index set in the main column 80a of the name dictionary 16'a expanded in the main memory 12. Do. The method of complete matching is the same as in the embodiment of FIG.

  The partial matching in step 110 in FIG. 4 is performed by combining a set of logical indexes obtained by converting input data and adding an unnecessary word in the unnecessary word column 82a to the logical index set in the main column 80a. The method of partial matching is the same as in the embodiment of FIG.

  Registration of an unnecessary word logical index in the unnecessary word column 82 is the same as registration of an unnecessary word in the unnecessary word dictionary 18. Further, unnecessary words may or may not be included in the names registered in the name column of the name dictionary 16 'as shown in FIG.

Next, one modified embodiment of the present invention will be described. First, an example of dictionary registration as shown in FIG. 10 will be described.
FIG. 10 shows a state in which a logical index set registered in advance in each of the name dictionary 16 ″ and the unnecessary word dictionary 18 ″ is expanded on the main memory 12. FIG. 10 also shows a state in which basic words registered in advance in the basic word dictionary 14 similar to FIG. 2 are expanded in the main memory 12. In the name column of the name dictionary 16 ”, among the basic words registered in the basic word dictionary 14, a CIF code“ 6950000 ”is generated by a combination of basic words“ NAKAMORI ELECTRIC CO., LTD. ”Is identified as“ 6760000 ”by“ NAKAMORI CO., LTD. MARUNOUCHI ”, and“ 8984000 ”by“ NAKAYAMA PRINTING CORP ”. Therefore, “NAKAMORI ELECTRIC CO., LTD. MARUNOUCHI” is in the first line of the name dictionary 16 ”,“ NAKAMORI CO., LTD. MARUNOUCHI ”is in the second line,“ NAKAYAMA PRINTING CORP ”is in the third line, Each is registered as a character string. A set of logical indexes corresponding to these combined basic words is registered in the logical index set column. For example, “# 105, # 106, # 107, # 300” is associated with the name “NAKAMORI ELECTRIC CO., LTD. MARUNOUCHI” in the first line of the name dictionary 16, and the name is in the second line. “# 105, # 107, # 300” corresponds to “NAKAMORI CO., LTD. MARUNOUCHI”, and “# 401, # 210, # 300” corresponds to the name “NAKAYAMA PRINTING CORP” on the third line. 220 "is registered as a set of logical index of their respective basic word dictionary 14. A unique number corresponding to each name is registered in the CIF code column. For example, the first line of the name dictionary 16 ”has a CIF code“ 6950000 ”corresponding to“ NAKAMORI ELECTRIC CO., LTD MARUNOUCHI ”, and the second line has a CIF corresponding to“ NAKAMORI CO., LTD MARUNOUCHI ”. The code “6760000” is registered in the third line, and the CIF code “8984000” corresponding to “NAKAYAMA PRINTING CORP” is registered.

  In this example, the CIF codes “6950000” and “6760000” have an inclusion relationship, that is, the former logical index set is the latter logical index set “# 105, # 107, # 300”. including. That is, the latter set of logical indexes is included in the former set of logical indexes. Therefore, “# 4000” is assigned as the inclusion code number for this set, and “# 4000” is registered in both rows of the inclusion code column as shown in FIG. A logical index that is not a common part is registered in the inclusion code column of the CIF code 6950000. In this example, “# 106” (word “ELECTRIC”) is registered in the inclusion code column.

Next, the processing process when the data of FIG. 5 is input during the dictionary registration (FIG. 10) will be described below with reference to the flowchart of FIG. 11 and FIG.
The initial processing and input data analysis 20 in step 100 shown in FIG. 11 are as described above, and will not be described. The processing engine 10 then proceeds to the matching process 22 ′.

  In step 106, the processing engine 10 determines whether there is a word that could not be converted into a logical index because the logical index could not be acquired. In the example shown in FIG. 5, since there are no unconverted words, the processing process proceeds to step 108.

  In step 108 ', the processing engine 10 determines whether or not the set of the converted logical index and the logical index set of the name dictionary 16 "b (FIG. 10) expanded in the main memory 12 are completely matched. In the example shown in Fig. 5, the processing process proceeds to step 110 because it is not perfect matching.

  In step 110 ′, the processing engine 10, the set of converted logical indexes, the logical index set of the name dictionary 16 ″ b and the unnecessary word dictionary 18 ″ b (FIG. 10) expanded in the main memory 12, and It is determined whether or not the logical index set of unnecessary words is partially matched. In the example shown in FIG. 5, the CIF code “6760000” in the second line of the name dictionary 16 ″ b is selected and acquired by partial matching (see reference numeral 32 in FIG. 1). The process proceeds to step 116.

  In step 116, the processing engine 10 determines whether or not an inclusion code is registered in the line of the CIF code “6760000” acquired in the name dictionary 16 ″ b in step 110. In the example shown in FIG. 5, since the inclusion code “4000” exists in the line of the CIF code “6760000” registered in the name dictionary 16 ″ b, the processing process proceeds to step 114.

  The processing engine 10 outputs an inclusion relation list in step 114. Specifically, the name acquired as a result of searching the name dictionary 16 ″ b using the inclusion code “4000” acquired in step 116 as a key is displayed on the display device 22. In the example of FIG. The name “NAKAMORI ELECTRIC CO., LTD. MARUNOUCHI” and the name “NAKAMORI CO., LTD. MARUNOUCHI” registered in 16 ″ b are displayed. As a result, it is possible to clearly indicate that an inclusion relationship has occurred in the corresponding name and the name that is the cause of the inclusion relationship, and recognize it as a name dictionary correction candidate. The process then proceeds to step 118.

  The processing engine 10 makes a final matching determination in step 118. Specifically, it is determined whether the specified CIF is specified by the complete matching in step 108 'or the partial matching in step 110'. If the CIF has been specified by the perfect matching in step 108 ′, the processing engine 10 proceeds to step 112. When the CIF is specified by the partial matching in step 110 ′, the converted logical index set, the name dictionary 16 ″ b and the unnecessary word dictionary 18 ″ b expanded in the main memory 12 (see FIG. It is determined whether or not the logical index set of 10) and the logical index set of unnecessary words are partially matched. If matching is possible, the processing engine proceeds to step 112. If matching is not possible, the processing engine 10 Proceeds to step 126.

  In the example of FIG. 5, since CIF “6760000” has been identified by partial matching, the processing process proceeds to step 112 to identify CIF “6760000”.

FIG. 1 is a diagram showing a basic configuration of an apparatus for converting a lexical word into data according to a preferred embodiment when the present invention is applied to a CIF analysis process using a computer for a settlement instruction message received at a bank or the like. It is. FIG. 2 shows a state in which basic words registered in advance in the basic word dictionary 14 are expanded in the main memory 12. FIG. 3 shows a state in which the logical index set registered in advance in each of the name dictionary 16 and the unnecessary word dictionary 18 is expanded on the main memory 12. FIG. 4 is a flowchart showing the operation of the apparatus shown in FIG. FIG. 5 shows an example of conversion of input data having an inclusion relationship and including unnecessary words into a logical index. FIG. 6 shows an example of conversion of input data that is inclusive and does not include unnecessary words into a logical index. FIG. 7 shows an example of conversion of another input data that is inclusive and does not contain unnecessary words into a logical index. FIG. 8 shows a modification of the structure of the name dictionary 16 and the unnecessary word dictionary 18 shown in FIG. FIG. 9 is a diagram for explaining a problem in processing input data having an inclusion relationship. FIG. 10 is a diagram for explaining an example of dictionary registration according to one modified embodiment of the present invention. FIG. 11 is a flowchart in one variation of the invention.

Explanation of symbols

10 processing engine 12 main memory 14 basic word dictionary 16 name dictionary 18 unnecessary word dictionary 20 input device 22 display device

Claims (18)

An apparatus for converting a lexical word including a plurality of words into another data including one piece of information specified by the plurality of words,
A basic word dictionary pre-registered in the storage means in association with each of a plurality of words and a logical index representing each word;
Associate a set of logical indexes corresponding to a set of words obtained by combining words registered in the basic word dictionary with one piece of information specified by the set of words, and the sets of logical indexes are inclusive relations In some cases , the set of included logical indexes is not included in the set of words corresponding to the included set of logical indexes, and is unnecessary in that it is not used when directly specifying the one piece of information. A name dictionary in which a logical index corresponding to an unnecessary word which is a word that assists in finally identifying the one information is associated with the one information and is registered in advance in storage means;
A processing engine for converting a lexical phrase including the plurality of words into another data including the specified one piece of information,
The processing engine is
The words registered in the basic word dictionary are associated with a logical index representing each word and expanded in memory.
A logical index set registered in the name dictionary and a logical index of an unnecessary word are associated with the specified one information corresponding to each logical index set and expanded in the memory;
Break the lexical word to be converted into words,
Referencing a basic word dictionary expanded in memory on the memory, obtaining and converting a logical index corresponding to the decomposed word,
A logical index set that matches the logical index set corresponding to the decomposed word is selected from the memory expanded logical index sets including the logical index of unnecessary words, and the selected An apparatus for converting a lexical word including the plurality of words into another data including the specified information by using one information specified by a set of logical indexes. An input means for inputting information including data, and a display means for displaying information including data;
The processing engine further includes:
Referring to the basic word dictionary expanded in the memory, when acquiring and converting the logical index corresponding to the decomposed word, if there is a word for which the logical index cannot be acquired, specify the word Display on the display means;
In response to the information input by the input means indicating that the word displayed on the display means is an unnecessary word, the word is written in the basic word dictionary in association with the corresponding logical index; and The logical index of the word made into the said unnecessary word in association with one information specified from the word group except the word made into the said word dictionary except the word made into the unnecessary word in the word to be converted claim 1 Symbol mounting apparatus writes. The processing engine further selects a logical index set that matches the logical index set corresponding to the decomposed word from the memory expanded logical index set including a logical index of an unnecessary word. Any one of a plurality of logical indexes among the logical indexes corresponding to the decomposed words from the set of the memory-expanded logical indexes that do not include the logical indexes of unnecessary words. A set of logical indexes that is identical to the set of logical indexes and is composed only of the logical indexes of the set of any of the logical indexes, and is specified by the selected set of logical indexes By using one piece of information, the lexical phrase including the plurality of words is identified. The apparatus of claim 1, wherein converting to another data including One information. An apparatus for converting a lexical word including a plurality of words into another data including one piece of information specified by the plurality of words,
A basic word dictionary pre-registered in the storage means in association with each of a plurality of words and a logical index representing each word;
A name dictionary pre-registered in storage means in association with one piece of information specified by the set of words, a set of logical indexes corresponding to a set of words obtained by combining words registered in the basic word dictionary ,
When the set of logical indexes is inclusive , the set of included logical indexes is not included in the set of words corresponding to the included set of logical indexes, and thus when the one information is directly specified Unnecessary word that is unnecessary in that it is not used in the process, but is previously registered in the storage means in association with the one information in association with the logical index of the unnecessary word, which is a word that assists in finally identifying the one information. A dictionary,
A processing engine for converting a lexical phrase including the plurality of words into another data including the specified one piece of information,
The processing engine is
The words registered in the basic word dictionary are associated with a logical index representing each word and expanded in memory.
A set of logical indexes registered in the name dictionary is associated with the specified one piece of information corresponding to each set of logical indexes and expanded in the memory;
A logical index of unnecessary words registered in the unnecessary word dictionary is associated with the one information and expanded in the memory;
Break the lexical word to be converted into words,
Referencing a basic word dictionary expanded in memory on the memory, obtaining and converting a logical index corresponding to the decomposed word,
A set of logical indexes that matches one of the sets of logical indexes of the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in memory. And temporarily acquiring one piece of information specified by the selected set of logical indexes, and there is an inclusion relationship,
In the unnecessary word dictionary expanded in the memory, the logical index of the unnecessary word corresponding to the one piece of temporarily acquired information is the logical index corresponding to the decomposed word. If it matches a logical index that was not used when temporarily acquiring one piece of information, the one piece of temporarily acquired information is determined as one piece of information to be specified, and the one piece of information is used An apparatus for converting a lexical phrase including the plurality of words into another data including the specified information. An input means for inputting information including data, and a display means for displaying information including data;
The processing engine further includes:
Referring to the basic word dictionary expanded in the memory, when acquiring and converting the logical index corresponding to the decomposed word, if there is a word for which the logical index cannot be acquired, specify the word Display on the display means;
In response to the information input by the input means indicating that the word displayed on the display means is an unnecessary word, the word is written in the basic word dictionary in association with the corresponding logical index; and In the unnecessary word dictionary, among the words included in the lexical word to be converted, the logic of the word determined as the unnecessary word in association with one piece of information specified from the word set excluding the word determined as the unnecessary word 4. Symbol mounting device writes index. The processing engine further includes any one of a set of logical indexes constituted by a plurality of logical indexes among the logical indexes corresponding to the decomposed word from the set of logical indexes expanded in the memory. Before selecting a matching logical index set and temporarily acquiring one piece of information specified by the selected logical index set, the memory-expanded logical index set is A set of logical indexes that matches a set of any of the logical indexes configured from a plurality of logical indexes among the logical indexes corresponding to the decomposed words, and includes only the logical index of the set of any of the logical indexes Selected logical index set, and the selected logical index set By using one of the information is identified, another into data, according to claim 4 or 5 further comprising a single information lexical is the specific including the plurality of words. Corresponding to a basic word dictionary that is pre-registered in the storage means in association with a logical index that represents each word, and a set of words that combine words registered in the basic word dictionary A set of logical indexes to be associated with one piece of information specified by the set of words, and when the sets of logical indexes are in an inclusive relationship, for the set of included logical indexes, An unnecessary word that is not included in a set of words corresponding to a set and is not used when directly specifying the one piece of information, but is a word that assists in finally specifying the one piece of information. A name dictionary pre-registered in the storage means in association with the one information, and a lexical phrase including a plurality of words The computer to convert into another data including one information specified by the word,
Associating words registered in the basic word dictionary with a logical index representing each word in a memory and generating a basic word dictionary expanded in memory ;
A logical index set registered in the name dictionary and a logical index of an unnecessary word are associated with the specified one information corresponding to each logical index pair, and are expanded in the memory. Generating a name dictionary;
Breaking the lexical terms to be converted into words;
Obtaining and converting a logical index corresponding to the decomposed word with reference to a basic word dictionary expanded in the memory;
When there is an inclusion relationship, a set of logical indexes matching the set of logical indexes corresponding to the decomposed words is selected from the set of logical indexes expanded in memory including the logical indexes of unnecessary words. selected, by using a single information specified by a set of logical indexes the selected, and a step of converting the lexical including the plurality of words into another data including one of the information the specific how to make. In the computer,
Referring to the basic word dictionary expanded in the memory, when acquiring and converting the logical index corresponding to the decomposed word, if there is a word for which the logical index cannot be acquired, specify the word and Luz steps be displayed on the display means,
In response to the information input by the input means indicating that the word displayed on the display means is an unnecessary word, the word is written in the basic word dictionary in association with the corresponding logical index, and In the name dictionary, a logical index of the word determined as the unnecessary word in association with one piece of information specified from a set of words excluding the word determined as the unnecessary word among the words included in the lexical word to be converted the method of claim 7 Symbol mounting to further execute a step of writing. In the computer,
The step of selecting the logical index set that matches the logical index set corresponding to the decomposed word from the memory expanded logical index set including the logical index of unnecessary words is performed. Any one of a plurality of logical indexes among the logical indexes corresponding to the decomposed words from the memory expanded logical index set that does not include the logical indexes of unnecessary words A set of logical indexes that is identical to the set of logical indexes and is composed only of the logical indexes of the set of any of the logical indexes, and is specified by the selected set of logical indexes By using one piece of information, the lexical word including the plurality of words is identified. Furthermore according to claim 7 or 8 A method according to execute a step of converting the other data including one information. Corresponding to a basic word dictionary that is pre-registered in the storage means in association with a logical index that represents each word, and a set of words that combine words registered in the basic word dictionary A name dictionary pre-registered in storage means in association with one piece of information specified by the set of words and a set of logical indexes to be included when the sets of logical indexes are in an inclusion relationship A word that is not included in the set of included words and is not used when directly specifying the one information, but is a word that assists in finally specifying the one information. A logical index corresponding to a certain unnecessary word is provided in association with the one information and registered in advance in the storage means, and a word / phrase including a plurality of words is assigned. The computer to convert into another data including one information specified by a plurality of words,
Comprising the steps of a word registered in the basic dictionary, and memory development in memory in association with the logical index representation each word, to generate a memory expanded basic dictionary,
Correlating a set of logical indexes registered in the name dictionary with the one piece of specified information corresponding to each set of logical indexes in the memory, and generating a name dictionary expanded in the memory When,
Correlating a logical index of an unnecessary word registered in the unnecessary word dictionary with the one information in the memory, and generating an unnecessary word dictionary expanded in the memory ;
Breaking the lexical terms to be converted into words;
Obtaining and converting a logical index corresponding to the decomposed word with reference to a basic word dictionary expanded in the memory;
A set of logical indexes that matches one of the sets of logical indexes of the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in memory. And temporarily obtaining one piece of information specified by the selected set of logical indexes;
When there is an inclusion relationship, a logical index of an unnecessary word corresponding to the one piece of temporarily acquired information in the memory expanded unnecessary word dictionary corresponds to the decomposed word. If the logical index matches the logical index that was not used when temporarily acquiring the one information, the one temporarily acquired information is determined as one information to be specified, how to execute the steps of converting the lexical including the plurality of words by using the one piece of information to another data including one of information the identified. In the computer,
When a logical index corresponding to the decomposed word is obtained and converted with reference to the basic word dictionary expanded in the memory on the memory, if there is a word for which a logical index cannot be obtained , the word is identified. Displaying on the display means,
In response to the information input by the input means indicating that the word displayed on the display means is an unnecessary word, the word is written in the basic word dictionary in association with the corresponding logical index, and The logical index of the word made into the unnecessary word in association with one piece of information specified from the word set excluding the word made into the unnecessary word in the word to be converted in the unnecessary word dictionary claim 1 0 Symbol mounting method is further execute a step of writing. In the computer,
A set of logical indexes that matches one of the sets of logical indexes of the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in memory. And executing the above step of temporarily obtaining one piece of information specified by the selected set of logical indexes,
A set of logical indexes that matches one of the sets of logical indexes of the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in memory. And selecting a logical index set composed only of logical indexes of any one of the logical index sets, and using one piece of information specified by the selected logical index set, the plurality of words 12. The method according to claim 10 or 11 , further comprising the step of converting a lexical phrase including: to another data including the specified one piece of information. Corresponding to a basic word dictionary that is pre-registered in the storage means in association with a logical index that represents each word, and a set of words that combine words registered in the basic word dictionary associating one of information specified by a set of pairs of said word logical index, and when said set between the logical index is subsumption relation, for a set of logical index subsumed, the logical index is the subsumption stop word is set is not necessary in that is not used in identifying said one information directly because it is not included in the set of words corresponding to a word to assist in finally identifies the piece of information A name dictionary pre-registered in the storage means in association with the one information, and a lexical phrase including a plurality of words The computer to convert into another data including one information specified by the word,
Associating words registered in the basic word dictionary with a logical index representing each word in a memory and generating a basic word dictionary expanded in memory;
A logical index set registered in the name dictionary and a logical index of an unnecessary word are associated with the specified one information corresponding to each logical index pair, and are expanded in the memory. Generating a name dictionary;
Breaking the lexical terms to be converted into words;
Obtaining and converting a logical index corresponding to the decomposed word with reference to a basic word dictionary expanded in the memory;
When there is an inclusion relationship, a set of logical indexes matching the set of logical indexes corresponding to the decomposed words is selected from the set of logical indexes expanded in memory including the logical indexes of unnecessary words. Selecting and using one piece of information specified by the set of selected logical indexes to convert the lexical word containing the plurality of words into another data containing the one piece of specified information. Program to make. In the computer,
Referring to the basic word dictionary expanded in the memory, when acquiring and converting the logical index corresponding to the decomposed word, if there is a word for which the logical index cannot be acquired, specify the word Displaying on the display means;
In response to the information input by the input means indicating that the word displayed on the display means is an unnecessary word, the word is written in the basic word dictionary in association with the corresponding logical index; and The logical index of the word made into the said unnecessary word in association with one information specified from the word group except the word made into the said word dictionary except the word made into the unnecessary word in the word to be converted Furthermore claim 13 Symbol mounting program and a step of writing. In the computer,
The step of selecting the logical index set that matches the logical index set corresponding to the decomposed word from the memory expanded logical index set including the logical index of unnecessary words is performed. Any one of a plurality of logical indexes among the logical indexes corresponding to the decomposed words from the memory expanded logical index set that does not include the logical indexes of unnecessary words A set of logical indexes that is identical to the set of logical indexes and is composed only of the logical indexes of the set of any of the logical indexes, and is specified by the selected set of logical indexes By using one piece of information, the lexical word including the plurality of words is identified. Another claim 13 or 14, wherein the program is further perform the step of converting the data including a piece of information. Corresponding to a basic word dictionary that is pre-registered in the storage means in association with a logical index that represents each word, and a set of words that combine words registered in the basic word dictionary If the name dictionary a set of logical indexes registered in advance in the storage means in association with one of the information specified by said set of words, set between the logical index is subsumption relation, logical index subsumed Is not included in the set of words corresponding to the included logical index set, and is not used when directly specifying the one information. An unnecessary word dictionary in which a logical index corresponding to an unnecessary word that is an assisting word is associated with the one information and registered in advance in a storage unit; Provided, the computer converts the lexical including a plurality of words to another data including one of the information specified by the plurality of words,
Associating words registered in the basic word dictionary with a logical index representing each word in a memory and generating a basic word dictionary expanded in memory;
Correlating a set of logical indexes registered in the name dictionary with the one piece of specified information corresponding to each set of logical indexes in the memory, and generating a name dictionary expanded in the memory When,
The logical index corresponding to the unnecessary word registered in the unnecessary word dictionary is associated with the one information corresponding to the logical index corresponding to each unnecessary word and is expanded in the memory, and the unnecessary word expanded in the memory Creating a dictionary;
Breaking the lexical terms to be converted into words;
Obtaining and converting a logical index corresponding to the decomposed word with reference to a basic word dictionary expanded in the memory;
A set of logical indexes that matches one of the sets of logical indexes of the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in memory. And temporarily obtaining one piece of information specified by the selected set of logical indexes;
When there is an inclusion relationship, a logical index of an unnecessary word corresponding to the one piece of temporarily acquired information in the memory expanded unnecessary word dictionary corresponds to the decomposed word. If the logical index matches the logical index that was not used when temporarily acquiring the one information, the one temporarily acquired information is determined as one information to be specified, A program for executing a step of converting a lexical phrase including the plurality of words into another data including the specified one information by using the one information. In the computer,
Referring to the basic word dictionary expanded in the memory, when acquiring and converting the logical index corresponding to the decomposed word, if there is a word for which the logical index cannot be acquired, specify the word Displaying on the display means;
In response to the information input by the input means indicating that the word displayed on the display means is an unnecessary word, the word is written in the basic word dictionary in association with the corresponding logical index, and The logical index of the word made into the unnecessary word in association with one piece of information specified from the word set excluding the word made into the unnecessary word in the word to be converted in the unnecessary word dictionary 16. Symbol mounting program and a step of writing. In the computer,
A set of logical indexes that matches one of the sets of logical indexes of the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in memory. Before executing the step of temporarily obtaining one piece of information specified by the selected set of logical indexes, from among the set of logical indexes expanded in the memory, A set of logical indexes that matches a set of any of the logical indexes configured from a plurality of logical indexes among the logical indexes corresponding to the decomposed words, and includes only the logical index of the set of any of the logical indexes Select a set of logical indexes to be selected, and Ri by using a single information identified, claim 16 or 17, wherein the program is further perform the step of converting the other data including one of information the identified lexical including the plurality of words.

Images