TAILIEUCHUNG - Báo cáo khoa học: "ON THE GENERATIVE POWER OF TWO LEVEL MORPHOLOGICAL RULES"

Koskenniemi's model of two-level morphology has been very influential in recent years, but definitions of the formalism have generally been phrased in terms of a compilation (sometimes left unspecified) into a form of finite-state transducers, or else have consisted of an informal outline of the intended interpretation of the rule-formalism itself. Analyses of the properties of the formalism have generally focussed on the transducer mechanism. It is, however, possible to give a fully formal definition of the original rule notation directly, in a way which reflects Koskenniemi's original informal characterisation and which does not depend directly on the. | ON THE GENERATIVE POWER OF TWO-LEVEL MORPHOLOGICAL RULES Graeme Ritchie Department of Artificial Intelligence University of Edinburgh 80 South Bridge Edinburgh EH1 1HN Scotland ABSTRACT Koskenniemi s model of two-level morphology has been very influential in recent years but definitions of the formalism have generally been phrased in terms of a compilation sometimes left unspecified into a form of finite-state ttans-ducers or else have consisted of an informal outline of the intended interpretation of the rule-formalism itself. Analyses of the properties of the formalism have generally focussed on the transducer mechanism. It is however possible to give a fully formal definition of the original rule notation directly in a way which reflects Koskenniemi s original informal characterisation and which does not depend directly on the notion of a transducer although it must retain the essential nature of parts of the notation as being regular expressions . This re-formulation allows a proof that the ability of this formalism to characterise mappings between strings is more limited than that of arbitrary transducers. BACKGROUND Koskenniemi 1983a b 1984 proposed a rule-system for describing morphological regularities in a language depending centrally on the idea of matching two sequences of symbols - a lexical string made up of the lexical forms of morphemes and a surface string the sequence of characters in the normal inflected form of the word . In principle symbols could be orthographic or phonological here we shall follow common practice within two-level morphology and assume orthographic forms are being analysed. Koskenniemi 1983a originally described the rules in two alternative forms -high-level rules and finite-state transducers and conjectured that an automatic compilation procedure could be devised to transform the more readable high-level form into the more dứectly implementable ttansducer form. His implemen tation was an interpreter for the transducers which .

• Báo cáo khoa học
• ON THE GENERATIVE POWER
• TWO LEVEL MORPHOLOGICAL RULES
• Graeme Ritchie
• scientific reports
• model language
• process natural language
• Constraints on strong
• generative power
• David Chiang
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• COMBINATORY CATEGORIAL RELATIONSHIP
• LINEAR GRAMMARS GENERATIVE POWER
• CONTEXT FREE REWRITING SYSTEMS
• Generative Power of CCGs
• Generalized Type Raised Categories
• Nobo Komagata
• 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