TAILIEUCHUNG - Báo cáo khoa học: "ZERO MORPHEMES IN UNIFICATION-BASED COMBINATORY CATEGORIAL GRAMMAR"

After illustrating the benefits of this approach with several examples, we describe the algorithm for compiling zero morphemes into unary rules, which allows us to use zero morphemes more efficiently in natural language processing. 1 Then, we discuss the question of equivalence of a grammar with these unary rules to the original grammar. Lastly, we compare our approach to zero morphemes with possible alternatives. 1. Zero Morphemes in Categorial Grammar In English and in other natural languages, it is attractive to posit the existence of morphemes that are invisible on the surface but have their own syntactic and. | ZERO MORPHEMES IN UNIFICATION-BASED COMBINATORY CATEGORIAL GRAMMAR Chinatsu Aone The University of Texas at Austin MCC 3500 West Balcones Center Dr. Austin TX 78759 aone@ Kent Wittenberg MCC 3500 West Bateones Center Dr. Austin TX 78759 wittenburg@ ABSTRACT In this paper we report on our use of zero morphemes in Unification-Based Combinatory Categorial Grammar. After illustrating the benefits of this approach with several examples we describe the algorithm for compiling zero morphemes into unary rules which allows us to use zero morphemes more efficiently In natural language Then we discuss the question of equivalence of a grammar with these unary rules to the original grammar. Lastly we compare our approach to zero mor phemes with possible alternatives. Morphemes in Categorial Grammar In English and in other natural languages it is attractive to posit the existence of morphemes that are invisible on the surface but have their own syntactic and semantic definitions. In our analyses they are just like any other overt morphemes except for having null strings . and we call them zero morphemes. Most in Categorial Grammar and related forms of unification-based grammars on the other hand take the rule-based approach. That is they assume that there are unary rules that change features or categories of their arguments cf. Dowty 1977 Hoeksema 1985 Wittenburg 1986 Wood 1987 . Below we will discuss the advantages of our zero morpheme approach over the rule-based approach. Zero morphemes should be distinguished from so-called gaps in wh-questions and relative clauses In that zero morphemes are not traces or place holders of any other overt morphemes in a given sentence. There are at 1. The work described here is implemented in Common Lisp and being used in the Lucy natural language understanding system at MCC. least two types of zero morphemes zero morphemes at the morphology level and those at the syntax level. A zero morpheme at the .

• Báo cáo khoa học
• ZERO MORPHEMES
• UNIFICATION BASED COMBINATORY
• CATEGORIAL GRAMMAR
• 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