tailieunhanh - Báo cáo khoa học: "ALGORITHMS FOR GENERATION THEOREM PROVING IN LAMBEK"

We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This strategy can be modeled by means of rules in the calculus that are geared to generation, or by means of an algorithm for the Theorem Prover. The latter possibility enables processing of a bidirectional calculus. Therefore Lambek Theorem Proving is a natural candidate for a 'uniform' architecture for natural language parsing and generation. Keywords: generation algorithm; natural language generation; theorem proving; bidirectionality; categorial grammar. introduce a second implementation: a bottom-up algorithm for the theorem prover (4) | ALGORITHMS FOR GENERATION IN LAMBEK THEOREM PROVING Erik-Jan van der Linden Guido Minnen Institute for Language Technology and Artificial Intelligence Tilburg University PO Box 90153 5000 LE Tilburg The Netherlands E-mail vdlinden@ ABSTRACT We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This strategy can be modeled by means of rules in the calculus that are geared to generation or by means of an algorithm for the Theorem Prover. The latter possibility enables processing of a bidirectional calculus. Therefore Lambek Theorem Proving is a natural candidate for a uniform1 architecture for natural language parsing and generation. Keywords generation algorithm natural language generation theorem proving bidirectionality categorial grammar. 1 INTRODUCTION Algorithms for tactical generation are becoming an increasingly important subject of research in computational linguistics Shieber 1988 Shieber et al. 1989 Calder et al. 1989 . In this paper we will discuss generation algorithms within the Lambek Theorem Proving LTP framework Moortgat 1988 Lambek 1958 vein Benthem 1986 . In section 2 we give an introduction to a categorial calculus that is extended towards bidirectionality. The naive top-down control strategy in this section does not suit the needs of efficient generation. Next we discuss two ways to implement a semantics-driven strategy. Firstly we add inference rules and cut rules geared to generation to the calculus 3 . Secondly since these changes in the calculus do not support bidirectionality we We would like to thank Gone Bourne Wietake Silts ma and Marianne Sanden tor their comment on an earlier draft of the paper. 220 introduce a second implementation a bottom-up algorithm for the theorem prover 4 . 2 EXTENDING THE CAL- CULUS Natural Language Processing as deduction The architectures in this paper resemble the uniform architecture in .

• Báo cáo khoa học
• ALGORITHMS FOR GENERATION
• THEOREM PROVING IN LAMBEK
• Erik Jan van der Linden
• 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