| 000 | 00893camuuu200253 a 4500 | |
| 001 | 000000022906 | |
| 005 | 19980601114223.0 | |
| 008 | 931014s1994 maua 001 0 eng | |
| 010 | ▼a 93038821 | |
| 020 | ▼a 079239416X (acid-free paper) | |
| 040 | ▼a DLC ▼c DLC ▼d DLC | |
| 049 | 1 | ▼l 111023944 |
| 050 | 0 0 | ▼a QA76.9.N38 ▼b R48 1994 |
| 082 | 0 0 | ▼a 006.3/5 ▼2 20 |
| 090 | ▼a 006.35 ▼b R452 | |
| 245 | 0 0 | ▼a Reversible grammar in natural language processing / ▼c edited by Tomek Strzalkowski. |
| 260 | ▼a Boston : ▼b Kluwer Acadmic Publishers , ▼c c1994. | |
| 300 | ▼a xxi, 454 p. : ▼b ill. ; ▼c 25 cm. | |
| 440 | 4 | ▼a The Kluwer international series in engineering and computer science ; ▼v SECS 255. |
| 504 | ▼a Includes bibliographical references and index. | |
| 650 | 0 | ▼a Parsing (Computer grammar). |
| 650 | 0 | ▼a Natural language processing (Computer science). |
| 700 | 1 0 | ▼a Strzalkowski, Tomek. |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 중앙도서관/서고6층/ | 청구기호 006.35 R452 | 등록번호 111023944 (2회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
Reversible grammar allows computational models to be built that are equally well suited for the analysis and generation of natural language utterances. This task can be viewed from very different perspectives by theoretical and computational linguists, and computer scientists. The papers in this volume present a broad range of approaches to reversible, bi-directional, and non-directional grammar systems that have emerged in recent years. This is also the first collection entirely devoted to the problems of reversibility in natural language processing.
Most papers collected in this volume are derived from presentations at a workshop held at the University of California at Berkeley in the summer of 1991 organised under the auspices of the Association for Computational Linguistics.
This book will be a valuable reference to researchers in linguistics and computer science with interests in computational linguistics, natural language processing, and machine translation, as well as in practical aspects of computability.
Reversible grammar allows computational models to be built that are equally well suited for the analysis and generation of natural language utterances. This task can be viewed from very different perspectives by theoretical and computational linguists, and computer scientists. The papers in this volume present a broad range of approaches to reversible, bi-directional, and non-directional grammar systems that have emerged in recent years. This is also the first collection entirely devoted to the problems of reversibility in natural language processing.
Most papers collected in this volume are derived from presentations at a workshop held at the University of California at Berkeley in the summer of 1991 organised under the auspices of the Association for Computational Linguistics.
This book will be a valuable reference to researchers in linguistics and computer science with interests in computational linguistics, natural language processing, and machine translation, as well as in practical aspects of computability.
정보제공 :
목차
CONTENTS CONTRIBUTORS = xi PREAFACE = xiii 1 A REVERSIBLE CONSTRAINT - BASED LOGIC GRAMMAR : APPLICATION TO THE TREATMENT OF SECONDARY PREDICATION AND SMALL CLAUSES / Palmira Marrafa ; patrick Saint-Dizier = 1 1 Introduction = 1 2 A type - based description language = 3 3 Dealing with constraints = 4 4 Processing Language with types and constraints = 5 5 An abstract machine for type construction in a parsing process = 7 6 An Abstract Machine for Language Generation = 9 7 An Application to Secondary Predications and Small Clauses in Portuguese = 13 8 Specific features of our approach = 27 9 Conclusion = 29 2 INHERENTLY REVERSIBLE GRAMMARS / Marc Dymetman = 33 1 Introduction = 33 2 Definite programs and computation = 35 3 Grammars and their computational uses = 42 4 Definite programs, uniformity of implementation, and reversibility = 46 5 Inherently reversible grammars = 48 6 Some counter - examples to finite reversibility and a "moderation" condition on linguistic description = 49 7 Appendix = 54 3 REVERSIBILITY AND SELF - MONITORING IN NATURAL LANGUAGE GENERATION / G u ·· nter Neumann ; Gertjan van Noord = 59 1 Introduction = 59 2 Reversible grammars = 61 3 Modularity in Generation Systems = 68 4 Integration of Parsing and Generation = 72 5 Generation of Unambiguous Utterances = 74 6 Generation of Paraphrases = 84 7 Discussion = 88 8 Future work = 90 4 A UNIFORM ARCHITECTURE FOR PARSING, GENERATION AND TRANSFER / R e' mi Zajac = 97 1 Principles for a uniform architecture = 97 2 A rewrite machine for typed feature structures = 99 3 Parsing, generation, and bidirectional transfer = 103 4 The termination problem and efficiency issues = 107 5 Concussion = 109 5 HANDLING FELICITY CONDITIONS WITH A REVERSIBLE ARCHITECTURE / Masato Ishizaki = 113 1 Introduction = 113 2 Felicity Conditions for a Reversible Architecture = 115 3 A Data Structure for a Reversible Architecture = 118 4 Towards a New Reversible Architecture = 123 5 Discussion = 125 6 Conclusion = 126 6 COMMON HEURISTICS FOR PARSING, GENERATION, AND WHATEVER / K o' iti Hasida = 129 1 Introduction = 129 2 constraint Network = 130 3 Computation = 134 4 Parsing = 143 5 Generation = 148 6 Concluding Remarks = 152 7 COMPILING TRACE & UNIFICATION GRAMMAR / Hans Urich Black = 155 1 Introduction = 155 2 Formalism = 156 3 Compiling Trace & Unification Grammar = 163 4 Conclusion = 173 8 A GENERAL COMPUTATIONAL METHOD FOR GRAMMAR INVERSION / Tomek Strzalkowski = 175 1 Reversible Grammars = 175 2 In and out Arguments in Literals = 178 3 Essential Arguments : An Extension = 182 4 Intra - Clausal Inversion = 189 5 Moving Literals Between Clauses = 191 6 Inter - Clausal inversion = 193 7 Conclusions = 196 9 BI - DIRECTIONAL PREFERENCES / James Barnett = 201 1 Introduction = 201 2 Basic Definitions = 203 3 An Algorithm = 210 4 Some Examples of Preferences = 216 5 Extensions : Complex Preferences = 220 6 Bi - Directional Preferences = 224 7 Conclusion = 229 10 HANDLING SYNTACTIC ALTERNATIVES IN A REVERSIBLE GRAMMAR / Lee Fedder = 235 1 Introduction = 235 2 The Grammar Formalism and Thematic : System = 237 3 Discourse parameters = 240 4 How the discourse parameters are encoded in the grammar = 244 5 Some Examples = 252 6 Discussion = 252 7 Conclusions = 253 11 REVERSIBLE NLP BY LINKING THE GRAMMAR TO THE KNOWLEDGE BASE / David D. McDonald = 257 1 Introduction = 257 2 Reversibility through compilation = 260 3 The 'pivot - point' between generation and comprehension = 261 4 Parsing to objects = 265 5 Linking linguistic resources to objects = 266 6 Summary of the approach = 270 7 Parsing Tree Adjoining Grammars = 271 8 Exploded Tree Families = 273 9 An example of the objects recovered by a parse = 279 10 Is it Still a TAG? = 281 11 Concluding remarks = 286 12 REVERSIBLE GRAMMARS AND THEIR APPLICATION IN MACHINE TRANSLATION / Dominique Estival = 293 1 MT as Knowledge Description = 294 2 Grammar Reversibility = 295 3 ELU = 298 4 Description of the Grammar = 305 5 Conclusion = 316 13 REVERSIBLE MACHINE TRANSLATION : WHAT TO DO WHEN THE LANGUAGES DON'T MATCH UP / James Barnett ; Inderjeet Mani ; Elaine Rich = 321 1 Introduction = 321 2 Translation Divergences and Mismatches = 323 3 viewing the Problem as One of Generation = 330 4 The Role of the Knowledge Base = 335 5 Defining What it Means to be a Correct Rendition of an Input DLSS = 337 6 A Closest - Fit Generation Algorithm = 349 7 Heuristic Improvements = 357 8 Conclusion = 360 14 A GENERATIONIST APPROACH TO GRAMMAR REVERSIBILITY IN NATURAL LANGUAGE PROCESSING / Robin P. Fawcett = 365 1 The 'formal linguistics' approach to the issue = 366 2 The argument in a nutshell = 373 3 Some supporting evidence : the different problems of processing in the two directions = 377 4 The linguistic archipelago = 380 5 Fleshing out the argument : overview of a complete system = 382 6 Generators derived from parsers : a discussion = 401 7 Conclusions = 406 15 SEMANTIC INTERPRETATION IN A SYSTEMIC FUNCTIONAL GRAMMAR / Tim F. O'Donohue = 415 1 Introduction = 415 2 What About Syntax? = 419 3 Overview = 422 4 Finding the Features = 423 5 Disjunction : Inclusive, Exclusive or Both? = 437 6 Conclusions = 443 INDEX = 449
