中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.019 seconds)

    COMPUTER-BASED MATCHING TEXT SEARCH SYSTEM AND METHOD
    1.
    发明专利
    COMPUTER-BASED MATCHING TEXT SEARCH SYSTEM AND METHOD 审中-公开

    公开(公告)号：JP2002259429A

    公开(公告)日：2002-09-13

    申请号：JP2002007154

    申请日：2002-01-16

    Applicant: IBM

    Inventor： KLENK JUERGEN ,  JAEPEL DIETER

    IPC: G06F17/30

    Abstract: PROBLEM TO BE SOLVED: To provide a system by which a user can find out matching information in the set of text more easily. SOLUTION: This system includes a database (10) in which m (more than one) pieces of text (17) are stored, and a search engine (16) for identifying k pieces of text (11, 12, 13) matching a search query (15). This system also includes a computation engine (18) that computes the characterizing strength (c) of each of k pieces of the text (11, 12, 13) matching the search query (15). The engine takes a word in the text as a node, produces a graph in which the relation between the words is presented as a link, develops the graph according to the set of preset rules, determines neighboring words connected to a word through one or more links, and computes the characterizing strength (c) according to the topology structure of the neighboring words.

    SYSTEM AND METHOD FOR PERSONALIZED PRESENTATION OF WEB PAGES
    2.
    发明申请
    SYSTEM AND METHOD FOR PERSONALIZED PRESENTATION OF WEB PAGES 审中-公开
    网页个性化介绍的系统与方法

    公开(公告)号：WO02071267A3

    公开(公告)日：2003-06-05

    申请号：PCT/IB0200597

    申请日：2002-02-27

    Applicant: IBM ,  JAEPEL DIETER ,  KLENK JUERGEN

    Inventor： JAEPEL DIETER ,  KLENK JUERGEN

    IPC: G06F17/30

    CPC classification number: G06F17/30867 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99939

    Abstract: A method for presenting to a user electronic documents 1727 is described. The documents are stored at one or more network sites 30 which are accessible via a network by a computer system 34, and are registered with a page filter system 10 20 40. The method comprises the steps of determining needs and/or intentions and/or a field of interest of the user, defining a user specification 12 22 45 based on the determined needs and/or intentions and/or a field of interest of the user, determining a subset 14 of the electronic documents 17 27 comprising only those of the electronic documents 17 27 which comprise content that has a predetermined relation to the user specification 12 22 45, and using the identified subset 14 to amend the presentation of at least one of the electronic documents 17 27 to the user.

    Abstract translation: 描述了向用户呈现电子文档1727的方法。 文档存储在一个或多个网络站点30，网络站点30可以通过计算机系统34经由网络访问，并且被登记到页面过滤系统10 20 40.该方法包括以下步骤：确定需求和/或意图和/或 用户的兴趣领域，基于所确定的需要和/或意图和/或用户感兴趣的领域来定义用户规范12 22 45，确定电子文档17 27的子集14，其仅包括 电子文件17 27，其包括与用户规格12 22 45具有预定关系的内容，并且使用所识别的子集14将至少一个电子文档1727的呈现修改为用户。

    METHOD AND DEVICE FOR PROCESSING TEXT INFORMATION
    3.
    发明专利
    METHOD AND DEVICE FOR PROCESSING TEXT INFORMATION 失效

    公开(公告)号：JP2000056977A

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

    申请号：JP12978699

    申请日：1999-05-11

    Applicant: IBM

    Inventor： BINNIG GERD K ,  BLOECHL PETER ,  KLENK JUERGEN

    IPC: G06F9/44 ,  G06F17/27 ,  G06N5/04

    Abstract: PROBLEM TO BE SOLVED: To easily learn and understand knowledge through a knowledge database by processing text information which is transmitted with an input character string together with information included in the knowledge database. SOLUTION: The input character string 12 of a text, a voice, etc., is converted by a semantic preprocessor 17 to a regular input network 18 of meaning units. The semantic preprocessor 17 converts the input character string 12 to the regular input network 18. A semantic processor 19 finds, in the knowledge database, the subset which matches all the semantic units of the input network 18 most. Further, expansion from the knowledge database 11 is performed in relative semantic units. The input network is called a resulting semantic network 13 there. The semantic processor 19 generates a new fractal hierarchic network of semantic units and pointers from the input network 18 and the knowledge data base 11. The resulting semantic network 13 reflects both general meanings of the input character string 12 and individual sides and is represented as the fractal hierarchical network of the semantic units and pointers like the knowledge database 11.

    METHOD AND SYSTEM FOR MANAGING FILM OR DATA BASE
    4.
    发明专利
    METHOD AND SYSTEM FOR MANAGING FILM OR DATA BASE 失效

    公开(公告)号：JP2000305953A

    公开(公告)日：2000-11-02

    申请号：JP2000072547

    申请日：2000-03-15

    Applicant: IBM

    Inventor： BINNIG GERD K ,  BLOECHL PETER ,  KLENK JUERGEN

    IPC: G06F12/00 ,  G06F9/44 ,  G06F17/30 ,  G06N5/02 ,  G06N5/04

    Abstract: PROBLEM TO BE SOLVED: To provide a method to add elements to a database system. SOLUTION: A fractal hierarchical index database 13 and a processor 19 are included in the database system 10 and the processor 19 is used to obtain an input network 18 including a semantic unit SU1 to represent an element E1 and to evaluate an inputted character string 12 to describe the element E1 to be added to the database system 10. Next, an index database 13 is updated by the processor 19. Finally, the conventional access pointer 22 is maintained or a new access pointer 22 is generated between the element E1 and the semantic unit SU1 to represent the element E1 and the element E1 of the database system 10 is made to be accessible or retrievable.

    PROCESSING OF TEXTUAL INFORMATION AND AUTOMATED APPREHENSION OF INFORMATION
    5.
    发明专利
    PROCESSING OF TEXTUAL INFORMATION AND AUTOMATED APPREHENSION OF INFORMATION 未知

    公开(公告)号：MY123324A

    公开(公告)日：2006-05-31

    申请号：MYPI9901683

    申请日：1999-04-28

    Applicant: IBM

    Inventor： BINNIG GERD K ,  BLOECHL PETER ,  KLENK JUERGEN

    IPC: G06F9/44 ,  G06F17/30 ,  G06F7/00 ,  G06F17/27 ,  G06N5/04

    Abstract: SCHEME FOR THE AUTOMATED APPREHENSION OF TEXTUAL INFORMATION CONVEYED IN AN INPUT STRING (12) . THE INPUT STRING SEGMENTED TO GENERATE SEGMENTS AND/OR SEMANTICAL UNITS. THE FOLLOWING STEPS ARE REPEATED FOR EACH SEGMENT IN THE INPUT STRING UNTIL A SUBSET FOR EACH SEGMENT IN SAID INPUT STRING IS IDENTIFIED: A.IDENTIFYING A MATCHING SEMANTICAL UNIT IN A FRACTAL HIERARCHICAL KNOWLEDGE DATABASE (11) OF SEMANTICAL UNITS AND POINTERS, SAID MATCHING SEMANTICAL UNITS BEING DEEMED TO BE RELATED TO A SEGMENT OF SAID INPUT STRING, B. DETERMINING THE FITNESS OF SAID MATCHING SEMANTICAL UNIT BY TAKING INTO CONSIDERATION SAID SEMANTICAL UNIT''S ASSOCIATIONS, C. DEFINING A SUBSET OF INFORMATION RELATED TO SAID MATCHING SEMANTICAL UNIT WITHIN SAID FRACTAL HIERARCHICAL KNOWLEDGE DATABASE.THEN THESE SUBSETS ARE COMBINED TO FORM A RESULTING SEMANTIC NETWORK (13).FIGURE 2A

Patent Agency Ranking