TAILIEUCHUNG - Báo cáo khoa học: "A DEFINITE CLAUSE VERSION OF CATEGORIAL GRAMMAR"

We introduce a first-order version of Categorial Grammar, based on the idea of encoding syntactic types as definite clauses. Thus, we drop all explicit requirements of adjacency between combinable constituents, and we capture wordorder constraints simply by allowing subformulae of complex types to share variables ranging over string positions. We are in this way able to account for constructiods involving discontinuous constituents. Such constructions axe difficult to handle in the more traditional version of Categorial Grammar, which is based on propositional types and on the requirement of strict string adjacency between combinable constituents. . | A DEFINITE CLAUSE VERSION OF CATEGORIAL GRAMMAR Remo Pareschi Department of Computer and Information Science University of Pennsylvania 200 s. 33rd St. Philadelphia PA 19104 and Department of Artificial Intelligence and Centre for Cognitive Science University of Edinburgh 2 Bucdeuch Place Edinburgh EH8 9LW Scotland remo@ ABSTRACT We introduce a first-order version of Categorial Grammar based on the idea of encoding syntactic types as definite clauses. Thus we drop all explicit requirements of adjacency between combinable constituents and we capture wordorder constraints simply by allowing subformulae of complex types to share variables ranging over string positions. We are in this way able to account for constructions involving discontinuous constituents. Such constructions are difficult to handle in the more traditional version of Categorial Grammar which is based on propositional types and on the requirement of strict string adjacency between combinable constituents. We show then how for this formalism parsing can be efficiently implemented as theorem proving. Our approach to encoding types as definite clauses presupposes a modification of standard Horn logic syntax to allow internal implications in definite clauses. This modification is needed to account for the types of higher-order functions and as a consequence standard Prolog-like Horn logic theorem proving is not powerful enough. We tackle this 1 am indebted to Dale Miller for help and advice. I am also grateful to Aravind Joshi Mark Steedman David Weir Bob Frank Mitch Marcus and Yves Schabes for comments and discussions. Thanks are due to Elsa Gunter and Amy Felty for advice on typesetting. Farts of this research were supported by a Sloan foundation grant to the Cognitive Science Program Univ of Pennsylvania and NSF grants MCS-8219196-CER IRI-10413 AO2 ARO grants DAA29-84-K-0061 DAA29-84-9-0027 and DARPA grant N00014-85-K0018 to CIS Univ of Pennsylvania. 1 Address for correspondence .

• Báo cáo khoa học
• A DEFINITE CLAUSE
• VERSION OF CATEGORIAL GRAMMAR
• Remo Pareschi
• scientific reports
• model language
• process natural language
• Compiling HPSG type constraints
• definite clause programs
• Long Papers
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• The intersection of Finite
• State Automata
• Definite Clause Grammars
• MONTAG OVIAN DEFINITE CLAUSE GRAMMAR
• R
• Bainbridge
• Vietnamese Question Answering System
• Definite clause grammar
• Computational semantics
• Inferable semantics
• Semantic representation
• Semantic expression
• 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
• 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