**Formal Language Theory for Natural Language Processing**

by Shuly Wintner

**Publisher**: ESSLLI 2001**Number of pages**: 52

**Description**:

This course is a mild introduction to Formal Language Theory for students with little or no background in formal systems. The motivation is Natural Language Processing, and the presentation is geared towards NLP applications, with extensive linguistically motivated examples. Still, mathematical rigor is not compromised, and students are expected to have a formal grasp of the material by the end of the course.

Download or read it online for free here:

**Download link**

(320KB, PDF)

## Similar books

**Lecture Notes on Static Analysis**

by

**Michael I. Schwartzbach**-

**IT University of Copenhagen**

These notes present principles and applications of static analysis of programs. We cover type analysis, lattice theory, control flow graphs, dataflow analysis, fixed-point algorithms, narrowing and widening, control flow analysis, pointer analysis.

(

**2685**views)

**The Theory of Languages and Computation**

by

**Jean Gallier, Andrew Hicks**-

**University of Pennsylvania**

From the table of contents: Automata; Formal Languages (A Grammar for Parsing English, Context-Free Grammars, Derivations and Context-Free Languages, Normal Forms for Context-Free Grammars, Chomsky Normal Form, ...); Computability; Current Topics.

(

**3444**views)

**Programming Languages: Theory and Practice**

by

**Robert Harper**-

**Carnegie Mellon University**

What follows is a working draft of a planned book that seeks to strike a careful balance between developing the theoretical foundations of programming languages and explaining the pragmatic issues involved in their design and implementation.

(

**6072**views)

**Lectures on the Curry-Howard Isomorphism**

by

**Morten Heine B. Sorensen, Pawel Urzyczyn**-

**Elsevier Science**

This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic.

(

**6352**views)