TAILIEUCHUNG - Báo cáo khoa học: "An Automatic Inserter System for Hierarchical Lexica"

Lip until now, no automated system for these insertion tasks existed. INSYST (INserter SYSTem), we describe here, can efficiently insert lexical items under the appropriate nodes in hierarchies. It currently handles hierarchies specified in the DATR formalism (Evans and Gazdar 1989, 1990). The system uses a classification algorithm that maximizes the number of inherited features for each entry. | INSYST An Automatic Inserter System for Hierarchical Lexica Marc Light Sabine Reinhard Marie BoyIe Hinrichs Universităt Tubingen Seminar fur Sprachwissenschaft Kleine Wilhelmstr. 113 D-7400 Tubingen light reinhard meb @ Ỉ. Introduction When using hierarchical formalisms for lexical information the need arises to insert . classify lexical items into these hierarchies. This includes at least the following two situations 1 testing generalizations when designing a lexical hierarchy 2 transfeaing large numbers of lexical items from raw data flies to a finished lexical hierarchy when using it to build a large lexicon. Up until now no automated system for these insertion tasks existed. INSYST INserter SYSTem we describe here can efficiently insert lexical items under the appropriate nodes in hierarchies. It currently handles hierarchies specified in the DATR formalism Evans and Gazdar 1989 1990 . The system uses a classification algorithm that maximizes die number of inherited features for each entry. 2. The INSYST-Architecture The following information is requữed by the INSYST-Classifier module i the features that can be inherited from each node of the hierarchy and ii the features of the item to be inserted. Since the answer to i is not explicidy stated in the DATR specification of a node three modules preprocess the input DATR theory the INSYST-Compiler and the INSYST-Inheritance Closure modules. The INSYST-Interface to the database answers question ii . The modules are implemented in c. Figure 1 presents a pictoral view of the interactions between INSYST modules. The INSYST-Compiler and Inheritance Closure modules The INSYST-Compiler reads the input DATR theory from a file creates nodes and inserts the path-value pairs into them as they are encountered. The Inheritance Closure module loops through the node list provided by the Compiler calling a recursive function that expands path-value paữs for each pathvalue paừ in

• Báo cáo khoa học
• An Automatic Inserter System
• Hierarchical Lexica
• 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