TAILIEUCHUNG - Báo cáo khoa học: "ON THE AUTOMATIC TRANSFORMATION OF CLASS MEMBERSHIP CRITERIA"

This paper addresses a problem that may arise in c]assificatzon tasks: the design of procedures for matching an instance with a set ~f criteria for class membership in such a way as to permit the intelligent handling ~f inexact, as well as exact matches. An inexact match is a comparlson between an instance and a set of criteria (or a second instance) which has the result that some, but not all, of the criteria described (or exemplified) in the second are found to be satisfied in the first. An exact match is such a comparison for which all of. | ON THE AUTOMATIC TRANSFORMATION OF CLASS MEMBERSHIP CRITERIA Barbara c. Sangster Rutgers University This paper addresses a problem that may arise in classification tasks the design of procedures for matching an instance with a set of criteria for class membership in such a way as to permit the intelligent handling of inexact as well as exact matches. An inexact match is a comparison between an instance and a set of criteria or a second instance which has the result that some but not all of the criteria described or exemplified in the second are found to be satisfied in the first. An exact match is such a comparison for which all of the criteria of the second are found to be satisfied in the first. The approach presented in this paper is to transform the set of criteria for class membership into an exemplary instance of a member of the class which exhibits a set of characteristics whose presence is necessary and sufficient for membership in that class. Use of this exemplary instance during the matching process appears to permit important functions associated with inexact matching to be easily performed and also to have a beneficial effect on the overall efficiency of the matching process. 1. INTRODUCTION An important common element of many projects in Artificial Intelligence is the determination of whether a particular instance satisfies the criteria for membership in a particular class. Frequently this task is a component of a larger one involving a set of instances or a set of classes or both. This determination need not necessarily call for an exact match between an instance and a set of criteria but only for the best or closest match by some definition of goodness or closeness. One important specification for such tasks is the capability for efficient matching procedures another is the ability to perform inexact as well as exact matches. One step towards achieving efficient matching procedures is to represent criteria for class membership in the same way as .

• Báo cáo khoa học
• ON THE AUTOMATIC TRANSFORMATION
• CLASS MEMBERSHIP CRITERIA
• Barbara C
• Sangster
• scientific reports
• model language
• process natural language
• Improving Automatic Speech Recognition for Lectures
• Transformation based Rules Learned
• Minimal Data
• báo cáo khoa học
• báo cáo ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Automatic Grammar Induction
• Parsing Free Text
• A Transformation Based Approach
• mô hình ngôn ngữ
• BMC Bioinformatics
• Neuron reconstruction
• Mean shift
• Sphere model
• Coordinate transformation
• Dialog Control
• Natural Language System
• Dialog Control in a Natural Language System
• Expanding the Horizons
• Natural Language Interfaces
• Phil Hayes
• PROSPECTS OR PRACTICAL
• NATURAL LANGUAGE SYSTEMS
• Workshops
• NATURAL LANGUAGE
• INTERACTION WITH MACHINES
• Long Papers
• COMPUTER INTEBFACE DESIGN MURRAY TUROFF DEPARTMENT OF COMPUTER
• IiVFORMATION SCIENCE IIEW JERSEY INSTITUTE OF TECHNOLOGY
• EVALUATION OF NATURAL LANGUAGE
• INTERFACES TO DATABASE SYSTEMS
• A PANEL DISCUSSION
• database query system
• J
• Norwood Crout
• INTERFACES TO DATA BASE SYSTEMS
• Bozena Henisz
• INTERPRETING NATURAL LANGUAGE
• DATABASE UPDATES
• S
• Jermld Kaplan Jim David
• TRANSPORTABLE NATURAL LANGUAGE
• INTERFACES TO DATABASES
• Gary G
• Hendrlx and William H
• Lewis
• DATABASES THEORETICAL
• TECHNICAL ISSUES
• TRANSPORTABLE NATURAL LANGUAGE INTERFACES
• PROBLEMS AND TECHNIQUES
• Barbara J
• Grosz
• THEORETICAL TECHNICAL ISSUES
• NATURAL LANGUAGE ACCESS TO DATABASES
• R
• Petrick
• Domain Independent
• Database Access Systems
• ISSUES IN NATURAL LANGUAGE
• ACCESS TO DATABASES
• A LOGIC PROGRAMMING PERSPECTIVE
• Sharon C
• Salveter David Maier
• PLANNING NATURAL LANGUAGE
• EXPRESSIONS REFERRING
• Douglas E
• Appelt
• THE TEXT SYSTEM
• NATURAL LANGUAGE GENERATION
• Kathleen R
• M
• MENTING A DATABASE
• KNOWLEDGE REPRESENTATION
• THE KEY TO THE SELECTION PROBLEM
• E
• Jeffrey Conklin David D
• McDonald
• A KNOWLEDGE ENGINEERING
• NATURAL LANGUAGE UNDERSTANDING
• Stuart C
• Shapiro
• NATURAL LANGUAGE TEXTS
• NECESSARILY GRAMMATICAL
• EVEN COMPLETE
• UNGRAMHATICALITY
• EXTRA GRAMMATICALITY
• NATURAL LANGUAGE UNDERSTANDING SYSTEMS
• Taxonomy
• Descriptions
• Individuals in Natural
• Language Understanding
• The Use of Ooject Special Knowledge
• Natural Language Processing
• Mark H
• Bursteln