Rosner / Rupp / Johnson Constraints, Language and Computation

1. Auflage 2014
ISBN: 978-0-08-050296-0
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 391 Seiten, Web PDF

Reihe: Cognitive Science

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.

Autoren/Hrsg.

Rosner, M. A.

Rupp, C. J.

Johnson, Torrence

Inhaltsverzeichnis

1;Front Cover;1
2;Constraints, Language
and Computation;4
3;Copyright Page;5
4;Table of Contents;8
5;Series Preface;6
6;Dedication;7
7;Contributors;10
8;Overview;12
8.1;1 FOREWORD;12
8.2;2 THE ORIGINS OF CONSTRAINT-BASED LINGUISTICS;13
8.3;3 DEVELOPMENTS IN CONSTRAINT-BASED LINGUISTICS;16
8.4;4 WHITHER NOW
?;22
9;Chapter 1.
Structures, Languages and Translations: the Structural Approach to Feature Logic;26
9.1;1 STRUCTURES;29
9.2;2 LANGUAGES;31
9.3;3 TRANSLATIONS;44
9.4;4 DISCUSSION;50
9.5;ACKNOWLEDGEMENTS;52
10;Chapter 2.
Some Remarks on the Logic of Unification Grammars;54
10.1;1 ATTRIBUTE-VALUE LANGUAGES;61
10.2;2 THE SYSTEM H°AV;63
10.3;3 THE SYSTEM G°AV;73
10.4;4 EXPLOITING SLD-RESOLUTION;83
10.5;5 CONCLUSION;97
10.6;ACKNOWLEDGMENTS;97
11;Chapter 3.
A Feature Value Logic with Intensionality, Nonwellfoundedness and Functional and Relational Dependencies;102
11.1;1 THE LANGUAGE L;104
11.2;2 THE LANGUAGE £ +;105
11.3;3 INTENSIONALITY AND EXTENSIONALITY;113
11.4;4 NONWELLFOUNDED STRUCTURES;115
11.5;5 NONWELLFOUNDED SETS;115
11.6;6 COMPLETENESS;117
11.7;ACKNOWLEDGEMENTS;135
12;Chapter 4.
Properties of Horn Clauses in Feature-Structure Logic;136
12.1;1 INTRODUCTION;137
12.2;2 MULTIPLE-BASE FEATURE STRUCTURES;142
12.3;3 MULTIPLE-BASE FEATURE STRUCTURES WITH CONSTRAINTS;149
12.4;4 THE INFERENCE ALGORITHM FOR PROPOSITIONAL LOGIC;160
12.5;5 THE FULL UNIFICATION ALGORITHM;161
12.6;6 CONCLUSIONS AND FURTHER DIRECTIONS;170
12.7;ACKNOWLEDGMENTS;172
13;Chapter 5.
The Formal and Computational Theory of Complex Constraint Solution;174
13.1;1 THE FIRSTORDER THE ORIES OF GRAMMARS;176
13.2;2 TERM LOGICS AND FEATURE LOGICS;179
13.3;3 FROM TERMS AND UNIFICATION TO CONSTRAINED TERMS AND RESOLUTION;183
13.4;4 THE FORMAL PROCESSING MODEL;184
13.5;5 A PROCESSING MODEL AS CLP(RT);190
14;Chapter 6.
Describing Sets with Sets: Remarks on the Use and Interpretation of Set-valued Feature Structures;192
14.1;1 BASIC NOTIONS;193
14.2;2 SUBSUMPTION;198
14.3;3 UNIFICATION;202
14.4;4 CONCLUSION;210
15;Chapter 7.
Feature Logic with Weak Subsumption Constraints;212
15.1;1 FEATURE ALGEBRAS;214
15.2;2 AN ALTERNATIVE CHARACTERISATION FOR SUBSUMPTION;217
15.3;3 THE PATH FUNCTION ALGEBRA;219
15.4;4 CONSTRAINTS;220
15.5;6 CONCLUSION;227
15.6;ACKNOWLEDGMENTS;228
16;Chapter 8.
Feature-value Logics: Some Limits on the Role of Defaults;230
16.1;1 SOME POTENTIAL MOTIVATIONS FOR THE USE OF DEFAULTS;232
16.2;2 AGAINST DEFAULTS;234
16.3;3 SOME LINGUISTIC PROPOSALS;240
16.4;4 CONCLUDING REMARKS;245
16.5;ACKNOWLEDGEMENTS;247
17;Chapter 9.
Constraint Propagation and Semantic Representation;248
17.1;1 CONSTRAINT PROPAGATION;250
17.2;2 SYNTAX, SEMANTICS AND CONSTRAINT PROPAGATION;255
17.3;3 SEMANTICRE PRESENTATION;261
17.4;4 LINGUISTIC DESCRIPTIONS;266
17.5;5 CONCLUSION;272
17.6;ACKNOWLEDGEMENT;273
17.7;5 A PROCESSING MODEL AS CLP(RT);190
18;Chapter 10.
Meanings as Constraints on Information States;274
18.1;1 RELATIONAL SEMANTICS;275
18.2;2 SIMPLE ENGLISH SENTENCES;281
18.3;3 RELATIVE CLAUSES AND QUESTIONS;286
18.4;4 WH-CLAUSES AS NPs;292
18.5;5 CONCLUSIONS;299
19;Chapter 11.
Derivation without Lexical Rules;302
19.1;1 THE NEW APPROACH TO DERIVATIONAL MORPHOLOGY;304
19.2;2 PREFIXATION AND SUFFIXATION;321
19.3;3 THE AFFIX HIERARCHY;331
19.4;4 SUMMARY AND CONCLUSION;337
20;Chapter 12.
Head Corner Parsing;340
20.1;1 BEYOND CONCATENATION;341
20.2;2 A SAMPLE GRAMMAR;349
20.3;3 THE HEAD CORNER PARSER;354
20.4;4 DISCUSSION AND EXTENSIONS;359
20.5;ACKNOWLEDGEMENTS;363
21;Chapter 13.
Shake-and-Bake Translation;364
21.1;1 PROBLEM AREAS IN CURRENT MT SYSTEM DESIGN;365
21.2;2 MT AND MODERN LINGUISTIC THEORY;368
21.3;3 SHAKE-AND-BAKE TRANSLATION;370
21.4;4 SEMANTIC REPRESENTATION AND SEMANTIC EQUIVALENCE;371
21.5;5 ALGORITHMS;374
21.6;6 EXAMPLES OF TRANSLATION EQUIVALENCE;377
21.7;7 SUMMARY;384
21.8;ACKNOWLEDGEMENTS;384
22;References;386
23;Index;410