LEADER 00876nam0-22003011i-450-
001 990001484240403321
010   $a0-333-77879-0
035   $a000148424
035   $aFED01000148424
035   $a(Aleph)000148424FED01
035   $a000148424
100   $a20010619d2000----km-y0itay50------ba
101 0 $aeng
102   $aGB
105   $aa---a---001yy
200 1 $aEncyclopedia of computer science$feditors Anthony Ralston, Edwin D. Reilly, David Hemmendinger
205   $a4th ed.
210   $aLondon$cNature publishing group$dc2000
215   $axxix, 2034 p.$cill., col.$d28 cm
610 0 $aInformatica$aDizionari, enciclopedie
676   $a004.03
801  0$aIT$bUNINA$gRICA$2UNIMARC
901   $aBK
912   $a990001484240403321
952   $a004.03-ENC-(1$b$fSC1
959   $aSC1
996   $aEncyclopedia of computer science$9378115
997   $aUNINA

LEADER 03542nam  22007332  450 
001 9910968042403321
005 20151005020622.0
010   $a1-107-22976-6
010   $a1-280-48528-0
010   $a1-139-22290-2
010   $a9786613580269
010   $a1-139-21810-7
010   $a1-139-21501-9
010   $a1-139-22462-X
010   $a1-139-22119-1
010   $a1-139-01357-2
035   $a(CKB)2550000000061332
035   $a(EBL)833478
035   $a(OCoLC)775869969
035   $a(SSID)ssj0000572783
035   $a(PQKBManifestationID)11376318
035   $a(PQKBTitleCode)TC0000572783
035   $a(PQKBWorkID)10529827
035   $a(PQKB)10073548
035   $a(UkCbUP)CR9781139013574
035   $a(Au-PeEL)EBL833478
035   $a(CaPaEBR)ebr10533251
035   $a(CaONFJC)MIL358026
035   $a(MiAaPQ)EBC833478
035   $a(PPN)189907444
035   $a(EXLCZ)992550000000061332
100   $a20110208d2012||||  uy|         0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aUnification grammars /$fNissim Francez, Shuly Wintner
205   $a1st ed.
210  1$aCambridge :$cCambridge University Press,$d2012.
215   $a1 online resource (xii, 312 pages) $cdigital, PDF file(s)
300   $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
311 08$a1-107-01417-4 
320   $aIncludes bibliographical references (p. 299-305) and index.
327   $a1. Introduction; 2. Feature structures; 3. Unification; 4. Unification grammars; 5. Linguistic applications; 6. Computational aspects of unification grammars; 7. Conclusion; Appendixes.
330   $aGrammars of natural languages can be expressed as mathematical objects, similar to computer programs. Such a formal presentation of grammars facilitates mathematical reasoning with grammars (and the languages they denote), as well as computational implementation of grammar processors. This book presents one of the most commonly used grammatical formalisms, Unification Grammars, which underlies contemporary linguistic theories such as Lexical-Functional Grammar (LFG) and Head-driven Phrase Structure Grammar (HPSG). The book provides a robust and rigorous exposition of the formalism that is both mathematically well-founded and linguistically motivated. While the material is presented formally, and much of the text is mathematically oriented, a core chapter of the book addresses linguistic applications and the implementation of several linguistic insights in unification grammars. Dozens of examples and numerous exercises (many with solutions) illustrate key points. Graduate students and researchers in both computer science and linguistics will find this book a valuable resource.
606   $aGrammar, Comparative and general$xMathematical models
606   $aUnification grammar
606   $aLexical-functional grammar
606   $aHead-driven phrase structure grammar
615  0$aGrammar, Comparative and general$xMathematical models.
615  0$aUnification grammar.
615  0$aLexical-functional grammar.
615  0$aHead-driven phrase structure grammar.
676   $a415.01/51
686   $aCOM051010$2bisacsh
700   $aFrancez$b Nissim$052174
702   $aWintner$b Shuly$f1963-
801  0$bUkCbUP
801  1$bUkCbUP
906   $aBOOK
912   $a9910968042403321
996   $aUnification grammars$94427353
997   $aUNINA