Constraint-based grammar formalisms : (Record no. 73088)

000 -LEADER
fixed length control field 03433nam a2200481 i 4500
001 - CONTROL NUMBER
control field 6267434
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220712204704.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151223s2003 maua ob 001 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9780262283519
-- ebook
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- electronic
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
100 1# - AUTHOR NAME
Author Shieber, Stuart M.,
245 10 - TITLE STATEMENT
Title Constraint-based grammar formalisms :
Sub Title parsing and type inference for natural and computer languages /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 PDF (xi, 183 pages) :
520 ## - SUMMARY, ETC.
Summary, etc Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics. Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. It introduces new applications to both natural and computer languages and brings together Stuart Shieber's many contributions that have been at the core of developments ranging from the discovery of improved explanations of linguistic phenomena such as binding and coordination to the detailed mathematical analysis of constraint-solving and parsing in a variety of grammar formalisms.This thorough examination of the theoretical and computational foundations of constraint-based grammars and applications to natural-language analysis is unique in several respects. Shieber's theoretical framework may be applied to a whole class of formalisms with properties that make it possible to define a general parsing algorithm for all members of the class, with results that provide essential guidance to the implementer of constraint-based language processing systems. Shieber also brings out new connections between grammatical categories and data types, and between constraint-based natural-language analysis and type inference in computer languages. These connections should be of increasing interest both to computational and theoretical linguists and to computer scientists.Stuart M. Shieber is Assistant Professor of Computer Science at Harvard University.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Syntax.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Data processing.
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267434
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cambridge, Massachusetts :
-- MIT Press,
-- c1992.
264 #2 -
-- [Piscataqay, New Jersey] :
-- IEEE Xplore,
-- [2003]
336 ## -
-- text
-- rdacontent
337 ## -
-- electronic
-- isbdmedia
338 ## -
-- online resource
-- rdacarrier
588 ## -
-- Description based on PDF viewed 12/23/2015.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Parsing (Computer grammar)
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Programming languages (Electronic computers)
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Grammar, Comparative and general
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computational linguistics.

No items available.