Document data processing method and apparatus for document retrieval

Claim 2

A document data processing method for document retrieval according to claim 1, wherein said component character table (105) registers without duplication all the characters as used on a document basis.

Claim 3

A document data processing method for document retrieval according to claim 2, wherein said component character table (105) is created by mapping the character codes to a number of entry codes of said table which is smaller than a number of the characters used actually by using a hash function.

Claim 4

A document data processing method for document retrieval according to claim 1, wherein in association with said component character table search, a bit list (701; 702) in which one-bit information are allocated to all usable characters is prepared for each of said documents and wherein bit positions for the characters used in the documents are set to "1s", respectively, while the bit positions for the characters not used in the documents are set to "0s", respectively; said component character table search (8000) is executed by searching such a bit list having all the bit positions set to "1s" for all the characters constituting said search term.

Claim 5

A document data processing method for document retrieval for document retrieval according to claim 4, wherein by mapping the character codes to a number of entry codes which is smaller than the number of the characters actually used, said bit list (701; 702) is realized by a number of bits which is smaller than a number of the character types actually used.

Claim 6

A document data processing method for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration (201) of documents in said document database, creating condensed texts (104) by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include katakana character string, hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated (202); creating a component character table (105) in which characters occurring in original texts are registered without duplication (203); and registering in said document database said condensed texts (104) together with said component character table (105) in addition to the texts (103) of the document to be registered; and upon retrieval of the document containing the designated search term, executing first a component character table search (204; 8000) for thereby extracting those documents which contain all species of characters constituting the search term designated by the operator by consulting said component character table (105); executing subsequently a condensed text search (205; 8030) by consulting the condensed texts (104) of the documents extracted through said component character table search (8000) for extracting only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term designated by the operator to thereby select the documents containing the designated search term; and executing finally a text body search (206; 8060) for extracting a document which satisfies query condition imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted through said component character table search (8000) and said condensed text search (8030), to thereby realize a full text retrieval at an equivalently increased speed.

Claim 7

A document data processing method for document retrieval according to claim 6, wherein said component character table (105) registers without duplication all the characters as used on a document basis.

Claim 8

A document data processing method for document retrieval according to claim 7, wherein said component character table (105) is created by mapping the character codes to a number of entry codes of said table which is smaller than a number of the characters used actually by using a hash function.

Claim 9

A document data processing method for document retrieval according to claim 5, wherein in association with said component character table search (8000), a bit list (701; 702) in which one-bit information are allocated to all usable characters is prepared for each of said documents and wherein bit positions for the characters used in the documents are set to "1s", respectively, while the bit positions for the characters not used in the documents are set to "0s", respectively; said component character table search (8000) is executed by searching such a bit list having all the bit positions set to "1s" for all the characters constituting said search term.

Claim 10

A document data processing method for document retrieval according to claim 9, wherein by mapping the character codes to a number of entry codes which is smaller than the number of the characters actually used, said bit list is realized by a number of bits which is smaller than a number of the characters actually used.

Claim 11

A document data processing method for retrieving a document containing all of plural search terms designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration (201) of documents in said document database, creating condensed texts (104) by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include katakana character string, hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; creating a component character table (105) in which characters occurring in original texts are registered without duplication; and registering in said document database said condensed texts (104) together with said component character table (105) in addition to the texts (103) of the document to be registered; and upon retrieval (207) of the document containing the designated search term, executing first a component character table search (8000) for thereby extracting those documents which contain all species of characters constituting each of said search terms designated by the operator by consulting said component character table; executing subsequently a condensed text search (8030) by consulting the condensed texts of the documents extracted through said component character table search for extracting only the documents corresponding to the condensed texts which contain all the fragmental character strings constituting each of said search terms designated by the operator to thereby select the documents containing the designated search terms; and executing finally a text body search (3040) for extracting a document which satisfies query condition imposed on said search terms such as positional relation thereof in the text by consulting the texts of the documents extracted through said component character table search and said condensed text search, to thereby realize a full text retrieval at an equivalently increased speed.

Claim 12

A document data processing method for retrieving a document containing any one of search terms designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration (201) of documents in said document database, creating condensed texts (104) by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include katakana character string, hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; creating a component character table (105) in which characters occurring in original texts are registered without duplication; and registering in said document database said condensed texts (104) together with said component character table (105) in addition to the texts (103) of the document to be registered; and upon retrieval (207) of the document containing the designated search term, executing first a component character table search (8000) for thereby extracting those documents which contain all species of characters constituting any one of said search terms designated by the operator by consulting said component character table (105); executing subsequently a condensed text search (8030) by consulting the condensed texts of the documents extracted through said component character table search (8000) for extracting only the documents corresponding to the condensed texts which contain all the fragmental character strings constituting any one of said search terms designated by the operator to thereby select the documents containing the designated search terms; and executing finally a text body search (8060) for extracting a document which satisfies query condition (8050) imposed on said search terms such as positional relation thereof in the text by consulting the texts of the documents extracted through said component character table search and said condensed text search, to thereby realize a full text retrieval at an equivalently increased speed.

Claim 13

A document data processing method for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration of documents in said document database, creating condensed texts (104) by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include katakana character string, hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, while checking said hiragana character string by consulting a basic word dictionary (Fig. 21) and conjunction rules (Fig. 22) as to whether said hiragana character string represents a succession of subsidiary words having semantically no meaning as the search term, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string and any hiragana character string found to be a succession of the semantically meaningless subsidiary words are excluded; creating a component character table (105) in which characters occurring in original texts are registered without duplication; and registering in said document database (110) said condensed texts (104) together with said component character table (105) in addition to the texts (103) of the document to be registered; and upon retrieval (207) of the document containing the designated search term, executing first a component character table search (8000) for thereby extracting those documents which contain all species of characters constituting the search term designated by the operator by consulting said component character table (105); executing subsequently a condensed text search (8030) by consulting the condensed texts (104) of the documents extracted through said component character table search (8000) for extracting only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term unless said fragmental character strings have been determined to be a succession of semantically meaningless words as the search term after the check of said fragmental character strings by using the basic word dictionary (Fig. 20) and the conjunction rules (Fig. 21); and executing finally a text body search (8060) for extracting a document which satisfies query condition (8050) imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted through said component character table search and said condensed text search while consulting the original texts of the documents extracted through said component character table search when any one of said fragmental character strings has been determined to be a succession of the semantically meaningless words, for thereby extracting a document which contains each of the fragmental character strings and which satisfies the retrieval condition imposed on the search term concerning the positional relation thereof, whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 14

A document data processing method for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration (201) of documents in said document database, creating condensed texts (104) by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, after having eliminated all the hiragana character strings, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is excluded; creating a component character table (105) in which characters occurring in original texts are registered without duplication; and registering in said document database (110) a plurality of said condensed texts (104) corresponding to said character species, respectively, together with said component character table (105) in addition to the texts (103) of the documents to be registered; and upon retrieval (Fig. 8) of the document containing the designated search term, executing first a component character table search (8000) for thereby extracting those documents which contain all species of characters constituting the search term designated by the operator by consulting said component character table (105); executing subsequently a condensed text search (8030) by consulting the condensed texts (104) of the documents extracted through said component character table search (8000) for extracting only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term designated by the operator provided that said fragmental character strings constituting the search term designated by the operator has been determined as including none of the hiragana character strings as a result of corresponding decision step; and executing finally a text body search (8060) for extracting a document which satisfies query condition (8050) imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted or alternatively for extracting a document containing the designated fragmental character strings and satisfying said query condition by consulting the original text of the document extracted through said component character table search; whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 15

A document data processing method for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration of documents in said document database, creating condensed texts (104) by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include katakana character string, hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create a plurality of condensed texts separately on a character species basis, each of said condensed texts being constituted by the fragmental character strings of a same character species while excluding any character string found to be included by other character string; creating a component character table (105) describing the species of the characters occurring in original texts; registering in said document database said plurality of character-species based condensed texts (Fig. 4) together with said component character table in addition to the text of the document to be registered; and upon retrieval of the document containing the designated search term, executing first a component character table search (8000) for thereby extracting those documents which contain all the species of characters constituting the search term designated by the operator by consulting said component character table (105); executing subsequently a condensed text search (8030) by consulting the condensed text corresponding to the character species of the fragmental character strings constituting the search term designated by the operator in the documents extracted through said component character table search (8000) for extracting only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term designated by the operator to thereby select the documents containing the designated search term; and executing finally a text body search (8060) for extracting a document which satisfies query condition (8050) imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted through said component character table search and said condensed text search, whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 16

A document data processing method for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration of documents in said document database, creating condensed texts (104) by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include katakana character string, hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; creating a component character table (105) in which characters occurring in each of said condensed texts are registered without duplication; and registering in said document database (110) said condensed texts (104) together with said component character table (105) in addition to the text of the document to be registered; and upon retrieval of the document containing the designated search term, executing first a component character table search (800) for thereby extracting those documents which contain all species of characters constituting the search term designated by the operator by consulting said component character table; and executing subsequently a condensed table search (8030) by consulting the condensed texts of the documents extracted through said component character table search for thereby extracting only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term designated by the operator to thereby extract the documents containing the designated search term; whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 17

A document data processing method for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration of documents in said document database, creating a component character table (105) in which characters occurring in texts are registered without duplication; and registering in said document database said component character table (105) in addition to the texts (103) of the documents to be registered; and upon retrieval of the document containing the designated search term, executing first a component character table search (8000) for thereby extracting those documents which contain all species of characters constituting the search term designated by the operator by consulting said component character table; and executing subsequently a text body search (8060) by consulting the texts of the documents extracted through said component character table search for thereby extracting only the document which contains the designated search term and which satisfies query condition (8050) imposed on the search term such as positional relation thereof in the text, whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 18

A document data processing method for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration of documents in said document database, creating condensed texts (104) by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include katakana character string, hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; and registering in said document database (110) said condensed texts (104) in addition to the texts (103) of the documents to be registered; and upon retrieval of the document containing the designated search term, executing a condensed text search (8030) by consulting the condensed texts of the documents for extracting only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term designated by the operator to thereby select the documents containing the designated search term; and executing a text body search (8060) for extracting a document which satisfies query condition (8050) imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted through said condensed text search, whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 19

A document data processing system for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising: for registration of documents in said document database (110), means (202; 102) for creating condensed texts by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts (104) each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; means (203; 102) for creating a component character table in which characters occurring in each of said condensed texts are registered without duplication; and means (201; 202; 203; 102) for registering in said document database (110) said condensed texts together with said component character table in addition to the texts of the documents to be registered; and for document retrieval, component character table search means (207; 204; 102) for extracting those documents which contain all species of characters constituting the search term designated by the operator by consulting said component character table; condensed text search means (205; 207; 102) for extracting only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term designated by the operator by consulting the condensed texts of the documents extracted through the component character table search; and text body search means (206; 207; 102) for extracting a document which satisfies query condition imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted, to thereby realize a full text retrieval at an equivalently increased speed.

Claim 20

A document data processing system for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising: for registration of documents in said document database (110), means (202; 102) for creating condensed texts by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; means (203; 102) for creating a component character table in which characters occuring in each of said condensed texts are registered without duplication; means (201; 202; 203) for registering in said document database (110) said condensed texts (104) together with said component character table (105) in addition to the texts (103) of the documents to be registered; and means for storing the condensed text data in a RAM disk (3010b) while storing the component character table in a semiconductor memory (3010a); and for document retrieval, component character table search means (204; 102) for extracting those documents which contain all species of characters constituting the search term designated by the operator by consulting said component character table; condensed text search means (205; 102) for extracting only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term designated by the operator by consulting the condensed texts of the documents extracted through the component character table search; and text body search means (206; 102) for extracting a document which satisfies query condition (3041; 3042; 3043; 3044) imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted, to thereby realize a full text retrieval at an equivalently increased speed.

Claim 21

A document data processing system for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising: for registration of documents in said document database, means (202; 102) for creating condensed texts by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts (104) each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; means (203; 102) for creating a component character table (105) in which characters occurring in each of said condensed texts are registered without duplication; and means (201; 202; 203) for registering in said document database (110) said condensed texts (104) together with said component character table (105) in addition to the texts (103) of the documents to be registered and storing the text data and the condensed text data in a magnetic disk (3010c) while storing said component character table in a semiconductor memory (3010a); and for document retrieval, component character table search means (204; 102; 8000) for extracting those documents which contain all species of characters constituting the search term designated by the operator by consulting said component character table (105); means (8010) for checking the number of the documents extracted through the component character table search; condensed text search means (205; 8030) for reading out all of said condensed texts by neglecting the result of the component character table search, when said number of said extracted documents has attained a predetermined number, to thereby extract only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term designated by the operator, while consulting the condensed texts of the documents extracted through said component character table search to thereby extract only the documents corresponding to the condensed text containing the fragmental character strings which constitute the search term designated by the operator, when said number of said extracted documents is smaller than said predetermined number; and text body search means (206; 102; 8060) for extracting a document which satisfies query condition (8050) imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted, to thereby realize a full text retrieval at an equivalently increased speed.

Claim 22

A document data processing system for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising: for registration of documents in said document database, means (201; 102) for creating condensed texts (104) by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species which strings can include hiragana character string, kanji character string, alphabetic character string, numeric character string, symbol character string and others and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; means (203; 102) for creating a component character table (105) in which characters occurring in each of said condensed texts are registered without duplication; and means (201; 202; 203) for registering in said document database (110) said condensed texts (104) together with said component character table (105) in addition to the texts (103) of the documents to be registered and storing the text data and the condensed text data in a magnetic disk (3010c) while storing said component character table in a semiconductor memory (3010a); and for document retrieval, component character table search means (204; 102) for extracting those documents which contain all species of characters constituting the search term designated by the operator by consulting said component character table; means (8010) for checking the number of the documents extracted through the component character table search; condensed text search means (205; 102) for reading out all of said condensed texts by neglecting the result of the component character table search only when said number of said extracted documents has attained a predetermined number, to thereby extract only the documents corresponding to the condensed texts which contain the fragmental character strings constituting the search term designated by the operator; and text body search means (206; 102) for extracting a document which satisfies query condition imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted, while consulting the condensed texts of the documents extracted through said component character table search to thereby extract only the document corresponding to the condensed text containing the fragmental character strings which constitute the search term designated by the operator, when said number of said extracted documents is smaller than said predetermined number, to thereby realize a full text retrieval at an equivalently increased speed.

Claim 23

A document data processing method for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration of documents in said document database (3710), creating condensed texts (3704) by decomposing each of textual character strings of the documents to be registered into fragmental character strings on the basis of at least one of character species including hiragana character, katakana character, kanji character, alphabetic character, numeric character and other character species and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; creating a concatenated component character table (3705) by preparing, for each of the documents, information of all usable character strings each composed of at least two characters, said information including first information indicating those character strings which are used in the document to be registered and second information indicating those character strings unused in the document to be registered; and registering in said document database said condensed texts (3704) together with said concatenated component character table (3705) in addition to the texts (3703) of the document to be registered; and upon retrieval of the document containing the designated search term, executing a component character table search (3804) for extracting all the documents in which all the character strings contained in the search term designated by the operator and each composed of at least two characters are used, by consulting said concatenated component character table (3705); executing a condensed text search (3805) by consulting the condensed texts corresponding to the documents extracted through said component character table search for thereby extracting only the documents which contain the fragmental character strings constituting the search term designated by the operator; and executing finally a text body search (3802) for extracting a document from the documents selected through said condensed text search which document satisfies query condition imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted through said concatenated component character table search (3804) and said condensed text search (3807), whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 24

A document data processing method for document retrieval according to claim 23, wherein in association with said concatenated component character table (3705), a bit list (1200; 1201) in which one-bit information are allocated to all usable character strings each composed of at least two characters, respectively, is prepared for each of said documents and wherein bit positions in said bit list for the character strings used in the documents are set to "1s", respectively, while the bit positions for the character strings not used in the documents are set to "0s", respectively.

Claim 25

A document data processing method for document retrieval according to claim 24, wherein said concatenated component character table (3705) is prepared on the basis of the individual character strings each constituted by a predetermined number n (where n is an integer greater than or equal to 2) of characters for each of character species including hiragana character, katakana character, kanji character, numeric character, symbol character and other character species.

Claim 26

A document data processing method for document retrieval according to claim 24, wherein said concatenated component character table (3704) is prepared by mapping sets of character codes to the bit list having a number of entries which is smaller than the number of combinations of the characters used actually by using a hash function.

Claim 27

A document data processing method for document retrieval according to claim 26, wherein each of the character strings used actually is decomposed on the basis of at least one of the character species including hiragana character, katakana character, kanji character, alphabetic character, numeric character, symbol and other species, and wherein said concatenated component character table is prepared by mapping sets of character codes to the bit list having a number of entries which is smaller than the number of combinations of the characters used actually by using a hash function.

Claim 28

A document data processing method for document retrieval according to claim 26, wherein use frequencies at which the character strings are actually used are checked, and upon mapping the sets of character codes to the bit list having a number of bits smaller than the number of the character strings used actually by the hash function, the character strings of a lower use frequency are mapped to a same bit.

Claim 29

A document data processing method for document retrieval according to claim 26, wherein the character codes are mapped to a number of codes of entries which is smaller than that of the characters used actually by using said hash function, whereon sets of the hashed character codes are mapped to the bit list having a number of entries smaller than the number of the actually used character strings by using another hash function.

Claim 30

A document data processing method for document retrieval according to claim 24, said concatenated component character table being prepared on the basis of the character strings each composed of n characters, wherein in the step of the concatenated component character table search, the document containing all the character strings each composed of n characters and contained without duplication in the search term designated by the operator is extracted by searching the bit list having the relevant bit positions all set to "1".

Claim 31

A document data processing method for document retrieval according to claim 24, said concatenated component character table being prepared on the basis of the character strings each composed of n characters, wherein in the step of the concatenated component character table search, the document containing all the character strings each composed of n characters and contained in duplication in the search term designated by the operator is extracted by searching the bit list having the relevant bit positions all set to "1".

Claim 32

A document data processing method for document retrieval according to claim 24, said concatenated component character table being constituted by character strings each composed of a given number of characters in a range of one to n , wherein when the search term designated by the operator is composed of a number of characters which is smaller than n , the result of said concatenated component character table search is outputted as the final result of the document retrieval, whereupon the search processing is ended.

Claim 33

A document data processing method for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising steps of: upon registration of documents in said document database, creating condensed texts (3704) by decomposing each of textual character strings of the documents to be registered into fragmental character strings on the basis of at least one of character species including hiragana character, katakana character, kanji character, alphabetic character, numeric character and other character species and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; creating a single component character table and a concatenated component character table (3705) by preparing, for each of the documents, information of all usable single characters and character strings each composed of at least two characters, said information including first information indicating those single-character and character strings which are used in the document to be registered and second information indicating those single-character and character strings unused in the document to be registered, respectively; and registering in said document database (3710) said condensed texts together with said concatenated component character table (3705) in addition to the texts (4704) of the document to be registered; and upon retrieval of the document containing the designated search term, executing a component character table search (3804) for extracting all the documents in which all the character strings contained in the search term designated by the operator and each composed of at least two characters are used, by consulting said concatenated component character table; executing a condensed text search (3805) by consulting the condensed texts corresponding to the documents extracted through said component character table search for thereby extracting only the documents which contain the fragmental character strings constituting the search term designated by the operator; and executing finally a text body search (3806) for extracting a document from the documents selected through said condensed text search which document satisfies query condition imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted through said concatenated component character table search and said condensed text search, whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 34

A document data processing method for document retrieval according to claim 33, wherein in association with said concatenated component character table, a bit list (1200; 1201) in which one-bit information are allocated to all usable character strings each composed of at least two characters, respectively, is prepared for each of said documents and wherein bit positions in said bit list for the character strings used in the documents are set to "1s", respectively, while the bit positions for the character strings not used in the documents are set to "0s", respectively.

Claim 35

A text data creating method for creating a text database for storing document information as character code data, comprising steps of: (1) fetching text data; (2) determining frequencies at which individual character strings each constituted by a predetermined number n of characters are used in the text data and rearraying said character strings in a sequential order in dependence on said frequencies; (3) establishing correspondences between said character strings and a number of entries which is smaller than the number of said character strings and storing said correspondences in the form of a hash table; and (4) storing at the entry corresponding to the character strings used in said text data said character strings in the form of a component character table.

Claim 36

A full text retrieval method for retrieving a document containing a search term designated by an operator from a text data database registering therein document information as character code data while referring to textual content of said document, comprising steps of: (1) fetching text data; (2) determining frequencies at which individual character strings each constituted by a predetermined number n of characters are used in the text data and rearraying said character strings in a sequential order in dependence on said frequencies; (3) establishing correspondences between said character strings and a number of entries which is smaller than the number of said character strings and storing said correspondences in the form of a hash table; (4) storing at the entry corresponding to the character strings used in said text data said character strings in the form of a component character table; (5) decomposing the search term designated by the operator into fragmental character strings each composed of n characters; (6) extracting from said component character table those entries which correspond to said fragmental character strings resulting from said decomposition; and (7) retrieving a document in which all the character strings constituting said search terms exist, by consulting the entries extracted from said component character table.

Claim 37

A document data processing system for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising: for registration of documents in said document database (3710), means (3801; 3702) for registering texts (3703) of documents to be registered; means (3802) for creating condensed texts (3704) by decomposing each of textual character strings of the documents to be registered into fragmental character strings on the basis of at least one of character species including hiragana character, katakana character, kanji character, alphabetic character, numeric character and other character species and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create and register the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; and means (3803) for creating a concatenated component character table (3705) by preparing, for each of the documents, information of all usable character strings each composed of at least two characters, said information including first information indicating those character strings which are used in the document to be registered and second information indicating those character strings unused in the document to be registered and registering said concatenated component character table in said database; and for retrieval of the document containing the designated search term, component character table search means (3804) for extracting all the documents in which all the character strings contained in the search term designated by the operator and each composed of at least two characters are used, by consulting said concatenated component character table; condensed text search means (3805) for executing a condensed text search by consulting the condensed texts (3704) corresponding to the documents extracted through said component character table search (3804) for thereby extracting only the documents which contain the fragmental character strings constituting the search term designated by the operator; and text body search means (3806) for executing a text body search for extracting a document from the documents selected through said condensed text search (3805) which document satisfies query condition imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted through said concatenated component character table search and said condensed text search, whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 38

A document data processing system for retrieving a document containing a search term designated by an operator from a document database registering therein document information in terms of character code data while referring to textual content of said document, comprising: for registration of documents in said document database, means (3801) for registering texts of documents to be registered; means (3802) for creating condensed texts by decomposing each of textual character strings of the documents to be registered into fragmental character strings on the basis of at least one of character species including hiragana character, katakana character, kanji character, alphabetic character, numeric character and other character species and checking mutual inclusion relations possibly existing among said fragmental character strings resulting from said decomposition, to thereby create and register the condensed texts each constituted by a set of the fragmental character strings in which any character string found to be included by other character string is eliminated; means for creating a hash table by checking frequencies at which said fragmental character strings are used, determining a hash function on the basis of the frequency information and mapping said fragmental character strings to a bit list having entries in a number smaller than that of combinations of actually used character; and means (3803) for creating a concatenated component character table (3705) by preparing, for each of the documents, information of all usable character strings each composed of at least two characters by consulting said hash table, said information including first information indicating those character strings which are used in the document to be registered and second information indicating those character strings unused in the document to be registered and registering said concatenated component character table in said database; and for retrieval of the document containing the designated search term, component character table search means (3804) for extracting all the documents in which all the character strings contained in the search term designated by the operator and each composed of at least two characters are used, by consulting said concatenated component character table; condensed text search means (3805) for executing a condensed text search by consulting the condensed texts corresponding to the documents extracted through said component character table search for thereby extracting only the documents which contain the fragmental character strings constituting the search term designated by the operator; and text body search means (3806) for executing a text body search for extracting a document from the documents selected through said condensed text search which document satisfies query condition imposed on the search term such as positional relation thereof in the text by consulting the texts of the documents extracted through said concatenated component character table search and said condensed text search, whereby a full text retrieval is carried out at an equivalently increased speed.

Claim 39

An index creating apparatus, comprising: means for fetching data for retrieval; counting means for determining frequencies at which characters contained in said data for retrieval are used; sorting means for rearraying said characters in the order of frequencies at which said characters are used; means for establishing correspondences between said characters and a number of bits, respectively, said bit number being smaller than that of said characters, means for converting character codes of said characters to the corresponding bits; and means for manipulating said bits on a bit-by-bit basis.

Claim 40

A document retrieval apparatus, comprising: input means for inputting a search search term; mean for extracting bit lists corresponding to character strings constituting said search term from a component character table; means for logically ANDing said bit lists; and means for transforming result of said ANDing operation into a document identifier affixed to a document.