TAILIEUCHUNG - Báo cáo khoa học: "EXTENDED ACCESS TO THE LEFT CONTEXT IN AN ATN PARSER"

Some Italian sentences related to linguistic phenomena largely known and recently discussed by many computational linguists are discussed in the framework of AT:~. They offer certain difficulties which seem to suggest a substantial revision of the ATN formalism. The theoretical assumptions and an experimental implementation of such a revision are presented, together with examples. }:any related theoretical points such as some psyeholinguistic implications and the relationship between deterministic and non-deterministlc hypothesis are also briefly discussed. . | EXTENDED ACCESS TO THE LEFT CONTEXT IN AN ATN PARSER Irina Prodanof and Giacomo Ferrari Istituto di Linguistica Computazionale Via della Faggiola 32 1-56100 Pisa Italy ABSTRACT Some Italian sentences related to linguistic phenomena largely known and recently discussed by many computational linguists are discussed in the framework of ATN. They offer certain difficulties which seem to suggest a substantial revision of the ATN formalism. The theoretical assumptions and an experimental implementation of such a revision are presented together with examples. Many related theoretical points such as some psycholinguistic implications and the relationship between deterministic and non-Jeterministic hypothesis are also briefly discussed. I. INTRODUCTION Certain types of sentences seem to defy the abilities of several parsers and some of them are being now discussed by many computational linguists mostly within the deterministic hypothesis. An examination of their treatment within the traditional ATI paradigm seems to suggest that the real discussion is about how to acces the left context and what Its form should be. II. ACCESS TO THE LEFT CONTEXT A. ATM Grammars An ATM grammar is a set of networks formed by labelled states and directed arcs connecting them. The arcs can ricognize terminal words and non-terminal lexical categories symbols or recursively call for a network identified by the label of an initial state. When such a call occurs the parsing algorithm suspends the current computation and starts a new level of computation. Usually each network recognizes some linguistic unit such as Noun Phrase NP Prepositional Phrase pp and Sentence S and any recursively embedded call to one of them corresponds to a level of computation. The parsed parts of the input string are stored SETRed into registers as they are recognized. At the end of the network these registers are combined BUILDQed into a parse node and returned POPed to the calling net. Appropriate functions can return .

• Báo cáo khoa học
• EXTENDED ACCESS TO THE LEFT CONTEXT
• AN ATN PARSER
• Irlna Prodanof and Giaeomo Ferrari
• 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
• 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