LEADER 03482nam 2200577 450 001 9910260653303321 005 20221206094800.0 010 $a0-262-29311-0 010 $a0-262-28351-4 035 $a(CKB)2560000000069096 035 $a(CaBNVSL)mat06267434 035 $a(IDAMS)0b000064818b444a 035 $a(IEEE)6267434 035 $a(SSID)ssj0000467958 035 $a(PQKBManifestationID)12162486 035 $a(PQKBTitleCode)TC0000467958 035 $a(PQKBWorkID)10497317 035 $a(PQKB)11746445 035 $a(WaSeSS)Ind00065719 035 $a(MiAaPQ)EBC5966547 035 $a(PPN)25916528X 035 $a(EXLCZ)992560000000069096 100 $a20151223d2003 uy 101 0 $aeng 135 $aur|n||||||||| 181 $2rdacontent 182 $2isbdmedia 183 $2rdacarrier 200 10$aConstraint-based grammar formalisms $eparsing and type inference for natural and computer languages /$fStuart M. Shieber 210 1$aCambridge, Massachusetts :$cMIT Press,$dc1992. 210 2$a[Piscataqay, New Jersey] :$cIEEE Xplore,$d[2003] 215 $a1 PDF (xi, 183 pages) $cillustrations 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a0-262-51385-4 320 $aIncludes bibliographical references (p. [171]-176) and index. 330 $aConstraint-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. 606 $aComputational linguistics 606 $aGrammar, Comparative and general$xData processing 606 $aProgramming languages (Electronic computers)$xSyntax 615 0$aComputational linguistics. 615 0$aGrammar, Comparative and general$xData processing. 615 0$aProgramming languages (Electronic computers)$xSyntax. 676 $a410.285 700 $aShieber$b Stuart M.$01207770 801 0$bCaBNVSL 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910260653303321 996 $aConstraint-based grammar formalisms$92787683 997 $aUNINA