Foundations of Computational Linguistics: Human-Computer Communication in Natural LanguageAs an interdisciplinary field, computational linguistics has its sources in several areas of science, each with its own goals, methods, and historical background. Thereby, it has remained unclear which components fit together and which do not. This suggests three possible approaches to designing a computational linguistics textbook. The first approach proceeds from one's own school of thought, usually determined of study, rather than by a well-informed, delib by chance, such as one's initial place erate choice. The goal is to extend the inherited theoretical framework or method to as many aspects of language analysis as possible. As a consequence, the issue of com pat ibility with other approaches in the field need not be addressed and one's assumptions are questioned at best in connection with 'puzzling problems. ' The second approach takes the viewpoint of an objective observer and aims to survey the field as completely as possible. However, the large number of different schools, methods, and tasks necessitates a subjective selection. Furthermore, the pre sumed neutrality provides no incentive to investigate the compatibility between the elements selected. The third approach aims at solving a comprehensive functional task, with the differ To arrive at the desired solution, suitability ent approaches being ordered relative to it. and compatibility of the different elements adopted must be investigated with regard to the task at hand. |
Contents
12 | |
Technology and grammar | 33 |
Cognitive foundations of semantics | 51 |
Language communication | 69 |
Using language signs on suitable contexts | 89 |
Structure and functioning of signs | 103 |
Generative grammar | 125 |
Language hierarchies and complexity | 141 |
Appendix | 513 |
A Another example of a word bank | 515 |
Translating the content of a knowledge base into propositions | 516 |
Word bank representation | 517 |
Embedding and extracting propositional content | 518 |
B Interpretation of a complex sentence LAE4 521 | 520 |
Preverbal application of DET+N | 523 |
Application of NOM+FV | 524 |
Leftassociative grammar LAG | 183 |
Hierarchy of LAgrammar | 203 |
LA and PShierarchies in comparison | 223 |
Words and morphemes 241 | 240 |
Word form recognition in LAMorph | 259 |
Corpus analysis | 281 |
Basic concepts of syntax | 301 |
LAsyntax for English | 321 |
LAsyntax for German | 343 |
Three system types of semantics 371 | 370 |
Truth meaning and ontology | 389 |
Absolute and contingent propositions | 409 |
Database semantics | 429 |
Structure and functions of a SLIM machine | 455 |
A formal fragment of natural language | 477 |
Schematic summary | 507 |
Conclusion | 511 |
Application of FV+MAIN | 525 |
Postverbal application of DET+N | 526 |
Transition to the subordinate clause based on ADDADP | 527 |
Beginning of the subordinate clause based on STARTSUBCL | 528 |
Reapplication of NOM+FV | 529 |
Completing the subordinate clause with FV+MAIN | 530 |
Result of the derivation | 531 |
Subordinating navigation in the speaker mode | 533 |
Embedding constructions | 534 |
Realization of clauses with the verb in final position | 535 |
Lexical realization of conjunctions | 536 |
Multiple center embeddings | 537 |
539 | |
141 | 559 |
563 | |
565 | |
Other editions - View all
Foundations of Computational Linguistics: Human-Computer Communication in ... Roland Hausser No preview available - 2014 |
Foundations of Computational Linguistics: Human-Computer Communication in ... Roland Hausser No preview available - 2014 |
Common terms and phrases
algorithm allo-rules allomorphs ambiguity analyzed applications automatic base form basic C-grammar C-LAGS categorial operation clauses cognitive agent complexity components computational computational linguistics concatenation constituent structure context-free languages context-free PS-grammar context-sensitive context-sensitive languages corresponding database semantics defined definition DET+ADJ DET+N elementary English Epimenides paradox example Explain expressions Fido finite formal Frau func function functor FV+MAIN German grammar inference input Julia L-proplets LA-grammar LA-MOTOR language classes left-associative lemmatization lexical lexicon linguistics logical semantics M-concept main verb matching meaning meaningā metalanguage MODR morpheme natural language navigation NOM+FV nominal fillers noun phrases ontology parser parsing pattern Peter pragmatics principle proplets PS-grammar recursive recursive languages reference relation result rule package Section segment semantic interpretation sentence sequence SLIM theory speaker subcontext surface syntactic syntactic ambiguity syntax Tarski's task analysis theory of language time-linear types valency positions word bank word order