2 Pages

J99-3007

Course: J 99, Fall 2009
School: UPenn
Rating:
 
 
 
 
 

Word Count: 815

Document Preview

Reviews Type-Logical Book Semantics Bob Carpenter (Lucent Technologies) Cambridge, MA: The MIT Press (Language, speech, and communication series), 1997, xxi+575 pp; hardbound, ISBN 0-262-03248-1, $60.00; paperbound, ISBN 0-262-53149-6, $35.00 Reviewed by Stephen Pulman University of Cambridge This is a very ambitious book, which tries to do several different things: give a detailed and self-contained...

Register Now

Unformatted Document Excerpt

Coursehero >> Pennsylvania >> UPenn >> J 99

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Reviews Type-Logical Book Semantics Bob Carpenter (Lucent Technologies) Cambridge, MA: The MIT Press (Language, speech, and communication series), 1997, xxi+575 pp; hardbound, ISBN 0-262-03248-1, $60.00; paperbound, ISBN 0-262-53149-6, $35.00 Reviewed by Stephen Pulman University of Cambridge This is a very ambitious book, which tries to do several different things: give a detailed and self-contained introduction to type-logical semantics and categorial grammar; illustrate this framework with a comprehensive set of illustrations of semantic analysis of English; and relate all of this to current research within the categorial tradition. It apparently derives from the author's "introductory" course on natural language semantics, but the end result is very far from introductory (I suspect it would scare most beginning linguistics students to death) and the book contains a great deal of original and insightful analysis of interesting semantic phenomena. The first chapter contains a potted introduction to the history of formal and linguistic semantics and related aspects of the philosophy of language and logic; the second consists of an extended introduction to the lambda calculus, combinators, types, etc, and the third is a development of the particular higher-order logic used later. Of these chapters, the first is relatively superficial, but the second and third are very detailed and, more importantly, very clean I would guess Carpenter is an excellent teacher: he presents difficult material in an appealing way, and doesn't go overboard on terse notation or Greek letters. Chapter 4 introduces various flavors of categorial grammar, and Chapter 5 describes the Lambek calculus. By this time we are 180 pages or so into the book, and I was beginning to realize that I didn't (even) know as much as I thought I did about categorial grammar. Semantic analysis of English starts off with coordination and unbounded dependencies (Chapter 6). Carpenter provides his own analysis of these phenomena, incorporating various devices from the categorial literature. His reference to earlier work, here and throughout the book, is always very good, with short summaries of approaches to particular issues by other scholars, showing how they differ, or can be seen as different ways of doing the same thing. Chapter 7 is a long discussion of quantifiers and scope problems. Carpenter starts with Montague's "quantifying in" and Cooper's storage approach to scoping, and then argues that the type-logical treatment he develops captures some of the good features of these approaches, while avoiding most of their descriptive and theoretical problems. He then goes on to a more general discussion of NP meanings, covering definites indefinites, and generics, and possessives, followed by a somewhat tangential but interesting approach to comparatives, and finally discussing existential sentences. Chapter 8 provides an analysis of plural NPs, again giving some very useful summaries of earlier approaches, and gradually developing a semantics that can cope 445 Computational Linguistics Volume 25, Number 3 with most of the familiar phenomena: collective, distributive, group readings, etc. Chapter 9 discusses those (rather few) cases of pronouns that lend themselves to a categorial treatment: reflexives and reciprocals, essentially. The final three chapters look at various types of intensionality. Chapter 10 introduces tense and modal logic, and possible-worlds semantics, and presents them within the type-theoretical framework developed earlier. Chapter 11 analyzes various types of control phenomena, opacity with intensional verbs; and Chapter 12 describes tense, aspect, and various types of temporal modification. A substantial appendix gives some introductory material on set theory, first-order logic, and Boolean algebras. This is a huge book, full of interesting material. You could read it as a synthesis of many current approaches to linguistic description within a categorial framework, or as an introduction to semantic analysis using higher-order logic. You can also dip into it as a reference book to get a quick summary of recent work within this tradition on one of the many areas of linguistic description covered. There is little that is overtly computational, but much that could be easily translated into several different computational frameworks....

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

UPenn - J - 00
Book ReviewsLocal Constraints vs. E c o n o m y David E. Johnson and Shalom Lappin (IBM Thomas J. Watson Research Center and King's College, University of London)Stanford, CA: CSLI Publications (Stanford monographs in linguistics), 1999, x+150 pp;
UPenn - J - 91
The Logical Structure of English: Computing Semantic Content Allan Ramsay(University College Dublin) London: Pitman, 1990, iv + 209 pp. Paperbound ISBN 0-273-03287-9, 19.99Reviewed by Martin Volk University of Koblenz-LandauH o w do you judge whe
UPenn - J - 04
Book ReviewHandbook for Language EngineersAli Farghaly (editor) (SYSTRAN Software Corporation) Stanford, CA: CSLI Publications (CSLI lecture notes, number 164) (distributed by the University of Chicago Press), 2003, xi+442 pp; hardbound, ISBN 1-575
UPenn - N - 04
HLT-NAACL 2004Human Language Technology Conference of the North American Chapter of the Association for Computational LinguisticsProceedings of the Main ConferenceMay 2-7, 2004 Boston, Massachusetts, USAISBN 1-932432-23-X900009 781932 432
UPenn - J - 90
Book ReviewsComputationalLinguistics: An IntroductionG6ran Maimgren describes regularities in polysemy: types of metaphoric transfer of meaning in nouns, regular extensions in verb meanings, and changes in adjective meanings as the argument chang
UPenn - J - 98
Book ReviewsCorpus-Based Methods in Language and Speech Processing Steve Young and Gerrit Bloothooft (editors)(Cambridge University and Utrecht University) Dordrecht: Kluwer Academic Publishers (Text, Speech and Language Technology series, edited b
UPenn - J - 01
Computational LinguisticsVolume 27, Number 2Learnability in Optimality Theory Bruce Tesar and Paul Smolensky(Rutgers University and The Johns Hopkins University) Cambridge, MA: The MIT Press, 2000, vii+140 pp; hardbound, ISBN 0-262-20126-7, $25.
UPenn - J - 93
Book ReviewsA n I n t r o d u c t i o n to M a c h i n e Translation W. John Hutchins and Harold L. Somers (University of East Anglia and University of Manchester Institute of Science and Technology)London: Academic Press, 1992, xxi + 362 pp. Hardb
UPenn - CIS - 610
Chapter 8 A Detour On Fractals8.1 Iterated Function Systems and FractalsA pleasant application of the Hausdor distance and of the xed point theorem for contracting mappings is a method for dening a class of self-similar fractals. For this, we can
UPenn - CIS - 610
Chapter 5 Lie Groups, Lie Algebras and the Exponential Map5.1 Lie Groups and Lie AlgebrasIn Chapter 2, we dened the notion of a Lie group as a certain type of manifold embedded in RN , for some N 1. Now that we have the general concept of a manif
UPenn - CIS - 610
Chapter 7 Geodesics on Riemannian Manifolds7.1 Geodesics, Local Existence and UniquenessIf (M, g) is a Riemannian manifold, then the concept of length makes sense for any piecewise smooth (in fact, C 1) curve on M . Then, it possible to dene the s
UPenn - CIS - 610
Chapter 6 The Classication Theorem for Compact Surfaces6.1 Cell ComplexesIt is remarkable that the compact (two-dimensional) polyhedras can be characterized up to homeomorphism. This situation is exceptional, as such a result is known to be essent
UPenn - CIS - 610
Chapter 4 The Fundamental Group, Orientability4.1 The Fundamental GroupIf we want to somehow classify surfaces, we have to deal with the issue of deciding when we consider two surfaces to be equivalent. It seems reasonable to treat homeomorphic su
UPenn - CIS - 610
Chapter 4 Polyhedra and Polytopes4.1 Polyhedra, H-Polytopes and V-PolytopesThere are two natural ways to dene a convex polyhedron, A: (1) As the convex hull of a nite set of points. (2) As a subset of En cut out by a nite number of hyperplanes, mo
UPenn - CIS - 511
Chapter 8 Phrase-Structure Grammars and Context-Sensitive Grammars8.1 Phrase-Structure GrammarsContext-free grammars can be generalized in various ways. The most general grammars generate exactly the recursively enumerable languages. Between the c
UPenn - CIS - 610
Chapter 4 Basics of Classical Lie Groups: The Exponential Map, Lie Groups, and Lie AlgebrasLe rle prpondrant de la thorie des groupes en mathmatiques a t longtemps o e e e e ee insouponn; il y a quatre-vingts ans, le nom mme de groupe tait ignor. Ce
UPenn - CIS - 511
Chapter 6 Elementary Recursive Function Theory6.1 Acceptable IndexingsIn a previous Section, we have exhibited a specic indexing of the partial recursive functions by encoding the RAM programs. Using this indexing, we showed the existence of a uni
UPenn - CIS - 610
Chapter 4 Manifolds, Tangent Spaces, Cotangent Spaces, Vector Fields, Flow, Integral Curves4.1 ManifoldsIn Chapter 2 we dened the notion of a manifold embedded in some ambient space, RN . In order to maximize the range of applications of the theor
UPenn - CIS - 610
Chapter 8 The Log-Euclidean Framework Applied to SPD Matrices and Polyane Transformations8.1 IntroductionIn this Chapter, we use what we have learned in previous chapters to describe an approach due to Arsigny, Fillard, Pennec and Ayache to dene a
UPenn - CIS - 610
Chapter 6 Riemannian Manifolds and Connections6.1 Riemannian MetricsFortunately, the rich theory of vector spaces endowed with a Euclidean inner product can, to a great extent, be lifted to various bundles associated with a manifold. The notion of
UPenn - CIS - 610
Chapter 4 Partial Orders, Lattices, Well Founded Orderings, Equivalence Relations, Distributive Lattices, Boolean Algebras, Heyting Algebras4.1 Partial OrdersThere are two main kinds of relations that play a very important role in mathematics and
UPenn - CIS - 610
Chapter 2 Relations, Functions, Partial Functions2.1 What is a Function?We use functions all the time in Mathematics and in Computer Science. But, what exactly is a function? Roughly speaking, a function, f , is a rule or mechanism, which takes in
UPenn - STAT - 102
Homework 1Spring 2007(HW for Sections 2 & 3 (Zhao) is due in class on Jan. 16th and for Section1 is due in class on Jan. 17th.)Read: Chapter 2: Sections 2.1 through 2.7 should be review. Sections 2.8 & 2.9 may be newWritten HW: Problems 2.25,
UPenn - STAT - 102
Statistics 102Lecture 2L. Brown & L. ZhaoSpring 2007Tests and Confidence Intervals for Two MeansRead: Sections 2.7 and 2.8 of Dielman Do advertisements help to increase store sales? Data from two independent samples Analysis assuming equal
UPenn - STAT - 102
Department of Statistics The Wharton School University of Pennsylvania Statistics 102L. Brown & L. ZhaoSpring 2007Administrative IssuesWeb site www-stat.wharton.upenn.edu/~stat102 TEXT: Dielman, T. Applied Regression Analysis Fourth Edition,
UPenn - STAT - 011
UPenn - STAT - 542
Stat 542 Homework 1 - Due Thursday, February 12th at 10:30am You are required to submit a hard copy document in class with answers to the following questions. This document must be generated using the LaTeX typesetting language. It should also includ
UPenn - STAT - 430
STAT 430SyllabusFall 2008Statistics 430: ProbabilityMW 12:00-1:30, 1:30-3:00 @ JMHH F50Professor: T. Tony Cai, tcai@wharton.upenn.edu, Oce: JMHH 469. Oce hours: Tuesday 9:15 - 11:00am. Teaching Assistant: Dongyu Lin, dongyu@wharton.upenn.edu
UPenn - PHYS - 151
Physics 151Electric ChargeCoulombs Law of ForceElectric FieldsGausss Law Electric Potenial CapicitanceElectric CurrentConductors DC Electric CircuitsMagnetic FieldsBiot-Savart Law and Amperes Law Inductance and Faradays LawElectromagneti
UPenn - ASTRO - 12
Recommended exercises pre-Test 1Galaxy formationConsider a spherical and homogeneous proto galactic cloud of mass M = 6 1011 Msolar , radius R = 100 Kpc. Write the expression for the free fall time as a function of its mass and radius. Evaluate th
UPenn - ASTRO - 12
EBSCOhost04/17/2006 10:44 PMBack8 page(s) will be printed.Record: 1 Title: READING THE BLUEPRINTS of CREATION. Authors: Strauss, Michael A.1 Source: Scientific American; Feb2004, Vol. 290 Issue 2, p54-61, 8p, 1 graph, 11c Document Type: Artic
UPenn - P - 622
Introduction to Elementary Particle PhysicsPhysics 622, Fall 2002Physics 622, Introduction to Elementary Particle Physics, will be oered in Fall 2002. This course is recommended for both theory and experimental students in particle physics. The co
UPenn - PHPQUEBEC - 2007
Leveraging the Power of Oracle with PHPTaking Advantage of the Database PHP Quebec 2007Roberto Mansfield University of Pennsylvania School of Arts & SciencesDisclaimerI really like MySQL. I'm not bashing MySQL. Some of my best projects use M
UPenn - P - 00
Multi-Component TAG and Notions of Formal PowerInst. for Research in Cognitive Science University of Pennsylvania Suite 400A, 3401 Walnut Street fschuler,dchiangg@linc.cis.upenn.edu Philadelphia, PA 19104-6228madras@linc.cis.upenn.eduWilliam Schu
UPenn - C - 90
Expressive Power of Grammatical FormalismsAlexis Manaster-Ramer & Wlodek Zadrozny IBM Research T. J. Wat~n Research Center Yorktown Heights, NY 10598 AMR @ IBM.COM WLODZ @ IBM.COMAbstractWe propose formalisms and concepts which allow to make prec
UPenn - C - 96
The Powerof W o r d s Michaelin M e s s a g e ZockPlanningLanguage & Cognition LIMSI - C.N.R.S., B.P. 133 91403 Orsay, France zock@|imsi.frAbstract: Before engaging in a conversation, a message must be planned. While there are many ways to
UPenn - J - 89
A PARSING ALGORITHM FOR UNIFICATION GRAMMAR Andrew HaasD e p a r t m e n t of C o m p u t e r Science State University of N e w York at A l b a n y A l b a n y , N e w York 12222We describe a table-driven parser for unification grammar that combin
UPenn - C - 90
Sentencedisambiguation by document preference setsorientedHirohito INAGAKI, Sueharu MIYAHARA, Tohru NAKAGAWA, and Fumihiko OBASHI NTT Human Interface Laboratories NTT Intelligent Technology Co.,Ltd. 1-2356, Take , Yokosuka-Shi, 223-1,Yamashita-
UPenn - C - 90
project note with software demonstrationA p a r s e r without a dictionary as a tool for research into F r e n c h s y n t a xJacques VERGNELIMSI 29 rue Titon F-75011 Paris FranceA natural languagelanguageis nota formalThat is why the s
UPenn - C - 69
COMPUTER-AIDED RESEARCH ON SYNONYMY AND ANTONYMY *H. P. Edmundson University of Maryland, College Park, Md., U.S.A. and Martin N. Epstein National Institutes of Health, Bethesda, Md., U.S.A.AbstractThis research is a continuation of that report
UPenn - C - 80
PROCESSING OF SYNTAX AND SEMANTICS OF NATURAL LANGUAGE BY PREDICATE LOGIC Hiroyuki YamauchiInstitute of Space and Aeronautical Science, University of Tokyo 4-6-1 Komaba, Meguro-ku, Tokyo 153, JapanSummary The syntax and semantic analyses of natur
UPenn - P - 84
The Design of a Computer Language for Linguistic InformationStuart M. ShieberArtificial Intelligence Center SRI International and Center for the Study of Language and Information Stanford UniversityAbstractA considerable body of accumulated know
UPenn - J - 91
The Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammars with Lexical RulesBob C a r p e n t e r * Carnegie Mellon UniversityIn this paper, it is shown that the addition of simple and linguistically motivated forms of
UPenn - P - 01
Constraints on strong generative powerDavid Chiang University of Pennsylvania Dept of Computer and Information Science 200 S 33rd St Philadelphia, PA 19104 USA dchiang@cis.upenn.edu AbstractWe consider the question How much strong generative power
UPenn - H - 92
Minimizing Speaker Variation Effects for Speaker-Independent Speech RecognitionXuedong HuangSchool of Computer Science Carnegie Mellon University Pittsburgh, PA 15213ABSTRACT For speaker-independent speech recognition, speaker variation is one of
UPenn - H - 92
Applying SPHINX-II to the DARPA Wall Street Journal CSR TaskF. Alleva, H. Hon, X. Huang, M. Hwang, R. Rosenfeld, R. WeideSchool o f Computer Science Carnegie Mellon University Pittsburgh, Pennsylvania 15213ABSTRACTThis paper reports recent effor
UPenn - C - 65
161965 International Conference on Computational LinguisticsSETS O F G R A M M A R SBETWEENCONTEXT-FREEA N D CONTEXT-SENSITIVEPeter KugelTechnical Operations Research South Avenue Burlington, Mass. U.S.A.,:;~''e/%,'#.A B S
UPenn - H - 93
An Overview of the SPHINX-II Speech Recognition SystemXuedong Huang, Fileno Alleva, Mei-Yuh Hwang, and Ronald RosenfeldSchool of Computer Science Carnegie Mellon University Pittsburgh, PA 15213ABSTRACTIn the past year at Carnegie Mellon steady p
UPenn - T - 87
On Formal Versus CommonsenseDavid Israel AI Center and CSLI SRI InternationalSemanticsThere is semantics and, on the other hand, there is seraan~ics. And then there is the theory of meaning or content. I shall speak of pure mathematical semantic
UPenn - H - 89
ACOUSTICAL PRE-PROCESSING FOR ROBUST SPEECH RECOGNITION Richard M. Stern and Alejandro Acero 1 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 ABSTRACTIn this paper we describe our initial efforts to make SPHINX, the CMU c
UPenn - H - 90
E x p e r i m e n t s with T r e e - S t r u c t u r e d Encoders on the R M TaskSpeech Systems Incorporated 18356 Oxnard Street Tarzana, California 91356MMIMark T. Anikst, William S. Meisel, Matthew C. StaresKai-Fu LeeCarnegie Mellon Univers
UPenn - E - 03
203204205206
UPenn - P - 89
A HYBRID APPROACH TO REPRESENTATION IN THE JANUS NATURAL LANGUAGE PROCESSOR Ralph M. Weischedel BBN Systems and Technologies Corporation 10 Moulton St. CambHdge, MA 02138AbstractIn BBN's natural language understanding and generation system (Janus)
UPenn - E - 89
It Would Be Much Easier If W E N T W e r e G O E DDan TUFIS Institute for Computer Technique and Informatics 8-10, Miciurin Bd., 71316 Bucharest 1, Romania Tel. 653390, Telex 1189t-icpci-rABSTRACT The paper proposes a paradigmatic approach to morp
UPenn - H - 89
Automatic New Word Acquisition: Spelling from AcousticsFil Alleva and Kai-Fu Lee School of Computer Science Carnegie Mellon University Pittsburgh, PAAbstractThe problem of extending the lexicon of words in an automatic speech recognition system i
UPenn - C - 88
Iqae P S I / P H I architecture for prosodic parsing Dafydd GIBBON and Gunter BRAUNFaculty of Linguistics and Literary Studies University of Bielefeld Postfach 8640 D - 4 8 0 0 Bielefeld IAbstract In this paper an architecture and an implementati
UPenn - C - 88
~,=~ ~{:,j:b~[i- . ,i~ H '{~,~ ~:!i+~,~_~ -el'tiler i~ti' [Vtai}bliit~ -i rrii'l.sl:l{ii~n and Oeitlpalt~r {-Ji}ieiic~, 8ap~i~r~i~)itl; Oaii t ~!gi~J-~'iellc~li Ui~iwtrsil 7 Pltl~_~bt!rgli, i~Ait;41,'l, t.ISAl.e~icoii-drtvert forinalisi'ns (e,{
UPenn - MONTEREY - 06
Institute for Software Integrated SystemsVanderbilt UniversityService-Oriented Architectures for Networked Embedded Sensor SystemsXenofon KoutsoukosManish Kushwaha, Isaac Amundson, Sandeep Neema, Janos SztipanovitsMotivation: Chemical Cloud Tr
UPenn - D - 07
Characterizing the Errors of Data-Driven Dependency Parsing ModelsRyan McDonald Google Inc. 76 Ninth Avenue New York, NY 10011 ryanmcd@google.com Joakim Nivre V xj University Uppsala University ao 35195 V xj ao 75126 Uppsala Sweden Sweden nivre@msi.
UPenn - C - 02
A Comparative Evaluation of Data-driven Models in Translation Selection of Machine TranslationYu-Seop Kim Jeong-Ho Chang Byoung-Tak Zhang Ewha Institute of Science and Technology, Ewha Womans Univ. Seoul 120-750 Korea, yskim01@ewha.ac.kr Schools of
UPenn - A - 88
CREATING AND QUERYING LEXICAL DATA BASESMary S. Neff, Roy J. Byrd, and Omneya A. Rizk IBM T. J. Watson Research Center P. O. Box 704 Yorktown Heights, New York 10598ABSTRACT Users of computerized dictionaries require powerful and flexible tools fo