JP2005275880A - Device, method and program for converting word and phrase into data - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To reduce the load and required time for a program initialization processing, and to enhance the efficiency of the processing by accelerating the overall analyzing speed of words and phrases. <P>SOLUTION: Words and the logical indexes of fixed values assigned to those words are stored so as to be associated with each other in a basic word dictionary 14. The logical index set corresponding to the combination of words for specifying CIF codes and its CIF codes are stored so as to be associated with each other in a designation dictionary 16. Those dictionaries are memory-developed on a main memory 12, and the words of input words and phrases are converted into the logical indexes by referring to them, and whether or not the logical index set corresponding to the CIF codes is included in the elements of the arbitrary combination is decided, and the CIF codes corresponding to the included logical index set are derived. <P>COPYRIGHT: (C)2006,JPO&NCIPI

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 plurality of words “GETRONICS”, “FOODS”, “COODS” in a lexical “GETRONICS FOODs CO., LTD 1-2-34 AKASAKA” as shown by reference numeral 30 in FIG. ., LTD ”and“ AKASAKA ”need to be converted into the customer code“ 123-45678 ”indicated by reference numeral 32 in FIG.

  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.

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 it with a storage position on a disk (see, for example, Patent Document 3).
JP 2002-56005 A Patent application for Japanese Patent Application No. 2003-115287 JP-A-7-36900

  As described above, in Patent Document 2, 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.

  Accordingly, an object of the present invention is to reduce the load and required time for initial program processing, and to improve the overall analysis speed of lexical analysis, thereby improving the processing efficiency.

  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 A process of converting a name dictionary registered in advance in storage means in association with one piece of information specified by the set of words, and a phrase containing the plurality of words into another data containing the specified piece of information An engine, and the processing engine expands the memory registered in the memory in association with the logical index representing each word, the word registered in the basic word dictionary, A set of logical indexes registered in the name dictionary is associated with the one specified information corresponding to each set of logical indexes and expanded in the memory, and a lexical word to be converted is decomposed into words. , Referring to the basic word dictionary expanded in the memory, obtaining and converting the logical index corresponding to the decomposed word, and from the set of logical indexes expanded in the memory, A logical index set that matches any logical index set composed of a plurality of logical indexes among the logical indexes corresponding to the decomposed word is selected and specified by the selected logical index set. By using one piece of information, a device that converts the lexical phrase including the plurality of words into another data including the specified one piece of information. It is solved by.

  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 A name dictionary pre-registered in storage means in association with one piece of information specified by the set of words, and a lexical word containing the plurality of words is converted into another data containing the specified information The processing engine associates a word registered in the basic word dictionary with a logical index representing each word in a memory. The word to be converted is decomposed into words, and a logical index corresponding to the decomposed word is obtained and converted by referring to the basic word dictionary expanded in the memory. A set of all the logical indexes including the logical index is searched from the name dictionary, and the set of all the searched logical indexes is associated with the specified one information corresponding to each set of the logical indexes. A set of logical indexes which are expanded on a memory and are composed of a plurality of logical indexes among the logical indexes corresponding to the decomposed words from the set of logical indexes expanded in the memory; A set of logical indexes that match the, and use one piece of information specified by the selected set of logical indexes. The is solved by a device for converting a lexical including the plurality of words into another data including one of information the identified.

According to one aspect of the apparatus of the present invention, it is preferable that the logical index representing a word is a number corresponding to each word.
According to another aspect of the apparatus of the present invention, it is preferable that the numbers corresponding to the respective words are numbers expressed in binary numbers.

  According to still another aspect of the apparatus of the present invention, the basic word dictionary has at least a word column for storing words and a logical index column for storing logical indexes, and the word column uses words as logical indexes. It is configured to be able to store a plurality of words having different notation having the same meaning and content in the analysis process so that the same logical index is attached to a plurality of words having different notation having the same meaning and content in the analysis process for conversion. The same logical index assigned to the plurality of words having different notations having the same semantic content in the analysis process registered in the basic word dictionary by the processing engine. It is preferable to expand the memory on the memory in association with the.

  Further, according to one aspect of the present invention, there is provided a method for converting a lexical phrase including a plurality of words into another data including one piece of information specified by the plurality of words. Corresponding to a step of providing a basic word dictionary registered in advance in the storage means in association with a logical index representing each word, and a set of words obtained by combining words registered in the basic word dictionary Providing a name dictionary pre-registered in the storage means in association with one piece of information specified by the word set, and a word registered in the basic word dictionary for each word A step of expanding the memory on the memory in association with the logical index to be represented to generate a basic word dictionary expanded in the memory, and a theory registered in the name dictionary Associating an index set with the specified one piece of information corresponding to each logical index set and expanding the memory on the memory to generate a memory expanded name dictionary; A step of decomposing into words, a step of acquiring and converting a logical index corresponding to the decomposed words with reference to a basic word dictionary expanded in the memory, and a name dictionary expanded in the memory A logical index set that matches one of the logical index sets composed of a plurality of logical indexes among the logical indexes corresponding to the decomposed word is selected, and the selected logical index By using one piece of information specified by a set, one piece of information that specifies the lexical phrase including the plurality of words It is solved by a method comprising the steps of converting the other data, including.

  Furthermore, the above-described problem is a method for converting a lexical phrase including a plurality of words into another data including one piece of information specified by the plurality of words, according to another aspect of the present invention. Providing a basic word dictionary pre-registered in the storage means in association with each logical word representing each word, and a set of words combining words registered in the basic word dictionary Providing a name dictionary pre-registered in the storage means in association with one piece of information specified by the set of words corresponding to a set of corresponding logical indexes; and a word registered in the basic word dictionary, A step of generating a memory-expanded basic word dictionary by associating with a logical index representing a word and expanding the memory on a memory, and a word to be converted Decomposing, referring to the memory expanded basic word dictionary, obtaining and converting a logical index corresponding to the decomposed word, and all logical indexes including the acquired logical index A set of all of the retrieved logical indexes in association with the one specified information corresponding to each set of logical indexes, and expanding the memory on 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 using one piece of information specified by the set of selected logical indexes Ri is solved by a method comprising the steps of converting the lexical including the plurality of words into another data including one of information the identified.

According to one aspect of the method of the present invention, the logical index representing a word is preferably a number corresponding to each word.
According to another aspect of the method of the present invention, the numbers corresponding to the respective words are preferably numbers expressed in binary numbers.

  According to still another aspect of the method of the present invention, the basic word dictionary has at least a word field for storing words and a logical index field for storing logical indexes, and the word field has words as logical indexes. It is configured to be able to store a plurality of words having different notation having the same meaning and content in the analysis process so that the same logical index is attached to a plurality of words having different notation having the same meaning and content in the analysis process for conversion. The step of generating a memory expanded basic word dictionary expands the plurality of words in the word column on the memory in association with the same logical index assigned to the plurality of words. It is preferable.

  According to still another aspect of the present invention, there is provided a basic word dictionary in which each of a plurality of words is pre-registered in storage means in association with a logical index representing each word, and the basic word dictionary A name dictionary pre-registered in a 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 A computer that converts a lexical word including a word into another data including one piece of information specified by the plurality of words, and associates a word registered in the basic word dictionary with a logical index representing each word A step of expanding the memory on the memory to generate a basic word dictionary expanded in the memory, and a set of logical indexes registered in the name dictionary, Expanding the memory on the memory in association with the specified information corresponding to the set of logical indexes, generating a memory expanded name dictionary, and decomposing the lexical terms to be converted into words Obtaining and converting a logical index corresponding to the decomposed word with reference to the basic word dictionary expanded in the memory on the memory; and the decomposition from the name dictionary expanded in the memory 1 is selected by selecting a set of logical indexes that matches a set of logical indexes composed of a plurality of logical indexes among the logical indexes corresponding to the selected word, and is specified by the set of selected logical indexes. By using one piece of information, the lexical phrase including the plurality of words is converted into another data including the one specified information. It is solved by a program for executing the steps.

  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 a 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 registered words, A computer for converting a lexical word including a word into another data including one piece of information specified by the plurality of words, and associating a word registered in the basic word dictionary with a logical index representing each word Expanding a memory onto a memory to generate a memory expanded basic word dictionary; decomposing a lexical phrase to be converted into words; and Obtaining and converting a logical index corresponding to the decomposed word with reference to the obtained basic word dictionary, and searching a set of all logical indexes including the obtained logical index from the name dictionary And developing the memory-expanded logical index on the memory in association with the specified one piece of information corresponding to each logical index set, and the memory-expanded logical index A set of logical indexes that matches one of the sets of logical indexes composed of a plurality of logical indexes among the logical indexes corresponding to the decomposed word, and selected By using one piece of information specified by a set of logical indexes, a lexical including the plurality of words It is solved by a program and a step of converting the other data including one information specified.

According to one aspect of the program of the present invention, it is preferable that the logical index representing a word is a number corresponding to each word.
According to another aspect of the program of the present invention, it is preferable that the numbers corresponding to the respective words are numbers expressed in binary numbers.

  According to still another aspect of the program of the present invention, the basic word dictionary has at least a word column for storing words and a logical index column for storing logical indexes, and the word column uses words as logical indexes. It is configured to be able to store a plurality of words having different notation having the same meaning and content in the analysis process so that the same logical index is attached to a plurality of words having different notation having the same meaning and content in the analysis process for conversion. The step of generating a memory expanded basic word dictionary expands the plurality of words in the word column on the memory in association with the same logical index assigned to the plurality of words. It is preferable.

  The present invention has a configuration as described above, pre-allocating a logical index representing each word, associating the word with a corresponding logical index and storing it in a dictionary, and expanding the memory on a memory, The load is reduced compared with the case of using a memory address in the program initial processing, high-speed loading becomes possible, and the initial processing time can be reduced.

  The present invention converts the search target in the analysis processing from a character to a logical index that is a code, and performs an operation related to the collective logic by a combination of the logical indexes that are the code, thereby reducing the analysis processing time compared to the case where the character is a unit. It can be greatly shortened.

  The main purpose of the present invention is to determine whether or not the input lexical word is decomposed and converted into a logical index, and the combination is encoded in a regular combination registered in the name dictionary in advance, as described in the background art. By eliminating the step-by-step dictionary analysis process that expands from the basic word dictionary to the nuclear name dictionary and further from the nuclear name dictionary to the full name dictionary, the discrimination process is made more efficient, resulting in faster processing. Realized.

  In one aspect of the present invention, since the logical index representing a word is a constant value corresponding to each word, among the logical indexes corresponding to the decomposed word in the set of logical indexes expanded in memory, The operation of selecting a logical index set that matches any logical index set composed of a plurality of logical indexes is faster than when the logical index is other symbols.

  In another embodiment of the present invention, the logical index converts a word originally composed of characters (1 character = 1 byte) into a binary number, and performs a dictionary search based on this. The load and CPU burden are reduced, and the processing speed can be further increased.

  Also, a lexical word including a plurality of input words is divided into words, each is converted and extracted into a predetermined logical index, and a logic corresponding to one specific information such as a CIF code is included in an element of the combination. It is determined whether or not the index set is included. When the index set is included, the CIF code or the like is derived from the lexical phrase, so that the analysis process can be speeded up.

  In another embodiment of the present invention, a plurality of words having different notations having the same meaning and content in the analysis process can be stored in the word column of the basic word dictionary. , And memory resources where the basic word dictionary is expanded in memory can be saved.

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. Each dictionary is shown. The basic word dictionary 14 and the name dictionary 16 are stored in a hard disk (not shown) such as a magnetic disk, but are not limited thereto, and can be stored in any other type of storage device. The data processing device functioning as the processing engine 10 and the main memory 12, the hard disk storing the basic word dictionary 14 and the name dictionary 16 are coupled to each other by a normal data bus or the like (not shown). Yes.

  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 a logical index represented by numbers corresponding to each registered word. 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 with the registered basic word, the basic word dictionary 14 The structure is preferably such that 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 is necessary for the conversion process, the memory may be additionally expanded.

  FIG. 3 shows a state where a logical index set registered in advance in the name dictionary 16 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, each item in the name dictionary 16 consists of a 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. . 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, the CIF code “123-45678” is obtained by the word combination “GETRONICS FOODS CO., LTD AKASAKA”, “101-23456” is obtained by “GETRONICS SHOKUHIN OSAKA”, and “102-34” is obtained by “GETRONICS BANK AKASAKA 56”. Assume that each is specified. Therefore, “GETRONICS FOODS CO., LTD AKASAKA” is registered in the first line of the name dictionary 16, “GETRONICS SHOKUHIN OSAKA” is registered in the second line, and “GETRONICS BANK AKASAKA” is registered in the third line. Has been. A set of logical indexes corresponding to these combined basic words is registered in the logical index set column. For example, “# 107, # 106, # 104, # 100” corresponding to the name “GETRONICS FOODS CO., LTD AKASAKA” is displayed in the first line of the name dictionary 16, and the name “ “# 107, # 112, # 111” corresponds to “GETRONICS SHOKUHIN OSAKA”, and “# 107, # 101, # 100” corresponds to the name “GETRONICS BANK AKASAKA” in the third row, respectively. It is registered as a set of logical indexes of the 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 “123-45678” corresponding to “GETRONICS FOODS CO., LTD AKASAKA”, and the second line has a CIF code “123-5678” corresponding to “GETRONICS SHOKUHIN OSAKA” “101-23456” is registered in the third row, and the CIF code “102-34567” corresponding to “GETRONICS BANK AKASAKA” is registered. Since the CIF code needs to be uniquely determined by the combination of one word, there is no duplication in the registered word combination, and there is no relation that a combination of a word is included in another word combination. So that it is registered. 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 can be deleted when the registered combination is no longer used. It is preferable that

  Prior to starting the conversion process, the processing engine 10 associates the logical index set registered in the name dictionary 16 with the CIF code and moves it onto the main memory 12 as indicated by reference numeral 16a in FIG. Expand memory.

Next, input data conversion processing will be described with reference to FIGS. FIG. 4 is a diagram for explaining a process in which data input to the conversion device shown in FIG. 1 is converted.
Here, it is assumed that the basic word dictionary 14 and the name dictionary 16 are expanded on the main memory 12 as described above. Assume that data indicated by reference numeral 40 in FIG. 4 is input. The processing engine 10 breaks the input data 40 into words as shown in step 42. In this example, as indicated by reference numeral 40, the input data is composed of alphabets and numerics (numeric characters), and the words are separated by spaces. The processing engine 10 breaks down the input data 40 into words with a space included in the input data 40 character string as a delimiter.

  Next, as shown in step 44, the processing engine 10 acquires the logical index corresponding to the decomposed word with reference to the basic word dictionary 14a expanded in the memory on the main memory 12 shown in FIG. . In this example, the logical index corresponding to the basic word circled in the basic word dictionary 14a of FIG. 3 is acquired.

  Next, in step 46, the processing engine 10 converts the word that has been obtained with the logical index out of the decomposed words into the logical index that has been obtained. If <1-234> does not exist in the basic word dictionary 14a, it is left as it is. In this example, after conversion, logical indexes “# 107”, “# 106”, “# 104”, and “# 100” are obtained.

  In step 48, the processing engine 10 stores an arbitrary set of logical indexes “# 107”, “# 106”, “# 104”, and “# 100” in the name dictionary 16a expanded in the memory shown in FIG. Whether the logical index set exists is searched, and if they match, the CIF code corresponding to the logical index set is obtained. In this example, the combinations of logical indexes “# 107”, “# 106”, “# 104”, and “# 100” match, and the corresponding CIF code “123-45678” is acquired. As a result, “GETRONICS FOODS CO., LTD AKASAKA” in the input data, that is, the lexical phrase is converted into CIF code “123-45679” which is the desired data.

  In summary, in the preferred embodiment of the present invention, a character string such as an input name is divided into basic words, each is converted and extracted into a predetermined logical index, and the CIF code is included in the combination element. It is determined whether or not an index set corresponding to etc. is included, and when included, a CIF code or the like is derived for the input name or the like.

  Here, an advantage of using the logical index will be described. As described above, by using a logical index, a word originally composed of characters (1 character = 1 byte) is converted into a binary number, and a dictionary search is performed based on this. For example, the word “Shoyama” consisting of 7 characters normally requires 7 bytes to expand the memory as it is. However, when the logical index “207” is applied to this, “207” is expressed as a bit in binary. Then, “11001111” is obtained, which can be expressed by 8 bits (= 1 byte). Therefore, the logical index makes the number of CPU processing units smaller than any word represented by it. By using such a logical index, memory load and CPU load are reduced, and processing speed can be increased.

  The processing blocks described in the processing engine 10 in FIG. 1 and the processing steps in FIG. 4 are the steps 42 and 44 in FIG. 4 in the word recognition block 20 in FIG. 1, and the steps 46 and 48 in FIG. Each corresponds to the name recognition block 22.

  Next, modifications of the above-described embodiment will be described below. The description of the same configuration and operation as in the above embodiment will be omitted, and only the differences will be described. The processing engine 10 expands the basic word dictionary 14 on the main memory 12 before receiving the input data, but does not expand the name dictionary 16 on the main memory 12 in advance.

  Next, the processing engine 10 receives the input data and performs processing up to steps 44 and 46 in FIG. The processing engine 10 then extracts all of the logical index sets including the acquired logical index corresponding to the words contained in the input data from the name dictionary 16 and stores them in the main memory as shown at 16a in FIG. 12 expands the memory on the memory

  Next, the processing engine 10 performs processing similar to step 48 in FIG. More specifically, FIG. 10 shows an arbitrary set of logical indexes “# 107”, “# 106”, “# 104”, and “# 100” corresponding to the words included in the input data. 3 is searched for in the logical index set of the nuclear name dictionary 16a expanded in memory shown in FIG. 3, and if they match, “123-45678” is acquired as the CIF code corresponding to the logical index set. . As a result, “GETRONICS FOODS CO., LTD AKASAKA” in the input data, that is, the lexical phrase is converted into CIF code “123-45679” which is the desired data. In this modification, the conversion processing speed is slower than in the previous embodiment, but the capacity of the main memory 12 may be small.

  In the above-described preferred embodiment, a logical index is defined as a fixed value in advance, the logical index is stored in the basic word dictionary 14 in association with the basic word, and this is expanded in the memory on the main memory 12, whereby the key is Is not necessary to convert the memory address into a memory address that can change each time the program is loaded into the memory, and it is not necessary to replace the key relationship between dictionaries with the acquired memory address. The processing load is reduced, and the load time can be increased. Moreover, the analysis process itself can be speeded up by the dictionary analysis composed of logical indexes and logical index sets.

  Furthermore, another modification of the above-described embodiment will be described below. In this modification, a plurality of words can be stored in one line of the word field of the basic word dictionary 14. In the embodiment described above, analysis processing for converting a word into a logical index is performed. Some words to be analyzed have different meanings but have the same meaning in the analysis process. Although different logical indexes may be assigned to these words individually, they have the same semantic content in the analysis process, so even if the same logical index is assigned, no problem occurs in the analysis process, and there is a waste in processing efficiency. It can be omitted. Therefore, a plurality of words having the same semantic content in the analysis processing are stored in one row of the word column of the basic word dictionary 14 although such notation is different. As an example of the storing method, a space may be inserted between words so that each word can be identified. In the present invention, any method may be used for storing a plurality of words as long as each word can be identified. For example, “FOODS” and “FOOD” are words having different meanings in the analysis process but different in notation in the analysis process. These words are stored by inserting a space between “FOODS” and “FOOD” as indicated by reference numeral 102 in FIG. Therefore, the same logical index “# 106” is allocated to “FOODS” and “FOOD”.

  When two words “FOODS” and “FOOD” are stored in the word field of the basic word dictionary 14, these words include “FOODS” including two words in the word field as indicated by reference numeral 104. The memory is expanded on the main memory 12 in the format of “FOOD”. Therefore, on the main memory 12, the word “FOOD” is also associated with the same logical index “# 106” as the word “FOODS”.

  In the input data shown in FIG. 4, when “FOOD” is input instead of “FOODS”, “FOOD” is converted into the logical index “# 106” by the same operation as the above-described embodiment, and FIG. “GETRONICS FOOD CO., LTD AKASAKA” is converted to “123-45678” by the same operation as in steps 46 and 48 of FIG.

  FIG. 5 is a diagram showing an overview for facilitating the understanding of the invention in which the same logical index is assigned to a plurality of differently expressed words having the same meaning and content in the analysis processing described above. Reference numeral 110 indicates a correspondence relationship between the words and the logical index in the basic word dictionary 14, the word “Syoyama” is different from the word “Shoyama”, and the word “&” is different from the word “and”, but is analyzed. Since the word “Syoyama” is assigned the same logical index “# 207” as the word “Shoyama”, the word “&” is assigned the same logical index “# 206” as the word “and”. It is. Reference numeral 112 indicates the correspondence between the logical index set in the name dictionary 16 and the CIF code. When a lexical word as shown in input 1 is inputted, it is divided into words as shown in division 1, and the word-logical index correspondence relationship indicated by reference number 110 is referred to for each divided word. That is, when a dictionary is applied, it is converted into a logical index shown in dictionary application. On the other hand, when a lexical word as shown in input 2 is input, it is divided into words as shown in division 2, and the correspondence between the word indicated by reference number 110 and the logical index is assigned to each divided word. When referring, that is, applying a dictionary, it is converted to the same logical index as input 1 as shown in Dictionary application. Since the input 1 and the input 2 are converted into the same set of logical indexes, when the correspondence between the logical index set indicated by reference numeral 112 and the CIF code is referred to in the CIF analysis, both the input 1 and the input 2 have the same CIF. Converted to code.

  In the above embodiment in which the same logical index is assigned to a plurality of words having the same meaning and content in the analysis process, the same logical index is assigned to the plurality of words because they have the same meaning and content in the analysis process. By storing the plurality of words in the word column of the basic word dictionary 14 in association with the same logical index, the resources of the storage device such as the main memory and the hard disk are saved, and the processing efficiency is improved. .

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 where a logical index set registered in advance in the name dictionary 16 is expanded on the main memory 12. FIG. 4 is a diagram for explaining a process in which data input to the conversion device shown in FIG. 1 is converted. FIG. 5 is a diagram showing an overview for facilitating understanding of the invention in which the same logical index is assigned to a plurality of differently expressed words having the same meaning and content in the analysis process.

Explanation of symbols

10 Processing Engine 12 Main Memory 14 Basic Language Dictionary 16 Name Dictionary

Claims (15)

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 ,
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 information corresponding to each set of logical indexes 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 converting a lexical phrase including the plurality of words into another data including the specified information by using one information specified by the selected set of logical indexes. 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 ,
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.
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 all logical indexes including the acquired logical index is searched from the name dictionary, and the specified one piece of information corresponding to each set of logical indexes is searched for the set of all searched logical indexes. And expand the memory on the memory in association with
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 converting a lexical phrase including the plurality of words into another data including the specified information by using one information specified by the selected set of logical indexes.   The apparatus according to claim 1 or 2, wherein the logical index representing a word is a number corresponding to each word.   The apparatus according to claim 3, wherein the number corresponding to each word is a number expressed in a binary number. The basic word dictionary has at least a word column for storing words and a logical index column for storing logical indexes,
The word column includes a plurality of different notations having the same semantic content in the analysis process so as to attach the same logical index to a plurality of different notations having the same semantic content in the analysis process for converting the word into a logical index. Is configured to be able to store
A plurality of words having different notations having the same semantic content in the analysis process registered in the basic word dictionary, and the same logical index assigned to the plurality of words having different notations; The apparatus according to any one of claims 1 to 4, wherein the memory is expanded on the memory in association with each other. A method of converting a lexical word including a plurality of words into another data including one piece of information specified by the plurality of words,
Providing 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 registered in advance 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 Providing steps;
Associating words registered in the basic word dictionary with a logical index representing each word in a memory to generate a basic word dictionary expanded in memory; and
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 to generate a name dictionary expanded in memory. Steps,
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;
From the memory expanded name dictionary, a logical index set that matches any logical index set composed of a plurality of logical indexes among the logical indexes corresponding to the decomposed words is selected. And converting one lexical word including the plurality of words into another data including the one specified information by using one information specified by the selected set of logical indexes. A method of converting a lexical word including a plurality of words into another data including one piece of information specified by the plurality of words,
Providing 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 registered in advance 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 Providing steps;
Associating words registered in the basic word dictionary with a logical index representing each word in a memory to generate a basic word dictionary expanded in memory; and
Breaking the lexical terms to be converted into words;
Obtaining and converting a logical index corresponding to the decomposed word by referring to the memory expanded basic word dictionary;
A set of all logical indexes including the acquired logical index is searched from the name dictionary, and the specified one piece of information corresponding to each set of logical indexes is searched for the set of all searched logical indexes. Expanding the memory on the memory in association with
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 converting the lexical phrase including the plurality of words into another data including the specified one information by using one information specified by the selected set of logical indexes. How to prepare.   The method according to claim 6 or 7, wherein the logical index representing a word is a number corresponding to each word.   The method according to claim 8, wherein the number corresponding to each word is a number expressed in a binary number. The basic word dictionary has at least a word column for storing words and a logical index column for storing logical indexes,
The word column includes a plurality of different notations having the same semantic content in the analysis process so as to attach the same logical index to a plurality of different notations having the same semantic content in the analysis process for converting the word into a logical index. Is configured to be able to store
The step of generating a basic word dictionary expanded in memory expands the plurality of words in the word column in the memory in association with the same logical index assigned to the plurality of words. Item 10. The method according to any one of Items 6 to 9. 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 And a name dictionary registered in advance in the storage means in association with one piece of information specified by the set of words, and a phrase containing a plurality of words is specified by the plurality of words. To a computer that converts it to another data containing one piece of information,
Associating words registered in the basic word dictionary with a logical index representing each word in a memory to generate a basic word dictionary expanded in memory; and
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 to generate a name dictionary expanded in memory. Steps,
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;
From the memory expanded name dictionary, a logical index set that matches any logical index set composed of a plurality of logical indexes among the logical indexes corresponding to the decomposed words is selected. And a step of converting a lexical phrase including the plurality of words into another data including the specified information by using one information specified by the selected set of logical indexes. . 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 And a name dictionary registered in advance in the storage means in association with one piece of information specified by the set of words, and a phrase containing a plurality of words is specified by the plurality of words. To a computer that converts it to another data containing one piece of information,
Associating words registered in the basic word dictionary with a logical index representing each word in a memory to generate a basic word dictionary expanded in memory; and
Breaking the lexical terms to be converted into words;
Obtaining and converting a logical index corresponding to the decomposed word with reference to the memory expanded basic word dictionary;
A set of all logical indexes including the acquired logical index is searched from the name dictionary, and the specified one piece of information corresponding to each set of logical indexes is searched for the set of all searched logical indexes. Expanding the memory on the memory in association with
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 converting the lexical phrase including the plurality of words into another data including the specified one information by using one information specified by the selected set of logical indexes. The program to be executed.   The program according to claim 11 or 12, wherein the logical index representing a word is a number corresponding to each word.   The program according to claim 13, wherein the numbers corresponding to the respective words are numbers expressed in binary numbers. The basic word dictionary has at least a word column for storing words and a logical index column for storing logical indexes,
The word column includes a plurality of different notations having the same semantic content in the analysis process so as to attach the same logical index to a plurality of different notations having the same semantic content in the analysis process for converting the word into a logical index. Is configured to be able to store
The step of generating a basic word dictionary expanded in memory expands the plurality of words in the word column in the memory in association with the same logical index assigned to the plurality of words. Item 15. The program according to any one of Items 11 to 14.

Images