公开(公告)号：US5051886A

公开(公告)日：1991-09-24

申请号：US205923

申请日：1988-06-13

申请人： Hisamitsu Kawaguchi ,  Kanji Kato ,  Hiromichi Fujisawa ,  Masaaki Fujinawa ,  Atsushi Hatakeyama

发明人： Hisamitsu Kawaguchi ,  Kanji Kato ,  Hiromichi Fujisawa ,  Masaaki Fujinawa ,  Atsushi Hatakeyama

IPC分类号： G06F17/21 ,  G06F17/30

CPC分类号： G06F17/30985 ,  Y10S707/917 ,  Y10S707/99936

摘要： A character stream search system using an FSA for determining at a time whether or not a plurality of character streams as search objects exist in a search character stream which undergoes a search operation and which comprises a plurality of characters expressed with codes. In the system, a collation is conducted between the search character stream and a search object character. In a case where there exists a matched search object character as a result of the collation, a state transition is carried out of a predetermined state indicated by the FSA. In a case where there does not exist a matched search object character, a failure processing to effect a state transition to a transistion destination which is determined in association with the configuration of the FSA. The following processing is completed at a count which is a predetermined upper-limit value for each character undergone the search operation.

摘要翻译： 一种使用FSA的字符流搜索系统，用于一次确定在经历搜索操作的搜索字符流中是否存在作为搜索对象的多个字符流，并且包括用代码表示的多个字符。 在系统中，在搜索字符流和搜索对象字符之间进行归类。 在作为对照的结果存在匹配的搜索对象字符的情况下，由FSA指示的预定状态执行状态转换。 在不存在匹配的搜索对象字符的情况下，执行与FSA的配置相关联地确定的转移目的地的状态转换的失败处理。 以对于每个经过搜索操作的字符的预定上限值的计数完成以下处理。

公开(公告)号：US5519857A

公开(公告)日：1996-05-21

申请号：US985795

申请日：1992-11-30

申请人： Kanji Kato ,  Hiromichi Fujisawa ,  Mitsuo Ooyama ,  Hisamitsu Kawaguchi ,  Atsushi Hatakeyama ,  Noriyuki Kaneoka ,  Mitsuru Akizawa ,  Masaaki Fujinawa ,  Hidefumi Masuzaki ,  Masaharu Murakami

发明人： Kanji Kato ,  Hiromichi Fujisawa ,  Mitsuo Ooyama ,  Hisamitsu Kawaguchi ,  Atsushi Hatakeyama ,  Noriyuki Kaneoka ,  Mitsuru Akizawa ,  Masaaki Fujinawa ,  Hidefumi Masuzaki ,  Masaharu Murakami

IPC分类号： G06F17/30 ,  G06K9/62 ,  G06K9/72

CPC分类号： G06F17/30675 ,  G06F17/30011 ,  G06F17/30982 ,  G06F17/30985 ,  G06K9/62 ,  G06K9/72 ,  G06K2209/01 ,  Y10S707/99932 ,  Y10S707/99935 ,  Y10S707/99936

摘要： A method and apparatus for performing a document information search to uncover specified text data containing a given search subject key word from a group of document text data stored in a memory. In the document information search method, two stages of presearch are carried out to perform the document search with respect to a desired subject key word. In a first stage of presearch, a character component table is generated in which the existence of character codes for every document is set forth with respect to all the character codes contained in the group of document text data of stored documents. The character component table is searched for all the character codes comprising a designated search subject key word to thereby extract all documents containing all the character codes comprising the search subject key word. Further, in the presearch step, all texts without the possibility of containing the search subject key word are eliminated. A comprehensive, narrowed text search is thereby performed in accordance with the search subject key word.

摘要翻译： 一种用于执行文档信息搜索以从存储在存储器中的一组文档文本数据中发现包含给定搜索主题关键字的指定文本数据的方法和装置。 在文档信息搜索方法中，进行两个阶段的预搜索以对所需的主题关键字执行文档搜索。 在预搜索的第一阶段，生成字符分量表，其中针对包含在所存储的文档的文档文本数据组中的所有字符代码设置每个文档的字符代码的存在。 搜索包括指定搜索主题关键字的所有字符代码的字符分量表，从而提取包含包括搜索对象关键字的所有字符代码的所有文档。 此外，在预览步骤中，消除了没有包含搜索主题关键字的可能性的所有文本。 由此，根据搜索主题关键词进行全面，狭窄的文本搜索。

公开(公告)号：US5168533A

公开(公告)日：1992-12-01

申请号：US555483

申请日：1990-08-09

申请人： Kanji Kato ,  Hiromichi Fujisawa ,  Mitsuo Ooyama ,  Hisamitsu Kawaguchi ,  Atsushi Hatakeyama ,  Noriyuki Kaneoka ,  Mitsuru Akizawa ,  Masaaki Fujinawa ,  Hidefumi Masuzaki ,  Masaharu Murakami

发明人： Kanji Kato ,  Hiromichi Fujisawa ,  Mitsuo Ooyama ,  Hisamitsu Kawaguchi ,  Atsushi Hatakeyama ,  Noriyuki Kaneoka ,  Mitsuru Akizawa ,  Masaaki Fujinawa ,  Hidefumi Masuzaki ,  Masaharu Murakami

IPC分类号： G06F17/30 ,  G06K9/62 ,  G06K9/72

CPC分类号： G06F17/30675 ,  G06F17/30011 ,  G06F17/30982 ,  G06F17/30985 ,  G06K9/62 ,  G06K9/72 ,  G06K2209/01 ,  Y10S707/99932 ,  Y10S707/99935 ,  Y10S707/99936

摘要： A method and apparatus for making document information search and a magnetic disk unit to be used for realizing the method and apparatus. In the document information search method, in performing document search with respect to a desired subject key word, two stages of presearch are carried out. In a first stage of presearch (step 402), a character component table (500) in which existence of character codes for every document is stated with respect to all the character codes contained in the group of document text data of stored documents is generated, and the character component table is searched for all the character codes constituting a desiredly designated search subject key word to thereby extract all the documents each containing all the character codes constituting the search subject key word. In a second stage of presearch step 403), contracted text data for every document in which adjuncts and duplication of repeatedly stated words contained in advance in the text data are eliminated is generated, and the documents each containing the search subject key words by word are extracted from the documents extracted by the first presearch. After the second stage of presearch, text search is performed in accordance with a neighbor condition, a contextual condition, or the like (step 404). Further, as a term comparator means, hardware (1106) for exclusive use for term comparison in accordance with a finite automation is employed. Further, as for different notation and synonym, inputted terms are once subject to different notation development in a different notation development processing portion (2601), each of the different-notation developed terms is subject to synonym development in a synonym development processing portion (2602) while referring to a synonym dictionary, and then the results of synonym development are further subject to different notation development in a different notation development processing portion (2603) in accordance with a conversion rule table (2603).

公开(公告)号：US6094647A

公开(公告)日：2000-07-25

申请号：US839407

申请日：1997-04-11

申请人： Kanji Kato ,  Hiromichi Fujisawa ,  Mitsuo Ooyama ,  Hisamitsu Kawaguchi ,  Atsushi Hatakeyama ,  Noriyuki Kaneoka ,  Mitsuru Akizawa ,  Masaaki Fujinawa ,  Hidefumi Masuzaki ,  Masaharu Murakami

发明人： Kanji Kato ,  Hiromichi Fujisawa ,  Mitsuo Ooyama ,  Hisamitsu Kawaguchi ,  Atsushi Hatakeyama ,  Noriyuki Kaneoka ,  Mitsuru Akizawa ,  Masaaki Fujinawa ,  Hidefumi Masuzaki ,  Masaharu Murakami

IPC分类号： G06F17/30 ,  G06K9/62 ,  G06K9/72

CPC分类号： G06F17/30675 ,  G06F17/30011 ,  G06F17/30982 ,  G06F17/30985 ,  G06K9/62 ,  G06K9/72 ,  G06K2209/01 ,  Y10S707/99932 ,  Y10S707/99935 ,  Y10S707/99936

摘要： A method for making document information searches. In performing a document search with respect to the desired key word, two stages of presearch are carried out. In a first stage of presearch, a character component table in which an existence of character codes for every document is stated with respect to all the character codes contained in the group of document text data of stored documents is generated, and the character component table is searched for all the character strings constituting a desiredly designated search subject key word to thereby extract all the documents each containing all the character codes constituting the search subject key word. In a second stage of presearch, contracted text data for every document in which adjuncts and duplication of repeatedly stated words contained in advance in the text data are eliminated is generated, and the documents each containing the search subject key words by word are extracted from the documents extracted by the first presearch. After the second stage of presearch, text search is performed in accordance with a neighbor condition, a contextual condition, or the like.

摘要翻译： 一种用于制作文档信息搜索的方法。 在执行关于所需关键字的文档搜索时，执行两个阶段的预搜索。 在预搜索的第一阶段，生成字符分量表，其中针对包含在所存储的文档的文档文本数据组中的所有字符代码来说明每个文档的字符代码的存在，并且字符分量表是 搜索构成期望指定的搜索对象关键字的所有字符串，从而提取包含构成搜索对象关键字的所有字符代码的所有文档。 在第二阶段的研究中，生成了消除了在文本数据中预先包含重复提及的单词的附加和重复的每个文档的合约文本数据，并且从 第一次研究提取的文件。 在预搜索的第二阶段之后，根据邻居条件，上下文条件等执行文本搜索。

公开(公告)号：US5278981A

公开(公告)日：1994-01-11

申请号：US761442

申请日：1991-09-18

申请人： Hisamitsu Kawaguchi ,  Kanji Kato ,  Hiromichi Fujisawa ,  Masaaki Fujinawa ,  Atsushi Hatakeyama

发明人： Hisamitsu Kawaguchi ,  Kanji Kato ,  Hiromichi Fujisawa ,  Masaaki Fujinawa ,  Atsushi Hatakeyama

IPC分类号： G06F17/21 ,  G06F17/30 ,  G06F7/22 ,  G06F7/06

CPC分类号： G06F17/30985 ,  Y10S707/917 ,  Y10S707/99936

摘要： A character stream search system using an FSA for determining at a time whether or not a plurality of character streams as search objects exist in a search character stream which undergoes a search operation and which comprises a plurality of characters expressed with codes. In the system, a collation is conducted between the search character stream and a search object character. In a case where there exists a matched search object character as a result of the collation, a state transition is carried out to a predetermined state indicated by the FSA. In a case where there does not exist a matched search object character, a failure processing to effect a state transition to a transition destination which is determined in association with the configuration of the FSA. The failure processing is completed at a count which is a predetermined upper-limit value for each character undergone the search operation.

摘要翻译： 一种使用FSA的字符流搜索系统，用于一次确定在经历搜索操作的搜索字符流中是否存在作为搜索对象的多个字符流，并且包括用代码表示的多个字符。 在系统中，在搜索字符流和搜索对象字符之间进行归类。 在作为对照的结果存在匹配的搜索对象字符的情况下，状态转换被执行到由FSA指示的预定状态。 在不存在匹配的搜索对象字符的情况下，执行与FSA的配置相关联地确定的转换目的地的状态转换的故障处理。 以对于每个经过搜索操作的字符的预定上限值的计数完成故障处理。

公开(公告)号：US5140644A

公开(公告)日：1992-08-18

申请号：US733982

申请日：1991-07-22

申请人： Hisamitsu Kawaguchi ,  Kanji Kato ,  Atsushi Hatakeyama ,  Hiromichi Fujisawa ,  Masaaki Fujinawa ,  Masaharu Murakami ,  Hidefumi Masuzaki

发明人： Hisamitsu Kawaguchi ,  Kanji Kato ,  Atsushi Hatakeyama ,  Hiromichi Fujisawa ,  Masaaki Fujinawa ,  Masaharu Murakami ,  Hidefumi Masuzaki

IPC分类号： G06F17/30 ,  G06K9/62 ,  G06K9/72

CPC分类号： G06K9/72 ,  G06F17/30985 ,  G06K9/62 ,  G06K2209/01

摘要： A compact character string retrieving system capable of producing correctly the result of matching without omission even upon occurrence of multiple matching in which a plurality of search terms are matched for one character string by a finite automation. A destination state for transition brought about by a trailing character of the search term is newly created instead of an initial state. A transition table storage stores the destination state. On the basis of the source state number and a specified pattern character code, the destination state number is read out from the state transition table storage. When the state number read out represents the destination state of the transition brought about by the trailing character of the specified pattern character string, an identifier thereof is outputted. The identifiers of the search terms matched are each represented by one bit information, and a group of corresponding flags is stored in one slot. Multiple matching can be performed without omission. The character string retrieving system is implemented in a reduced size.

摘要翻译： 一种紧凑的字符串检索系统，即使在通过有限自动化将多个搜索词与一个字符串相匹配的多个匹配发生时，也能够正确地产生匹配结果而不漏出。 新创建由搜索项的尾随字符引起的转换的目的地状态，而不是初始状态。 转换表存储存储目的地状态。 根据源状态号和指定的码字符代码，从状态转换表存储中读出目的地状态号。 当读出状态号表示由指定模式字符串的尾部字符引起的转换的目的地状态时，输出其标识符。 匹配的搜索项的标识符各自由一个比特信息表示，并且一组对应的标志被存储在一个时隙中。 可以进行多次匹配而不遗漏。 字符串检索系统以减小的尺寸实现。

公开(公告)号：US5469354A

公开(公告)日：1995-11-21

申请号：US843162

申请日：1992-02-28

申请人： Atsushi Hatakeyama ,  Hiromichi Fujisawa ,  Kanji Kato ,  Hisamitsu Kawaguchi ,  Naoki Minegishi ,  Katsumi Tada ,  Satoshi Asakawa

发明人： Atsushi Hatakeyama ,  Hiromichi Fujisawa ,  Kanji Kato ,  Hisamitsu Kawaguchi ,  Naoki Minegishi ,  Katsumi Tada ,  Satoshi Asakawa

IPC分类号： G06F17/30 ,  G06K9/62 ,  G06K9/72 ,  G06F17/21

CPC分类号： G06F17/30616 ,  G06F17/30011 ,  G06F17/30982 ,  G06F17/30985 ,  G06K9/62 ,  G06K9/72 ,  G06K2209/01 ,  Y10S707/99933

摘要： High-speed full document retrieval method and system capable of providing result of retrieval within practically acceptable short search time. Upon registration of documents in a document database, condensed texts are created by decomposing each of textual character strings of the documents to be registered into fragmental character strings in dependence on character species and by checking mutual inclusion relations existing among the fragmental character strings. A component character table is created in which characters occurring in each of the condensed texts are registered without duplication. The condensed texts and the component character table are registered in the data base together with the texts of the documents to be registered. Upon retrieval of a document containing a search term designated by a user, a component character table search is first executed to extract those documents which contain all species of characters constituting the search term by consulting the component character table, and subsequently a condensed text search is executed by consulting the condensed texts of the documents. Finally, a text body search is executed for extracting a document which satisfies query condition imposed on the search term by consulting the texts of the documents extracted through the component character table search and the condensed text search.

摘要翻译： 高速全文检索方法和系统能够在实际可接受的短时间内提供检索结果。 在文档数据库中注册文档时，通过根据字符种类将要注册的文档的每个文本字符串分解成分段字符串并通过检查分段字符串之间存在的相互包含关系来创建精简文本。 创建组件字符表，其中在每个精简文本中出现的字符都不重复地注册。 精简文本和组件字符表与要注册的文档的文本一起登记在数据库中。 在检索包含由用户指定的搜索词的文档时，首先执行组件字符表搜索，以通过查看组件字符表来提取包含构成搜索词的所有字符的字符的文档，随后，浓缩文本搜索是 通过咨询文件的精简文本执行。 最后，通过查阅通过组件字符表搜索和浓缩文本搜索提取的文档的文本，执行文本正文搜索以提取满足查询条件的查询条件的文档。

公开(公告)号：US5452451A

公开(公告)日：1995-09-19

申请号：US349124

申请日：1994-12-01

申请人： Mitsuru Akizawa ,  Hisamitsu Kawaguchi ,  Kanji Kato ,  Atsushi Hatakeyama ,  Kouki Noguchi ,  Hiromichi Fujisawa

发明人： Mitsuru Akizawa ,  Hisamitsu Kawaguchi ,  Kanji Kato ,  Atsushi Hatakeyama ,  Kouki Noguchi ,  Hiromichi Fujisawa

IPC分类号： G06F17/30

CPC分类号： G06F17/30985 ,  Y10S707/99936 ,  Y10S707/99937

摘要： A parallel comparator for performing a parallel and high-speed processing for collation of partial character strings which are partially taken out of a plurality of character strings of interest to be searched out with a character string to be searched in which document data to be searched is arranged sequentially from a leading character, is provided in a front stage of an automaton executing device. Only when a part of the character string to be searched coincides with the partial character string set in the comparator, the collation of the remaining portion of the character string to be searched is performed by the automaton executing device. Also, it is possible to set "don't care" in which a character at any position in the partial character string is ignored at the time of comparison by the comparator and to set a negation condition in which the comparison by the comparator is made taking the negation of a character at any position in the partial character string.

摘要翻译： 一种并行比较器，用于执行并行和高速处理，用于将要搜索的多个感兴趣的字符串部分地从要搜索的文档数据中搜索的字符串中部分取出的部分字符串对准， 设置在自动机执行装置的前级中，从主角排列顺序排列。 只有当要搜索的字符串的一部分与比较器中设置的部分字符串一致时，由自动机执行装置执行要搜索的字符串的剩余部分的核对。 此外，可以设置在比较器比较时忽略部分字符串中的任何位置的字符的“无关心”，并且设置比较器进行比较的否定条件 在部分字符串中的任何位置取一个字符。

公开(公告)号：US5757983A

公开(公告)日：1998-05-26

申请号：US517722

申请日：1995-08-21

申请人： Hisamitsu Kawaguchi ,  Mitsuru Akizawa ,  Kanji Kato ,  Atsushi Hatakeyama ,  Hiromichi Fujisawa

发明人： Hisamitsu Kawaguchi ,  Mitsuru Akizawa ,  Kanji Kato ,  Atsushi Hatakeyama ,  Hiromichi Fujisawa

IPC分类号： G06F17/30 ,  G06K9/62 ,  G06K9/72 ,  G06K9/54 ,  G06K9/60

CPC分类号： G06F17/30675 ,  G06F17/30985 ,  G06K9/62 ,  G06K9/72 ,  G06K2209/01

摘要： A document retrieval method and system for retrieving, from a document database storing document data in the form of character codes, a document which contains given search terms and which meets a given search query condition. From documents loaded from the document database, a document containing terms which match the search terms is searched to generate document identification (ID) information including a document identifier of the searched document and containing match terms found to match with the search terms as well as term identifiers of the match terms and position information of the match terms in the searched document. A decision is then made as to whether or not the position information of the match terms satisfies a positional condition specified in the search query condition concerning a positional relation between the search terms, and match information is then generated indicating satisfaction of the search query condition when the positional condition is satisfied. Through a proximity condition decision, it is ascertained whether the match terms satisfy an inter-term distance condition specified in the search query condition. Through a contextual condition decision, it is determined whether the match terms satisfy a concurrence condition specifying concurrence of the search terms in a same sub-sentence, a same sentence or a same paragraph. Through a logical condition, it is decided whether the match terms satisfy a logical condition between the search terms specified in the search query condition.

摘要翻译： 一种文档检索方法和系统，用于从存储文字数据形式的文档数据的文档数据库中检索包含给定搜索词并且满足给定搜索查询条件的文档。 从文档数据库中加载的文档中，搜索包含与搜索词匹配的术语的文档，以生成包括所搜索文档的文档标识符的文档标识（ID）信息，并且包含与搜索词匹配的匹配项，以及术语 搜索文档中匹配项的匹配项和位置信息的标识符。 然后作出关于匹配项的位置信息是否满足关于搜索项之间的位置关系的搜索查询条件中指定的位置条件的决定，然后生成表示搜索查询条件的满足的匹配信息， 满足位置条件。 通过接近度条件判定，确定匹配项是否满足在搜索查询条件中指定的期间距离条件。 通过上下文条件决定，确定匹配项是否满足同一子句，同一句或同一段中的搜索项的同意的同意条件。 通过逻辑条件，确定匹配项是否满足在搜索查询条件中指定的搜索项之间的逻辑条件。

公开(公告)号：US5748953A

公开(公告)日：1998-05-05

申请号：US444842

申请日：1995-05-18

申请人： Natsuko Mizutani ,  Atsushi Hatakeyama ,  Hisamitsu Kawaguchi ,  Katsumi Tada ,  Kanji Kato ,  Satoshi Asakawa

发明人： Natsuko Mizutani ,  Atsushi Hatakeyama ,  Hisamitsu Kawaguchi ,  Katsumi Tada ,  Kanji Kato ,  Satoshi Asakawa

IPC分类号： G06F17/30 ,  G06K9/62 ,  G06K9/72

CPC分类号： G06F17/30613 ,  G06F17/30982 ,  G06F17/30985 ,  G06K9/62 ,  G06K9/72 ,  G06K2209/01 ,  Y10S707/99936

摘要： A neighboring plural-character occurrence bitmap of a practical capacity capable of eliminating noises by hashing is realized, and a high speed full text search is realized equivalently, by greatly reducing the number of documents to be searched even if a search term constituted by a combination of English characters and words is used. Text data is segmented into words, and n-character strings at every (m+l)-th character positions are extracted from each word. A neighboring plural-character occurrence bitmap is created which stores data representing a presence of each neighboring plural-character string at a certain entry thereof. N-character strings at every (m+l)-th character positions are extracted from a search term and the neighboring plural-character occurrence bitmap is searched by using a search control program. Since the neighboring plural-character occurrence bitmap is searched prior to searching condensed texts, documents not relevant to the search term can be discarded and a high speed full text search can be realized.

摘要翻译： 实现能够通过散列消除噪声的实际容量的相邻多字符出现位图，并且通过大大减少要搜索的文档的数量，即使由组合构成的搜索项也大大减少了要进行高速全文检索 使用英文字和词。 文本数据被分割成单词，并且从每个单词提取每个（m + 1）个字符位置处的n个字符串。 创建相邻的多字符出现位图，其存储表示在其特定条目处的每个相邻多个字符串的存在的数据。 从搜索项提取每（m + 1）个字符位置处的N个字符串，并且通过使用搜索控制程序搜索相邻的多个字符出现位图。 由于在搜索浓缩文本之前搜索相邻的多个字符出现位图，所以可以丢弃与搜索项无关的文档，并且可以实现高速全文搜索。