TAILIEUCHUNG - Báo cáo khoa học: "REPRESENTATION OF FEATURE SYSTEMS IN A NON-CONNECTIONIST MOLECULAR MACHINE"

This paper is part of an enterprise whose aim is to represent linguistic knowledge in the form of a m o l e c u l a r machine (a dynamic network). That is, the molecules of the network not only store, but also send, receive, and process information. It is claimed that such a network can be conceived of as a model of the coalition structure of a connectionist network. The paper describes how the class of feature systems called unary feature h i e r a r c h i e s (whose importance is supported by. | REPRESENTATION OF FEATURE SYSTEMS IN A NON-CONNECTIONIST MOLECULAR MACHINE László Kálmán Institute of Linguistics Hungarian Academy of Sciences Budapest I. 19. H-1250 HUNGARY ABSTRACT UNARY FEATURE HIERARCHIES This paper is part of an enterprise whose aim is to represent linguistic knowledge in the form of a molecular machine a dynamic network . That is the molecules of the network not only store but also send receive and process information. It is claimed that such a network can be conceived of as a model of the coalition structure of a connectionist network. The paper describes how the class of feature systems called unary feature hierarchies whose importance is supported by phonological theory but will not be argued for in the paper can be represented in the molecular machine. INTRODUCTION Of the various branches of modern linguistic theory phonology as usual was the first one to come up with really restrictive theories of features and feature systems largely supported by empirical evidence coming from the study of a legion of linguistic phenomena. Phonology will most probably remain main source of evidence as far as the functioning of feature-based cognitive processes is concerned. The present paper sets out to outline how a particular kind of feature system close to several recent theories . of phonological features can be represented in connectionist networks. However since some of the mechanisms involved seriality and synchronization in particular fall outside the scope of the existing connectionist networks a non-connectionist model simulating would-be serial connectionist networks will be used instead. The automaton described in the paper is able to unify feature structures as programs to be run on the machine itself. The feature systems under scrutiny can be termed unary feature hierarchies. The underlying concept is close to the feature geometry approach to autosegmental phonology Clements 1985 in that a feature specification consists of features

• Báo cáo khoa học
• REPRESENTATION OF FEATURE SYSTEMS
• NON CONNECTIONIST MOLECULAR MACHINE
• Long Papers
• scientific reports
• model language
• process natural language
• 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
• 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