Solving linguistic problems not infrequently reduces to carrying out tasks that are computationally complex and therefore requires automation. In such situations, the difference between having and not having computational tools to handle the tasks is not a matter of economy of time and effort, but may amount to the difference between finding and not finding a solution at all. The book is an introduction to machine-aided linguistic discovery, a novel research area, arguing for the fruitfulness of the computational approach by presenting a basic conceptual apparatus and several intelligent discovery programmes. One of the systems models the fundamental Saussurian notion of system, and thus, for the first time, after almost a century after the introduction of this concept and structuralism in general, linguists are capable to handle adequately this recurring computationally complex task. Another system models the problem of searching for Greenbergian language universals and is capable of stating its discoveries in an intelligible form, viz. a comprehensive English language text, thus constituting the first computer program to generate a whole scientific article. Yet another system detects potential inconsistencies in genetic language classifications. The programmes are applied with noteworthy results to substantial problems from diverse linguistic disciplines such as structural semantics, phonology, typology and historical linguistics.
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Maße
Höhe: 234 mm
Breite: 156 mm
Dicke: 25 mm
Gewicht
ISBN-13
978-1-84553-660-2 (9781845536602)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Bulgarian Academy of Sciences
Introduction 1. Introducing the Basic Notions 2. Parsimonious Discrimination I: KINSHIP and the Problem of Componential Analysis 3. Parsimonious Discrimination II: MPD and Other Applications 4. Inferring Plausible Laws/Patterns I: UNIVAUTO and the Problem of Language Universals 5. Inferring Plausible Laws/Patterns II: UNIVAUTO and Implicational Phonological Universals 6. Inferring Simplest Laws/Patterns: MINTYP and the Problem of Describing a Typology 7. Detecting Significant Similarities: RECLASS and the Problem of Genetic Language Classification 8. Concluding Remarks