AU1994201A - Method for expanding a database that consists of data pairs of recognition and related response - Google Patents

Method for expanding a database that consists of data pairs of recognition and related response

Info

Publication number
AU1994201A
AU1994201A AU19942/01A AU1994201A AU1994201A AU 1994201 A AU1994201 A AU 1994201A AU 19942/01 A AU19942/01 A AU 19942/01A AU 1994201 A AU1994201 A AU 1994201A AU 1994201 A AU1994201 A AU 1994201A
Authority
AU
Australia
Prior art keywords
recognition
database
symbols
response
string
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
AU19942/01A
Inventor
Olaf Voss
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Kiwilogiccom AG
Original Assignee
KIWILOGIC COM AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by KIWILOGIC COM AG filed Critical KIWILOGIC COM AG
Publication of AU1994201A publication Critical patent/AU1994201A/en
Abandoned legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2455—Query execution
    • G06F16/24564—Applying rules; Deductive queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/242—Query formulation
    • G06F16/243—Natural language query formulation

Abstract

The invention relates to a method for expanding a database that consists of data pairs of recognition and related response. The recognition consists of an element or a Boolean operation of elements. Every element is a function that uses a string of symbols, especially a text, as the argument and that gives a Boolean value, or a Boolean operation of further elements. A subset of the elements is stored in an expansion control database. The response consists of any string of symbols. The inventive method is characterized in that the databases are supplemented by a new data pair by defining a string of symbols to be recognized as the recognition template and another string of symbols as the response, by generating a new, empty recognition and applying the elements of the expansion control database to the recognition template. If the application of an element to the recognition template gives the value true , those parts of the recognition template that are necessary and sufficient for the logical truth of the functional result are deleted from the recognition template. The element giving the value true or a Boolean operation of the element giving the value true is supplemented by further elements derived from the remaining recognition template in the new recognition. The recognition thereby generated is then stored in the database together with the response as the new data pair.
AU19942/01A 1999-10-28 2000-10-17 Method for expanding a database that consists of data pairs of recognition and related response Abandoned AU1994201A (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE19952070A DE19952070A1 (en) 1999-10-28 1999-10-28 Procedure for expanding a database
DE19952070 1999-10-28
PCT/DE2000/003640 WO2001040989A2 (en) 1999-10-28 2000-10-17 Method for expanding a database that consists of data pairs of recognition and related response

Publications (1)

Publication Number Publication Date
AU1994201A true AU1994201A (en) 2001-06-12

Family

ID=7927257

Family Applications (1)

Application Number Title Priority Date Filing Date
AU19942/01A Abandoned AU1994201A (en) 1999-10-28 2000-10-17 Method for expanding a database that consists of data pairs of recognition and related response

Country Status (5)

Country Link
EP (1) EP1242917B1 (en)
AT (1) ATE294418T1 (en)
AU (1) AU1994201A (en)
DE (3) DE19952070A1 (en)
WO (1) WO2001040989A2 (en)

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4920499A (en) * 1987-09-30 1990-04-24 E. I. Du Pont De Nemours And Company Expert system with natural-language rule updating
US5442780A (en) * 1991-07-11 1995-08-15 Mitsubishi Denki Kabushiki Kaisha Natural language database retrieval system using virtual tables to convert parsed input phrases into retrieval keys
US5454106A (en) * 1993-05-17 1995-09-26 International Business Machines Corporation Database retrieval system using natural language for presenting understood components of an ambiguous query on a user interface
US5819210A (en) * 1996-06-21 1998-10-06 Xerox Corporation Method of lazy contexted copying during unification

Also Published As

Publication number Publication date
DE10083876D2 (en) 2002-09-26
WO2001040989A3 (en) 2002-07-18
ATE294418T1 (en) 2005-05-15
EP1242917A2 (en) 2002-09-25
DE19952070A1 (en) 2001-06-28
WO2001040989A2 (en) 2001-06-07
EP1242917B1 (en) 2005-04-27
DE50010190D1 (en) 2005-06-02

Similar Documents

Publication Publication Date Title
WO2001058075A3 (en) System and method for production of dynamic documents utilizing a page description language
EP1091303A3 (en) Method and system for providing alternatives for text derived from stochastic input sources
WO2004012099A3 (en) Glyphlets
AU2002231931A1 (en) Context-based information retrieval
WO2003107216A3 (en) Method and system for managing styles in electronic documents
EP0288906A3 (en) Computer input by color coding
WO2005076923A8 (en) Database manipulations using group theory
TW200517887A (en) Methods and apparatus for query rewrite with auxiliary attributes in query processing operations
TW200512602A (en) Method and system of fuzzy searching
WO2001067286A3 (en) Framework for a customizable graphics user interface
CA2435252A1 (en) System and method for creating mark-making tools
KR950702721A (en) A controller for a computer program executing multiple threads that enables optional graphical user interface (GUI) control and command line (TTY) control from a terminal emulator or user program. (Controller for computer program running multiple threads enabling selective graphic user Interface (GUI) control and command line (TTY) control from terminal emulator or user program)
AU1994201A (en) Method for expanding a database that consists of data pairs of recognition and related response
WO2005026962A3 (en) Improvements in or relating to test systems or programs
WO2004012029A3 (en) Restricting access to a method in a component
CN106325852A (en) Application dynamic interface customizing method
Shin et al. Integration of heterogeneous CAD databases using STEP and the Internet
Kalnins Business modelling. Languages and tools
KR920018572A (en) I / O style customization method
AU2001254627A1 (en) Method and data processing system for coordinating applications of a computer software
WO2002048922A3 (en) Method and software for accessing complex software applications through a client user interface
JPH04220768A (en) Text conversion method
WO2002089005A3 (en) Data retrieval method and system
Wehrend et al. Rule language to express policy in a river basin simulator
van Glabbeek Axiomatizing flat iteration

Legal Events

Date Code Title Description
MK6 Application lapsed section 142(2)(f)/reg. 8.3(3) - pct applic. not entering national phase