Notes on Computational Linguistics
by Edward Stabler
Publisher: UCLA 2003
What kind of computational device could use a system like a human language? This text explores the computational properties of devices that could compute morphological and syntactic analyses, and recognize semantic entailment relations among sentences.
Home page url
Download or read it online for free here:
Download link 1
Download link 2
(multiple PDF files)
by Jon Barwise, John Etchemendy - Center for the Study of Language
The book covers the boolean connectives, formal proof techniques, quantifiers, basic set theory, induction, proofs of soundness and completeness for propositional and predicate logic, and an accessible sketch of Godel's first incompleteness theorem.
by A. L. Berger, S. A. Della Pietra, V. J. Della Pietra - Association for Computational Linguistics
The authors describe a method for statistical modeling based on maximum entropy. They present a maximum-likelihood approach for automatically constructing maximum entropy models and describe how to implement this approach efficiently.
by Rob Malouf, Miles Osborne - ESSLLI
This text provides an introduction to the maximum entropy principle and the construction of maximum entropy models for natural language processing. We investigate the implementation of maximum entropy models for attribute-value grammars.
by Shuly Wintner - ESSLLI
This text 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 examples.