Constraints, Language and Computation (eBook)

Torrence Johnson, M. A. Rosner, C. J. Rupp (Herausgeber)

eBook Download: PDF

2014 | 1. Auflage
391 Seiten
Elsevier Science (Verlag)
978-0-08-050296-0 (ISBN)

Infos

Constraint-based linguistics is intersected by three fields: logic, linguistics, and computer sciences. The central theme that ties these different disciplines together is the notion of a linguistic formalism or metalanguage. This metalanguage has good mathematical properties, is designed to express descriptions of language, and has a semantics that can be implemented on a computer. Constraints, Language and Computation discusses the theory and practice of constraint-based computational linguistics. The book captures both the maturity of the field and some of its more interesting future prospects during a particulary important moment of development in this field.

Inhalt

Front Cover 1
Constraints, Language 
4 
Copyright Page 5
Table of Contents 8
Series Preface 6
Dedication 7
Contributors 10
Overview 12
1 FOREWORD 12
2 THE ORIGINS OF CONSTRAINT-BASED LINGUISTICS 13
3 DEVELOPMENTS IN CONSTRAINT-BASED LINGUISTICS 16
4 WHITHER NOW 
22 
Chapter 1. 
26 
1 STRUCTURES 29
2 LANGUAGES 31
3 TRANSLATIONS 44
4 DISCUSSION 50
ACKNOWLEDGEMENTS 52
Chapter 2. 
54 
1 ATTRIBUTE-VALUE LANGUAGES 61
2 THE SYSTEM H°AV 63
3 THE SYSTEM G°AV 73
4 EXPLOITING SLD-RESOLUTION 83
5 CONCLUSION 97
ACKNOWLEDGMENTS 97
Chapter 3. 
102 
1 THE LANGUAGE L 104
2 THE LANGUAGE £ + 105
3 INTENSIONALITY AND EXTENSIONALITY 113
4 NONWELLFOUNDED STRUCTURES 115
5 NONWELLFOUNDED SETS 115
6 COMPLETENESS 117
ACKNOWLEDGEMENTS 135
Chapter 4. 
136 
1 INTRODUCTION 137
2 MULTIPLE-BASE FEATURE STRUCTURES 142
3 MULTIPLE-BASE FEATURE STRUCTURES WITH CONSTRAINTS 149
4 THE INFERENCE ALGORITHM FOR PROPOSITIONAL LOGIC 160
5 THE FULL UNIFICATION ALGORITHM 161
6 CONCLUSIONS AND FURTHER DIRECTIONS 170
ACKNOWLEDGMENTS 172
Chapter 5. 
174 
1 THE FIRSTORDER THE ORIES OF GRAMMARS 176
2 TERM LOGICS AND FEATURE LOGICS 179
3 FROM TERMS AND UNIFICATION TO CONSTRAINED TERMS AND RESOLUTION 183
4 THE FORMAL PROCESSING MODEL 184
5 A PROCESSING MODEL AS CLP(RT) 190
Chapter 6. 
192 
1 BASIC NOTIONS 193
2 SUBSUMPTION 198
3 UNIFICATION 202
4 CONCLUSION 210
Chapter 7. 
212 
1 FEATURE ALGEBRAS 214
2 AN ALTERNATIVE CHARACTERISATION FOR SUBSUMPTION 217
3 THE PATH FUNCTION ALGEBRA 219
4 CONSTRAINTS 220
6 CONCLUSION 227
ACKNOWLEDGMENTS 228
Chapter 8. 
230 
1 SOME POTENTIAL MOTIVATIONS FOR THE USE OF DEFAULTS 232
2 AGAINST DEFAULTS 234
3 SOME LINGUISTIC PROPOSALS 240
4 CONCLUDING REMARKS 245
ACKNOWLEDGEMENTS 247
Chapter 9. 
248 
1 CONSTRAINT PROPAGATION 250
2 SYNTAX, SEMANTICS AND CONSTRAINT PROPAGATION 255
3 SEMANTICRE PRESENTATION 261
4 LINGUISTIC DESCRIPTIONS 266
5 CONCLUSION 272
ACKNOWLEDGEMENT 273
5 A PROCESSING MODEL AS CLP(RT) 190
Chapter 10. 
274 
1 RELATIONAL SEMANTICS 275
2 SIMPLE ENGLISH SENTENCES 281
3 RELATIVE CLAUSES AND QUESTIONS 286
4 WH-CLAUSES AS NPs 292
5 CONCLUSIONS 299
Chapter 11. 
302 
1 THE NEW APPROACH TO DERIVATIONAL MORPHOLOGY 304
2 PREFIXATION AND SUFFIXATION 321
3 THE AFFIX HIERARCHY 331
4 SUMMARY AND CONCLUSION 337
Chapter 12. 
340 
1 BEYOND CONCATENATION 341
2 A SAMPLE GRAMMAR 349
3 THE HEAD CORNER PARSER 354
4 DISCUSSION AND EXTENSIONS 359
ACKNOWLEDGEMENTS 363
Chapter 13. 
364 
1 PROBLEM AREAS IN CURRENT MT SYSTEM DESIGN 365
2 MT AND MODERN LINGUISTIC THEORY 368
3 SHAKE-AND-BAKE TRANSLATION 370
4 SEMANTIC REPRESENTATION AND SEMANTIC EQUIVALENCE 371
5 ALGORITHMS 374
6 EXAMPLES OF TRANSLATION EQUIVALENCE 377
7 SUMMARY 384
ACKNOWLEDGEMENTS 384
References 386
Index 410

Produkt-Details

• Erscheint lt. Verlag: 28.6.2014
• Sprache: englisch
• Themenwelt: Geisteswissenschaften ► Sprach- / Literaturwissenschaft ► Sprachwissenschaft
• Themenwelt: Informatik ► Theorie / Studium ► Algorithmen
• Themenwelt: Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
• ISBN-10: 0-08-050296-2 / 0080502962
• ISBN-13: 978-0-08-050296-0 / 9780080502960