Cargando…

Constraint-based grammar formalisms : parsing and type inference for natural and computer languages /

Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics. Constraint-Based Grammar Fo...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Shieber, Stuart M.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge, Mass. : MIT Press, ©1992.
Colección:Bradford Book Ser.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000 a 4500
001 EBSCO_ocn694884739
003 OCoLC
005 20231017213018.0
006 m o d
007 cr cnu---unuuu
008 110104s1992 maua ob 001 0 eng d
010 |a  92007820  
040 |a N$T  |b eng  |e pn  |c N$T  |d N$T  |d OCLCQ  |d IEEEE  |d OCLCF  |d YDXCP  |d TUU  |d TNF  |d COO  |d N$T  |d NLGGC  |d OCLCQ  |d IAS  |d OCLCQ  |d LUE  |d VTS  |d AGLDB  |d TOF  |d MITPR  |d STF  |d M8D  |d EBLCP  |d SFB  |d OCLCQ  |d PTL  |d OCLCQ  |d OCLCO  |d VT2  |d OCLCO  |d K6U  |d OCLCQ 
019 |a 45727760  |a 904164571  |a 1128458359  |a 1129183114  |a 1150170615  |a 1163011331  |a 1171294586  |a 1188971160  |a 1286901570 
020 |a 9780262283519  |q (electronic bk.) 
020 |a 0262283514  |q (electronic bk.) 
020 |a 0585315973  |q (electronic bk.) 
020 |a 9780585315973  |q (electronic bk.) 
020 |z 0262193248 
020 |z 9780262193245 
029 1 |a AU@  |b 000051284742 
029 1 |a DEBBG  |b BV042509007 
029 1 |a DEBBG  |b BV043044465 
029 1 |a DEBSZ  |b 421658851 
029 1 |a GBVCP  |b 803448821 
029 1 |a AU@  |b 000073109590 
035 |a (OCoLC)694884739  |z (OCoLC)45727760  |z (OCoLC)904164571  |z (OCoLC)1128458359  |z (OCoLC)1129183114  |z (OCoLC)1150170615  |z (OCoLC)1163011331  |z (OCoLC)1171294586  |z (OCoLC)1188971160  |z (OCoLC)1286901570 
037 |a 2123  |b MIT Press 
037 |a 9780262283519  |b MIT Press 
050 4 |a P98  |b .S54 1992eb 
072 7 |a LAN  |x 009010  |2 bisacsh 
082 0 4 |a 410/.285  |2 22 
049 |a UAMI 
100 1 |a Shieber, Stuart M. 
245 1 0 |a Constraint-based grammar formalisms :  |b parsing and type inference for natural and computer languages /  |c Stuart M. Shieber. 
260 |a Cambridge, Mass. :  |b MIT Press,  |c ©1992. 
300 |a 1 online resource (xi, 183 pages) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a A Bradford Book Ser. 
504 |a Includes bibliographical references (pages 171-176) and index. 
588 0 |a Print version record. 
520 |a Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. 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. 
546 |a English. 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
650 0 |a Computational linguistics. 
650 0 |a Grammar, Comparative and general  |x Data processing. 
650 0 |a Programming languages (Electronic computers)  |x Syntax. 
650 0 |a Parsing (Computer grammar) 
650 6 |a Linguistique informatique. 
650 6 |a Grammaire comparée et générale  |x Informatique. 
650 6 |a Langages de programmation  |x Syntaxe. 
650 6 |a Analyse automatique (Linguistique) 
650 7 |a computational linguistics.  |2 aat 
650 7 |a LANGUAGE ARTS & DISCIPLINES  |x Linguistics  |x Historical & Comparative.  |2 bisacsh 
650 7 |a Computational linguistics.  |2 fast  |0 (OCoLC)fst00871998 
650 7 |a Grammar, Comparative and general  |x Data processing.  |2 fast  |0 (OCoLC)fst00946161 
650 7 |a Parsing (Computer grammar)  |2 fast  |0 (OCoLC)fst01053948 
650 7 |a Programming languages (Electronic computers)  |x Syntax.  |2 fast  |0 (OCoLC)fst01078721 
653 |a COGNITIVE SCIENCES/General 
776 0 8 |i Print version:  |a Shieber, Stuart M.  |t Constraint-based grammar formalisms.  |d Cambridge, Mass. : MIT Press, ©1992  |z 0262193248  |w (OCoLC)25369157 
830 0 |a Bradford Book Ser. 
856 4 0 |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=347687  |z Texto completo 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL5966547 
938 |a EBSCOhost  |b EBSC  |n 347687 
938 |a Internet Archive  |b INAR  |n constraintbasedg0000shie 
938 |a YBP Library Services  |b YANK  |n 3589051 
938 |a YBP Library Services  |b YANK  |n 2321223 
994 |a 92  |b IZTAP