Computational Linguistics
by Igor Boshakov, Alexander Gelbukh
2004
ISBN/ASIN: 9703601472
Number of pages: 198
Description:
The contents of the book are based on the course on computational linguistics that has been delivered by the authors since 1997 at the Center for Computing Research, National Polytechnic Institute, Mexico City. The book focuses on the basic set of ideas and facts from the fundamental science necessary for the creation of intelligent language processing tools, without going deeply into the details of specific algorithms or toy systems.
Download or read it online for free here:
Download link
(1.6MB, PDF)
Similar books
A Maximum Entropy Approach to Natural Language Processing
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.
(10247 views)
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.
(10247 views)
Language, Proof and Logic
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.
(20523 views)
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.
(20523 views)
How Mobile Robots Can Self-organise a Vocabulary
by Paul Vogt - Language Science Press
This book presents a series of experiments in which two robots try to solve the symbol grounding problem. The experiments are based on the language game paradigm, and involve real mobile robots that are able to develop a grounded lexicon ...
(6179 views)
by Paul Vogt - Language Science Press
This book presents a series of experiments in which two robots try to solve the symbol grounding problem. The experiments are based on the language game paradigm, and involve real mobile robots that are able to develop a grounded lexicon ...
(6179 views)
Speech and Language Processing
by Dan Jurafsky, James H. Martin - Stanford University
This text takes an empirical approach to the subject, based on applying statistical and machine-learning algorithms to large corporations. The authors describe a unified vision of speech and language processing. Emphasis is on practical applications.
(7141 views)
by Dan Jurafsky, James H. Martin - Stanford University
This text takes an empirical approach to the subject, based on applying statistical and machine-learning algorithms to large corporations. The authors describe a unified vision of speech and language processing. Emphasis is on practical applications.
(7141 views)