Robustness in Language and Speech Technology

Robustness in Language and Speech Technology
Author: Jean-Claude Junqua
Publisher: Springer Science & Business Media
Total Pages: 292
Release: 2001-02-28
Genre: Computers
ISBN: 9780792367901

In this book we address robustness issues at the speech recognition and natural language parsing levels, with a focus on feature extraction and noise robust recognition, adaptive systems, language modeling, parsing, and natural language understanding. This book attempts to give a clear overview of the main technologies used in language and speech processing, along with an extensive bibliography to enable topics of interest to be pursued further. It also brings together speech and language technologies often considered separately. Robustness in Language and Speech Technology serves as a valuable reference and although not intended as a formal university textbook, contains some material that can be used for a course at the graduate or undergraduate level.

Handbook of Formal Languages

Handbook of Formal Languages
Author: Grzegorz Rozenberg
Publisher: Springer Science & Business Media
Total Pages: 654
Release: 1997
Genre: Computers
ISBN: 9783540606499

This third volume of the Handbook of Formal Languages discusses language theory beyond linear or string models: trees, graphs, grids, pictures, computer graphics. Many chapters offer an authoritative self-contained exposition of an entire area. Special emphasis is on interconnections with logic.

Marcus Contextual Grammars

Marcus Contextual Grammars
Author: Gheorghe Paun
Publisher: Springer Science & Business Media
Total Pages: 336
Release: 2013-04-17
Genre: Computers
ISBN: 9401589690

Marcus Contextual Grammars is the first monograph to present a class of grammars introduced about three decades ago, based on the fundamental linguistic phenomenon of strings-contexts interplay (selection). Most of the theoretical results obtained so far about the many variants of contextual grammars are presented with emphasis on classes of questions with relevance for applications in the study of natural language syntax: generative powers, descriptive and computational complexity, automata recognition, semilinearity, structure of the generated strings, ambiguity, regulated rewriting, etc. Constant comparison with families of languages in the Chomsky hierarchy is made. Connections with non-linguistic areas are established, such as molecular computing. Audience: Researchers and students in theoretical computer science (formal language theory and automata theory), computational linguistics, mathematical methods in linguistics, and linguists interested in formal models of syntax.

Context-free Languages And Primitive Words

Context-free Languages And Primitive Words
Author: Masami Ito
Publisher: World Scientific
Total Pages: 519
Release: 2014-09-25
Genre: Mathematics
ISBN: 9814616559

A word is said to be primitive if it cannot be represented as any power of another word. It is a well-known conjecture that the set of all primitive words Q over a non-trivial alphabet is not context-free: this conjecture is still open. In this book, the authors deal with properties of primitive words over a non-primitive alphabet, the language consisting of all primitive words and related languages. Moreover, some decidable and undecidable problems with respect to the above languages are discussed as well. As another try, a search for a non-phrase structure grammar which generates Q is performed.

Grammars for Programming Languages

Grammars for Programming Languages
Author: J. Craig Cleaveland
Publisher: Elsevier Publishing Company
Total Pages: 184
Release: 1977
Genre: Computers
ISBN:

Thus, the organization of the book as it finally evolved contains two introductory chapters that can be read by anyone familiar with a programming language. These chapters provide a general background in the commonly-used grammatical notations describing the syntax of a programming language. This is information that should be familiar to anyone who programs-unfortunately, it is familiar to only a very few. With the information contained in these first two chapters, the programmer should have confident access to the syntactic portions of programming-language reference manuals. This includes an understanding of what will not appear in the syntax as well as what should appear there. The remainder of the book builds on this basic foundation exploring the limits of definitional possibilities using a grammatical formalism. To this end, the third chapter introduces the ALGOL 68 grammatical formalism with extensive examples. The fourth chapter gives four grammars describing a simple programming language. This illustrates the evolution of grammatical definitions from ALGOL 60 to ALGOL 68 and beyond. The third grammar in the fourth chapter successfully supplies an answer to Martin Kay's germinal challenge.

Formal Languages and Applications

Formal Languages and Applications
Author: Carlos Martin-Vide
Publisher: Springer
Total Pages: 612
Release: 2013-03-09
Genre: Technology & Engineering
ISBN: 3540398864

Formal Languages and Applications provides a comprehensive study-aid and self-tutorial for graduates students and researchers. The main results and techniques are presented in an readily accessible manner and accompanied by many references and directions for further research. This carefully edited monograph is intended to be the gateway to formal language theory and its applications, so it is very useful as a review and reference source of information in formal language theory.

Crafting Interpreters

Crafting Interpreters
Author: Robert Nystrom
Publisher: Genever Benning
Total Pages: 1021
Release: 2021-07-27
Genre: Computers
ISBN: 0990582949

Despite using them every day, most software engineers know little about how programming languages are designed and implemented. For many, their only experience with that corner of computer science was a terrifying "compilers" class that they suffered through in undergrad and tried to blot from their memory as soon as they had scribbled their last NFA to DFA conversion on the final exam. That fearsome reputation belies a field that is rich with useful techniques and not so difficult as some of its practitioners might have you believe. A better understanding of how programming languages are built will make you a stronger software engineer and teach you concepts and data structures you'll use the rest of your coding days. You might even have fun. This book teaches you everything you need to know to implement a full-featured, efficient scripting language. You'll learn both high-level concepts around parsing and semantics and gritty details like bytecode representation and garbage collection. Your brain will light up with new ideas, and your hands will get dirty and calloused. Starting from main(), you will build a language that features rich syntax, dynamic typing, garbage collection, lexical scope, first-class functions, closures, classes, and inheritance. All packed into a few thousand lines of clean, fast code that you thoroughly understand because you wrote each one yourself.

Software Language Engineering

Software Language Engineering
Author: Anthony Sloane
Publisher: Springer
Total Pages: 398
Release: 2012-04-25
Genre: Computers
ISBN: 3642288308

This book constitutes the thoroughly refereed post-proceedings of the 4th International Conference on Software Language Engineering, SLE 2011, held in Braga, Portugal, in July 2011. The 18 papers presented together with 4 tool/language demonstration papers were carefully reviewed and selected from numerous submissions. SLE’s foremost mission is to encourage and organize communication between communities that have traditionally looked at software languages from different, more specialized, and yet complementary perspectives. SLE emphasizes the fundamental notion of languages as opposed to any realization in specific technical spaces.

Introduction to Computer Theory

Introduction to Computer Theory
Author: Daniel I. A. Cohen
Publisher: John Wiley & Sons
Total Pages: 661
Release: 1996-10-25
Genre: Computers
ISBN: 0471137723

This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.