An electronic dictionary including a pointer file and a word information correction file

Abstract: An electronic dictionary according to the present invention includes a heading file (1) for storing heading information of a word, a first word information file (3) for storing word information corresponding to the stored heading information of the word, a second word information file (4) for storing corrected word information with respect to the stored word information, a display flag (2a) for displaying whether the word information is corrected or not with respect to the stored heading information of the word, and a pointer (2b) responsive to the displayed contents of the display flag for selecting either the first or second word information file (3 or 4).

Description: BACKGROUND OF THE INVENTION Field of the Invention The present invention relates to an electronic dictionary, and more particularly to an electronic dictionary which may be used in a dictionary for translation in a mechanical translation system. Description of the Background Art Fig. 5 is a block diagram showing a structure of a conventional electronic translator. The structure thereof will be described hereinafter with reference to the drawings. A translation processing apparatus 31 implemented with a CPU and the like is connected with an input device 32 for entering a sentence to be translated, a memory device 33 for storing a generated translated sentence with respect to an entered sentence, a display device 34 for displaying an entered sentence and a translated sentence, a printing device 35 for printing out a translation and the like, a translation rule file 36 for storing rules of syntax and the like required in producing a translated sentence, and an electronic dictionary file 37 storing a translated term corresponding to a word included in the entered sentence. Referring to the electronic dictionary file 37 for various words included in the sentence to be translated, various word information are derived to carry out a translation process. An electronic dictionary incorporated in such a conventional mechanical translation system or a kana-kanji translator and the like could not have the contents corrected even if the user wanted his or her own dictionary because the contents thereof could not be rewritten. A dictionary that allows correction is increased in cost because all the word information file must be implemented with an expensive rewritable memory device. Also, there is a problem of reliability because there is a possibility of the entire dictionary system being destroyed in case the rewritable memory device is defected. Furthermore, when a word information was erroneously corrected, it was difficult to restore it since information of the original dictionary is not maintained. Furthermore, when correction of the dictionary was carried out by a plurality of people or per field, the word information dictionary had to be incorporated in a rewritable memory device of a large capacity for each person or each field to result in a significant increase in cost. Also, if all the word information file is not implemented in a rewritable memory device, the entire word information correction file had to be scanned to search a corrected word which is time consuming for retrieval, resulting in a problem in practicl usage if a great amount of correction was carried out. Prior art document EP-A-0 369 829 disclosed an information searching apparatus, which comprises a memory device having a plurality of banks and containing a plurality of types of information data to be searched, as arranged in block, a table memory device containing, in table, the banks serving as the basis of the information to be searched, the number of changed banks and address data, and a table reading device for reading tabled information from the table memory device. This information searching apparatus is so arranged as to search the target information to be searched by obtaining the base bank information based on the tabled information from the table memory device, and by obtaining the number of changed banks and the address data of the base bank information. Further, this apparatus is arranged such that the user may learn synonyms and antonyms, or the translated terms, the phonetic symbols or the like of index words in dictionary data. Such data may be searched in a short period of time without any complicate operations, thereby to improve the learning efficiency. SUMMARY OF THE INVENTION An object of the present invention is to improve the usability in an electronic dictionary. Another object of the present invention is to improve the reliability in an electronic dictionary. A further object of the present invention is to improve the economy in an electronic dictionary. To solve these objects the present invention provides an electronic dictionary as specified in claim 1. Preferred embodiments of this dictionary are described in the subclaims. The foregoing and other objects, features, aspects and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is shows a structure of a file of an electronic dictionary according to a first embodiment of the present invention. Fig. 2 shows a structure of a file of an electronic dictionary according to a second embodiment of the present invention. Fig. 3 shows a structure of a file of an electronic dictionary according to a third embodiment of the present invention. Fig. 4 shows a structure of an index file for describing a two stage index method according to a fourth embodiment of the present invention for increasing the speed of retrieving a heading file and the like of the first embodiment. Fig. 5 is a block diagram showing a structure of a conventional electronic translator. DESCRIPTION OF THE PREFERRED EMBODIMENTS Fig. 1 shows the contents of an electronic dictionary file according to a first embodiment of the present invention, wherein a portion of the internal structure of the electronic dictionary 37 of Fig. 5 shown as a conventional example are indicated. The structure of the electronic translator itself is identical to the contents shown in the conventional example. Although the present embodiment has the heading of the electronic dictionary in English with part of speech of the heading, the changing pattern information, the meaning information, a translated word, the part of speech and inflection of a translated word, priority of the translated word and the like stored in the word information file which will be described later, the present invention can similarly be applied for terms in which the heading is in a language other than English. A heading file 1 has an English heading in alphabetical order. In the drawing, English words of "pour" to "practical" are typically indicated. The method of storage may be in fixed length or variable length. In a pointer storage portion 2b of a pointer file 2, a pointer (an address value from the beginning of a word information file) of the word information file is stored corresponding to a heading in the order of the headings stored in the heading file. For example, pointer values of (A) and (B) are stored for the words of "pour" and "power", respectively, stored in the heading file, wherein each pointer value indicates the position where the word information corresponding to each word in the word information file is stored. In the case the user wants to inspect the word "powder", the translation processing apparatus 31 searches the heading file from the beginning to store the order of the heading of "powder" into the memory device 33 when "powder" has been found. Assuming that the heading of "powder" is the 30000th heading from the beginning, the translation processing apparatus 31 then looks into the 30000th record in the pointer file 2. Because the pointer file 2 is a fixed length file including a correction flag storage portion 2a and a pointer storage portion 2b, the 30000th address position can be promptly obtained by calculation. Upon finding a record in the pointer file 2 corresponding to the 30000th word of "powder", it is acknowledged that correction is not carried out because "0" is stored in the correction flag storage portion 2a. That is to say, if correction is carried out, "1" is entered in the correction flag storage portion 2a. If the correction flag is "0", the heading address of an area corresponding to a word information file 3 storing inherent word information is stored in the pointer storage portion 2b. The address value is (B) in the case of "powder". Therefore, the English part of speech, the changing pattern information, the meaning information, a translated term, the part of speech and inflection of the translated term, the priority of a translated term with respect to "powder" can be obtained from the word information file 3. Similarly, "power" is the 30001th word with "1" in the correction flag storage portion 2a of the pointer file 2, indicating that the word information has been corrected. In this case, the pointer value (C') in the pointer storage portion 2b indicates the address pointer to the word information correction file 4. A storage portion 4a for the original pointer exists at the head of the area beginning by the address value (C') of the word information correction file 4. In the storage portion 4a, an address value (C) of the word information file 3 prior to correction with respect to "power" is stored, which changes the correction flag storage portion 2a of the pointer file 2 to "0" in the case of cancelling the correction afterwards, facilitating the correction by rewriting the value in the pointer storage portion to (C). In the area of the correction information storage portion 4b succeeding the original pointer storage portion 4a, word information after correction with respect to "power" is stored. Thus, word information not corrected can be derived from the word information file 3, and word information that is corrected can be derived from the word information correction file 4. When the word information file 3 is to be corrected, a relevant word information is copied from the word information file by a general method, whereby the original pointer and the contents correcting that copy are added to the tail of the word information correction file 4. Then the correction flag storage portion 2a in the relevant pointer file 2 is modified to a corrected state of "1", whereby the head address value of the portion added to the word information correction file 4 is entered into the pointer storage portion 2b. When word information that is already corrected is to be corrected again, the original pointer stored in the word information correction file 4 and the re-corrected contents are further added to the tail of the word information correction file 4, whereby the address value of the portion re-corrected and added is entered into the pointer storage portion 2b of the relevant pointer file 2. Regardless of how many times re-correction is repeated, the original pointer to the original word information file 3 is always stored in the original pointer storage portion of the last corrected and added portion. Therefore, in the case of cancelling a correction, the original pointer of the last corrected data in the word information correction file 4 indicated by the pointer stored in the pointer storage portion 2b of the pointer file 2 corresponding to the relevant heading is restored to the corresponding pointer storage portion of the pointer file 2, and the correction flag storage portion 2a is changed to the not-corrected state of "0", so that the original information of the word information file 3 can be used just by one cancel operation. If a repetitively corrected word of the same word is to be restored to each prior corrected state one by one, a flag storage portion indicating whether the pointer is towards the word information file 3 or towards the word information correction file 4 can be included in the original pointer portion of the word information correction file 4. Fig. 2 is a diagram showing a structure of the contents of an electronic dictionary file for describing a second embodiment of the present invention, indicating that the word information can be corrected individually among a plurality of users by holding a plurality of pointer files and word information correction files. Referring to Fig. 2, the pointer file 5 and the word information correction file 7 are files for a user A, the pointer file 6 and the word information correction file 8 are files for a user B, and the heading file 1 and the word information file 3 can be commonly shared by users A and B. When used by the user A, the word information file 3 and the word information correction file 7 exclusively for the user A are referred to when the correction flag storage portion 5a is "0" and "1", respectively, from the heading file 1 via the pointer file 5. When used by the user B, the word information file 3 or the word information correction file 8 exclusively for the user B is referred to from the heading file 1 via the pointer file 6. The correction and cancel operation of information is identical to the case of one user described in the embodiment of Fig. 1. Fig. 3 shows the contents of an electronic dictionary file according to a third embodiment of the present invention. In comparison with the above-described second embodiment in which the capacity of the pointer file is increased if each user owns a pointer file in the case of many users, the present embodiment shows a method of saving the file capacity by providing a pointer administration file. When retrieval of the heading file is specified, the translation processing system searches the heading file 1 according to the aforementioned method to identify the order of the heading. Accordingly, a relevant record in the pointer file 9 is referred to. This is identical to the case of a single user of the first embodiment shown in Fig. 1. The correction flag storage portion 9a of the pointer file 9 stores whether the relevant word is corrected or not, by using a flag of "0" when there is no correction. In this case, a pointer value towards the word information file 3, for example a pointer value of (A) for "pour", is stored in the pointer portion 9b. If correction of a word is carried out, the correction storage portion 9a shows "1", whereby pointer values of (B') and (C') for "powder" and "power", respectively, towards the correction pointer administration file 10, are stored in the pointer storage portion 9b. The correction pointer administration file 10 has a block of a correction pointer block 15 provided for one heading having the word information corrected, wherein each block includes "the number of users +1" records. For example, if there are ten users, eleven records will be needed. In the drawing, the contents of records (0 to n) are shown with n users. The head record (record 0) of the correction pointer block 15 serves to store a pointer value towards the original word information file 3, and records 1 to n are for user A, user B, ..., respectively,. Each record in the correction pointer block 15 includes a correction flag storage portion 10a and a pointer storage portion 10b. A correction flag of "0" indicates that the relevant user has not carried out correction of the word information with respect to the relevant heading, whereby the word information file 3 is referred to by the pointer value stored in the pointer storage portion of the head record (record 0). A correction flag of "1" indicates that the relevant user has carried out correction of the word information with respect to the relevant heading, whereby the word information correction file 11 or the word information correction file 12 corresponding to the relevant user is referred to by the pointer value stored in the pointer storage portion of the relevant record. A case where the user A checks "powder" in the example of Fig. 3 will be described. In this case, the record 1 of the correction pointer block starting from the address (B') of the correction pointer administration file 10 is referred to via the pointer file 9. Because the correction flag is "0", the word information regarding "powder" stored in the word information file 3 can be obtained by the address pointer value (B) stored in the pointer storage portion of the head record (record 0) of that block. A case is described where the user B attempts to check the same heading of "powder". In this case, the record 2 of the correction pointer block 15 beginning at the address (B') of the correction pointer administration file 10 via the pointer file 9 is referred to. Because the correction flag is "1", the corrected word information regarding "powder" stored in the word information correction file 12 for the user B can be obtained by the address pointer (B") stored in the pointer storage portion 10b of the same record. If the search from the beginning of the heading file 1 in the aforementioned first embodiment and the like is time consuming, a two-stage index can be used according to the fourth embodiment of the present invention shown in Fig. 4 to increase the speed of retrieval. In Fig. 4, a one character index file 13 includes a pointer storage portion 13b storing the head address of a secondary index beginning from a character for each character of alphabets a-z, and a total number storage portion 13a of total wording number of words of Na, Nb, Nc, each of which is included in each alphabet character. For example, in the record total number storage portion 13a corresponding to "p", for example, the total number of words starting from characters "a" to "o" is stored (29779), and the head address value (Ip) beginning from "p" in the secondary index 14 is stored in the pointer storage portion 13b. In the secondary index file 14, several characters of the beginning word of each block which is sectioned by every tens of headings of the heading file 1 is stored in an index storage portion 14a, the number of words stored in each block is stored in the number portion 14b, and the head address of the block of the heading file corresponding to each index is stored in the pointer storage portion 14c. For example, in searching "powder", a record corresponding to the head alphabet "p" is found from the one character index file 13. Because a fixed length memory is used for the one character index file, the address of the record corresponding to "p" can be obtained by calculation by making the alphabet character correspond to the ASCII code. Calculating the corresponding record, a total number of 29779, and a pointer value of (Ip) can be obtained. By this pointer value, the head record (the index of "pace") beginning by "p" in the secondary index 14 can be directly found. By carrying out a search in ascending order from this point in this index storage portion 14a to arrive at "pre", it can be identified that "powder" is included in the index block of "pour". At this time, the number in each number portion from "pace" to "poach" is sequentially added to the aforementioned 29779. That is to say by the following equation of: 29779 + 50 + 40 + 60 + 70 = 29999 the value of 29999 is obtained. The address value (Mpour) of the heading file 1 of the word beginning from "pour" can be derived from the pointer storage portion 14c of the secondary index file. The "pour" in the heading file 1 can be directly found by this address value. By continuing the search in ascending order in the heading file 1, "powder" can be found, where the scanned number of heading of 1 from "pour" up to "powder" is added to the aforementioned 29999. The "powder" can be identified as the 30000th heading from the beginning of the heading file. By using such a two-stage index of the fourth embodiment, the retrieval of the heading file 1, and detection of the order of the word from the beginning of the heading file 1 can be carried out at high speed. A method of using such a two-stage index is well known. It is also well known to establish a differential structure with the prior word in the heading file to save the capacity of the heading index. Although the present invention may be applied to a translation dictionary for a mechanical translation system in the above described embodiments, the present invention is not limited to this and may be applied to a kana-kanji conversion dictionary and to an electronic dictionary of electronic translators. As described in the above embodiments, by implementing only the pointer file and the word information correction file with a rewritable memory device of the files forming a dictionary system, it is possible to use an economical memory device exclusively for reading for heading files and word information files requiring a large capacity, whereby the user can implement a correctable dictionary system without requiring a rewritable memory device of a great capacity. Because the heading file and the word information file are not rewritten by the user, there is no possibility of the entire dictionary system being destroyed even if a user carries out an abnormal correction. Even if a user carries out an erroneous correction, the correction can be cancelled to restore the contents back to the original dictionary. As described in the fourth embodiment, the retrieval of the heading word can be carried out at a high speed regardless of whether the word information is corrected or not. By increasing a relatively small amount of file such as the pointer file and the word information correction file or the correction pointer administration file, a plurality of users can carry out correction individually for each user. When the word information for the same heading is carried out many times, the correction can be cancelled just by one operation to be restored to the original information, or to be restored to a prior corrected information one by one. In the case of obtaining a backup of the corrected information, a backup of the entire dictionary system is not necessary, and only the backup of the file implementing the rewritable memory device, i.e. only the pointer file, the word information correction file, and the correction pointer administration file are required. Although the present invention has been described and illustrated in detail, it is clearly understood that the same is by way of illustration and example only and is not to be taken by way of limitation, the scope of the present invention being limited only by the terms of the appended claims.

Claims: An electronic dictionary comprising: storage means (1) for storing at least one word arranged in an alphabetic order relative to other words, in said storage means (1), first word information storage means (3) for storing word information corresponding to said word, second word information storage means (4) for storing corrected word information which is corrected with respect to said stored word information, indicating means (2a) for indicating whether the word information is corrected or not with respect to said stored word, and pointer means (2b) responsive to an output of said indicating means (2a) for selecting one of said first and second word information storage means (3, 4) dependent upon a fact that the word information has been corrected or not. The electronic dictionary according to claim 1, wherein: there are a plurality of said indicating means (5a, 6a) and a plurality of said second word information storage means (7, 8), the number of said indicating means (5a, 6a) being equal to the number of said second word information storage means (7, 8), and, said pointer means (5b, 6b) responds to an output indicating that word information is corrected in any of said indicating means (5a, 6a) for selecting one of said second word information storage means (7, 8) corresponding to a specific indicating means. The electronic dictionary according to claim 1, wherein said indicating means includes a correction flag storage portion (2a) corresponding to said word, a flag indicating whether the word information is correct or not, and said pointer means includes a pointer storage portion (2b) for storing a pointer indicating the address value of a corresponding word information stored in either of said first word information storage means (3) or said second word information storage means (4) to be selected dependent on the contents of said flag, said correction flag storage portion (2a) and said pointer storage portion (2b) forming a pointer file. The electronic dictionary according to claim 3, wherein an address value of said second word information storage means (4) is stored in a corresponding pointer storage portion (2b) when said flag indicates that the word information is corrected, and wherein the address value of said first word information storage means (3) is stored in a corresponding pointer storage portion when said flag indicates that the word information is not corrected. The electronic dictionary according to claim 1, wherein said storage means (1) and said first word information storage means (3) are implemented with a memory device exclusively for reading, and said second word information storage means (4) and said indicating means (2a) are implemented with a rewritable memory device. The electronic dictionary according to claim 1, wherein: said storage means (1) stores a plurality of words arranged in alphabetic order, a plurality of said second word information storage means (4), each store corrected word information with respect to said stored word information, and said indicating means (2a) indicates whether the word information is corrected or not corresponding to each of said second word information storage means (4) for each of said stored words. The electronic dictionary according to claim 6, wherein said indicating means and said pointer means comprise a pointer file (9) and a correction pointer administration file (10) formed of a plurality of blocks equivalent in number to the number of said words and wherein said pointer file (9) comprises a first correction flag storage portion (9a) provided dependent on said words for storing a flag indicating whether or not the word information is corrected or not, and a pointer storage portion (9b) for storing an address value of said first word information storage means (3) to be selected dependent on the contents of said flag or block information specifying a certain block of said correction pointer administration file (10). The electronic dictionary according to claim 7, wherein each of the blocks of said correction pointer administration file (10) has records equivalent in number to the number of said second word information storage means (4), wherein each of said records stored a flag indicating whether the respective word information is corrected or not, and a pointer indicating the address value of a respective word information stored in either of said first word information storage means (3) or said second word information storage means (4) to be selected dependent on the contents of the flag. The electronic dictionary according to claim 8, wherein each of said second word information storage means (4) and each of said correction pointer administration file records correspond to each of a plurality of users. The electronic dictionary according to claim 9, wherein each of said blocks further include an additional record, in which the address value of said first word information storage means (3) stored in a corresponding word information is stored.

Inventors: FUKUMOCHI YOJI, HIRAI TOKUYUKI, KUGIMIYA SHUZO, KUTSUMI TAKESHI, SATA ICHIKO, SUZUKI HITOSHI, FUKUMOCHI, YOJI, HIRAI, TOKUYUKI, KUGIMIYA, SHUZO, KUTSUMI, TAKESHI, SATA, ICHIKO, SUZUKI, HITOSHI
Applicants: SHARP KK, SHARP KABUSHIKI KAISHA
Application year: 1992
Main classification: G06F17
IPC codes: G06F17, G06F12