LINGUIST List 12.769
Tue Mar 20 2001
Books: Computational Linguistics
Editor for this issue: Naomi Ogasawara <naomilinguistlist.org>
Links to the websites of all LINGUIST's supporting publishers are
available at the end of this issue.
- Kim Lewis Brown, Comp Ling: Efficient Processing With Constraint-Logic Grammars..
Message 1: Comp Ling: Efficient Processing With Constraint-Logic Grammars..
Date: Mon, 19 Mar 2001 09:10:48 -0800
From: Kim Lewis Brown <kimcsli.Stanford.EDU>
Subject: Comp Ling: Efficient Processing With Constraint-Logic Grammars..
Minnen, Guido (University of Sussex);
EFFICIENT PROCESSING WITH CONSTRAINT-LOGIC GRAMMARS USING GRAMMAR COMPILATION;
paperback ISBN: 1-57586-306-5, cloth ISBN: 1-57586-305-7; 256 pages.
CSLI Publications 2001.
To order this book, contact The University of Chicago Press.
Call their toll free order number 1-800-621-2736 (U.S. & Canada only) or
order online at http://www.press.uchicago.edu/
(use the search feature to locate the book, then order).
The ascendance of communication technologies such as the internet has
accentuated the need to improve access, manipulation and translation
of written language. One of the main goals of researchers in the field
of computational linguistics is to create programs that put to use
knowledge of human language in pursuit of technology that can overcome
the many obstacles in the interaction between human and computer. In
this endeavor, finding automated techniques to parse the complexities
of human grammar is a premier problem tackled by human-interface
researchers. The intricacy of human grammar poses problems not only of
accuracy, but also of efficiency.
"EFFICIENT PROCESSING WITH CONSTRAINT-LOGIC GRAMMARS USING GRAMMAR
COMPILATION" by Guido Minnen investigates programs for automatic
analysis and production of written human language. These specialized
programs use knowledge about the structure and meaning of human
language in the form of grammars. Various techniques are proposed
which focus on solutions for practical problems in processing of
constraint-logic grammars. The solutions are all based on the
automatic adaptation or compilation of a grammar rather than a
modification of the processing algorithm used. As such they allow
the grammar writer to abstract over details of grammar processing and
in many cases enable more efficient processing.
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue
Major Supporters ----------------