CAS LX 522 Syntax I. Case. [ucase:acc] [ucase:nom] Pronouns. NPs need case
|
|
- Noah Hunter
- 5 years ago
- Views:
Transcription
1 CAS LX 522 Syntax I Case, agreement, and the passie 11 (chapter 6 continues) Case Recall that s in English show distinctions in case: Subject s are in nominatie case Object s are in accusatie case How can we ensure the correlation? 1) I saw her. 2) She saw me. 3) hey saw him. [ucase: Nominatie subjects generally appear in the specifier of a finite. Finite is pretty much any kind of except the infinitie. We can treat case like we treated tense inflection: Suppose also has a [ucase: feature. Suppose nominatie s hae a [ucase:] feature. Suppose the [ucase: on can alue [ucase:] on the, checking both. So needs a nom, and a nom needs. [ucase: Subjects check nominatie case with. Objects hae accusatie case, which we can treat in the same kind of way. Suppose has [ucase:. Suppose accusatie s hae [ucase] Suppose the [ucase: on can alue the [ucase:] feature on the, checking both. Nominatie case is a relation between (finite) and an, accusatie case is a relation between and an. Pronouns Nominatie case is associated with finite. She will charm snakes. I want her to charm snakes. I expect her to charm snakes Non-finite is not associated with nominatie case. It s not actually associated with accusatie case either, but we ll come back to that later. Because s hae an unalued [ucase:] feature, we can suppose that s always enter the numeration the same way, and are alued based on where they are Merged. [N, ucase:, ] s need case Although in English we only see the morphological effect of case on s, we assume that all s hae an unalued [ucase:] feature. Plenty of languages other than English show case on all s, not just on s. Case is something that goes with being an. It s just something you often don t hear in English. Notational shortcuts: [ is used for [ucase: (on, or when checked) [ is used for [ucase: (on, or when checked) [case] is used for [ucase:] (on an )
2 Subject-erb agreement Recall that in English, the φ-features of the subject hae an effect on the morphology of the erb: 1) Fans were rioting on Comm Ae. 2) A fan was rioting on Comm Ae. While we re here, we might as well account for this too. It is also an agreement relation, between the subject and, eentually, the erb (or auxiliary, if there is one). Subject-erb agreement What we re after is this: he subject (the thing that s getting nominatie case) should share/check φ-features with the thing that gets inflection from tense. he releant inflection is alued by. he φ-features are on the that checks nominatie case with. Maybe it s passed from the to, then from to the uinfl: below. 1) Fans were rioting on Comm Ae. 2) A fan was rioting on Comm Ae. 3) Fans riot on Comm Ae. 4) A fan riots on Comm Ae. [ucase: Subject-erb agreement So. he erb gets its tense inflection specified by when, e.g., the [tense:pres] feature of alues the [uinfl:] feature of. Since the subject already agrees with (the [ feature of checks the [case] feature of the subject), we ll incorporate subject agreement into this process. Notice that we still want this agreement to be mediated by (sometimes it alues, e.g., Perf): 1) hey hae been reading noels. 2) She has been reading noels. [ucase: ] Subject-erb agreement Suppose then that has a [uφ:] feature as well. he subject has (interpretable) φ-features that alue the [uφ:] feature of. Fans were rioting on Comm Ae. [, un*, uφ:, fans [N, φ:pl, case] So, once is in the structure, c-commanding fans in SpecP, we get: [, un*, uφ:pl, fans [N, φ:pl, [ucase: [ucase: ] [ucase: [ucase: Subject-erb agreement Finally, we suppose that the (checked) [uφ:pl] feature of, also alues a [uinfl:] feature on a lower (or Perf, or Prog). So, let s walk through it. We start by merging like and the 3pl. he rules of pronunciation will tell us that a with the erb riot adjoined to it sounds like: riots if has the feature [uinfl:pres,sg] riot if has the feature [uinfl:pres,pl] Notice that alues a [uinfl:] feature all at once, with any releant feature(s) it has (so, tense and φ-features both). likes [N, :3pl, case,... ]
3 [, un*, uinfl:, u*, We Merge with (HoP). he [ on matches, alues, and checks the [case] on the, checking itself as well. Agree is lazy, we can do this without any further Merging or Moing. [, un*, uinfl:, u*, likes he moes up to adjoin to to check the [u*] feature of. likes [, un*, uinfl:, u*, < > he moes up to adjoin to to check the [u*] feature of. he 3sg feminine is Merged to check the [un*] feature of. P he is Merged with P (HoP). he [ feature of matches, alues, and checks the [case] feature of the, checking itself in the process. [N, :3fsg, case] likes [, un*, uinfl:, u*, < > [, tense:pres, u :, un*, [N, :3fsg, P likes [, un*, < > uinfl:, u*, he [φ:3fsg] feature of alues and checks the [uφ:] feature of. [, tense:pres, u :3fsg, un*, [N, :3fsg, P likes [, un*, u*, acc, uinfl:pres3fsg] < > he [uφ:3fsg] and [tense:pres] features of alue and check the [uinfl:] feature of. [, tense:pres, u :3fsg, un*, [N, :3fsg, P likes [, un*, u*, acc, uinfl:pres3fsg] From now on: (Finite) can only alue a lower [uinfl:] feature once itself has a alue for [φ]. Both [tense] and [φ] alue the lower [uinfl:] feature. First step is always to check the [uφ:] feature on, after which will check the lower [uinfl:] feature. < >
4 P [N, :3fsg, [, tense:pres, u :3fsg, un*, Finally, the is moed up and Merged with ʹ in order to check the P < > likes [, un*, u*, acc, uinfl:pres3fsg] EPP feature (the [un*] feature) of. < > P [N, :3fsg, [, tense:pres, u :3fsg, un*, P < > likes [, un*, u*, acc, uinfl:pres3fsg] All uninterpretable features are checked, the pronunciation rules gie us she likes them. < > he case of prepositional objects Consider the case of the object of a preposition: Computers near me. Now that we e incorporated case into our system, we re stuck with it. Noun phrases come with case. Computers has case (nominatie) and me has case (accusatie). he question is: How is the case of me checked? Computers near me Computers is unaccusatie; there s no agent, and is the heme/patient, it is the affected object. hus, we hae in our numeration: unaccusatie[, uinfl:, u*] [N, φ:3pl, case] [, uφ:, pres, nom, un*] As well as near and me, which we ll get to in a moment. Computers First, let s just do. We start by merging and. Computers [, uinfl:, u*] We Merge with (HoP). P [N, :3pl, case] [, u*, uinfl:] [N, :3pl, case]
5 Computers he moes up to adjoin to to check the [u*] feature of. P [, u*, uinfl:] < > [N, :3pl, case] Computers he is Merged with P (HoP). has the features: [, pres, uφ:, un*,. he [ feature of can now match the [case] feature of. [, tense:pres, u :, un*, P [, u*, uinfl:] < > [N, :3pl, case] Computers he [ feature of matches, alues, and checks the [case] feature of, checking itself in the process. he [uφ:] feature of can also match the [φ:3pl] feature of. [, tense:pres, u :, un*, P [, u*, uinfl:] < > [N, :3pl, Computers he [φ:3pl] feature of matches, alues, and checks the [uφ:] feature of. he [tense:pres] feature of matches the [uinfl:] feature of, which will be alued by both the tense and φ-features of. It s [tense:pres] that matches the [uinfl:] feature, but the φ- features come along when the [uinfl:] feature is alued. [, tense:pres, P [, u*, uinfl:] < > [N, :3pl, Computers he [un*] feature of matches the [N] feature of. his is not sufficient to check the [un*] feature because they are not local, so is moed up to SpecP. Computers Once the [N] feature of is a sister to the ʹ that has the [un*] feature (the feature projects from to ʹ it s the same feature), the [un*] feature is checked. P [, tense:pres, P [, u*, < > [N, :3pl, [N, :3pl, [, tense:pres, P < > < > [, u*,
6 Computers near me Now, let s consider Computers near me. Me is clearly accusatie. here s nothing here that can alue a case feature as accusatie. hat s why I chose. All we re adding to this is me (which has accusatie case) and the P near. P [N, :3pl, [, tense:pres, P < > < > [, u*, Computers near me Conclusion: It must be near that is responsible for the accusatie case on me. P [N, :3pl, [, tense:pres, P near [P, un*, P [N, :1sg, case] < > < > [, u*, Computers near me Merge near and me (1sg ). he [N] feature of me checks the [un*] feature of near. he [ feature of near alues and checks the [case] feature of me (checking itself in the process). Near me he last step: Adjoin the PP to the P. o the P? Near me can appear on either side of P, not P. Computers near me P PP P PP P near [P, un*, [N, :1sg, [N, :3pl, [, tense:pres, P P near [P, un*, < > < > [, u*, [N, :1sg, P checks accusatie So, in general: A preposition P... Has a [P] category feature Has a [un*] feature, motiating a Merge with its object. Has an [ feature, aluing and checking the [case] feature of its object. has [], [un*] (EPP), [uφ:], [ has [], [uinfl:], [u*], and, if assigns a θ-role, it has [un*] and [. Double-object constructions We e by now coered the sentence 1) Pat gae books to Chris. Pat, books, and Chris are all noun phrases, they all need case. Pat gets (nom) case from. books gets (acc) case from. Chris gets (acc) case from P (to). What about Pat gae Chris books? he hae kind of gie must hae an [ feature.
7 Aderbs Before today, we d always drawn adjuncts as adjoined to P. his explains why sloppily can be either to the left or to the right of P: 1) Pat sloppily ate lunch. 2) Pat ate lunch sloppily. 3) Pat has sloppily eaten lunch. 4) Pat has eaten lunch sloppily. Sloppily also seems to be able to adjoin to PerfP or ProgP, at least marginally. 5)?Pat might sloppily hae eaten lunch. 6)?Pat should sloppily be eating lunch. But it can t be between a subject and : 7) *Pat sloppily might eat lunch. Manner s. propositional aderbs sloppily, slowly, quickly all describe the manner in which an action takes place. hese are manner aderbs. hey adjoin to P. here are other kinds of aderbs as well, howeer. One such kind are propositional aderbs: perhaps, fortunately, interestingly. hese express a kind of attitude on the part of the speaker toward the content of the sentence. Propositional & temporal aderbs Propositional aderbs seem to adjoin to P. 1) Fortunately, Pat ate lunch. 2) Pat ate lunch, fortunately. 3)?Pat fortunately ate lunch. 4)?Pat might hae fortunately eaten lunch. emporal aderbs also seem to adjoin high. 5) oday Pat ate lunch. 6) Pat ate lunch today. 7) *Pat today ate lunch. Aderb positions Generally speaking, where an aderb attaches depends on its meaning. P for manner aderbs, P for temporal aderbs, Notice that we predict this now: 1) Yesterday [Pat completely [finished lunch]]. 2) Yesterday [Pat [finished lunch] completely]. 3) Pat [[finished lunch] completely] yesterday. 4) Pat [completely [finished lunch]] yesterday. 5) *Pat [[finished lunch] yesterday completely. Later, perhaps, we ll consider additional complexity in aderb placement. Passies he passie construction is one where: he original subject disappears (or becomes a by-phrase) he original object becomes the subject. he erb appears as be+passie participle. he passie participle in English sounds just like the perfectie participle. Pat took pretzels. actie Pretzels were taken (by Pat). passie Passies Pat stole books. Books were stolen (by Pat). In both cases, books is getting the heme/patient θ-role. By UAH, it must be originally Merged as daughter of, in both the actie and the passie. In fact, the passie is a lot like the unaccusatie. An underlying object becomes the subject.
8 Passies All we need is the passie auxiliary Pass. be [Pass, uinfl:] selects a unaccusatie. By selecting for unaccusatie, the passie auxiliary remoes an Agent. Not allowed for intransities, an open mystery. *It was danced (by Pat) he passie auxiliary works like other auxiliaries: Pass can alue a lower [uinfl:] feature, if Pass own [uinfl:] feature is alued by a [tense] feature, it is strong. Lunch was not eaten. Pass is the last auxiliary in the HoP: Lunch may not hae been being eaten. > (Neg) > (M) > (Perf) > (Prog) > (Pass) > > For, we Merge eat and lunch to build the, then Merge an unaccusatie P [, u*, uinfl:] eat [N, lunch :3sg, case] he moes up to adjoin to to check the [u*] feature of. he Pass auxiliary is Merged (HoP). [Pass] matches, alues, checks [uinfl:] on. is Merged (HoP). [ on matches, alues, checks [case] on lunch. [φ:3sg] on lunch matches, alues, checks [uφ:] on. [past] on matches, alues [uinfl:] on Pass. is Merged (HoP). [ on matches, alues, checks [case] on lunch. [φ:3sg] on lunch matches, alues, checks [uφ:] on. [past] on matches, alues [uinfl:] on Pass. is Merged (HoP). [ on matches, alues, checks [case] on lunch. [φ:3sg] on lunch matches, alues, checks [uφ:] on. [past] on matches, alues [uinfl:] on Pass.
9 Pass moes to (checks [uinfl:past*] on Pass). Lunch moes to SpecP (checks [un*] on ). Ditransitie passies Consider again Pat gae Chris books. Chris was gien books. *Books were gien Chris. Pat gae books to Chris. Books were gien to Chris. *Chris was gien books to. Where does the by-phrase attach? Aderb tests can gie us a hint he sandwich was eaten by Pat today at noon he sandwich was eaten by Pat at noon today he sandwich was eaten today _ by Pat _ at noon he sandwich was eaten at noon _ by Pat _ today he dishes were washed by Pat _ poorly _ yesterday he dishes were washed poorly by Pat yesterday he sandwich was eaten by Pat _ sloppily _ at noon he sandwich was eaten sloppily by Pat at noon Conclusion?
CAS LX 522 Syntax I. Case. [ucase:acc] [ucase:nom] Pronouns. NPs need case
CAS LX 522 Syntax I Week 9b. Case, agreement, and the passie (chapter 6 continues) Case Recall that s in English show distinctions in case: Subject s are in nominatie case Object s are in accusatie case
More informationCAS LX 522 Syntax I. Subject-verb agreement. Subject-verb agreement. Subject-verb agreement. Subject-verb agreement. Subject-verb agreement
CAS LX 522 Syntax I Case, agreement, and the passie (chapter 6 continues) 12 Subject-erb agreement Recall that in English, the φ-fures of the subject hae an effect on the morphology of the erb: 1) Fans
More information2 Agreement, inflection, and the auxiliary system
LX 422/722 Intermediate Syntax Fall 2018 Notes at the end of a semester 1 How these notes relate to the preious notes his is a followup to some notes that I had intended to hand out before the midterm.
More informationElementary Operations, Clausal Architecture, and Verb Movement
Introduction to Transformational Grammar, LINGUIST 601 October 3, 2006 Elementary Operations, Clausal Architecture, and Verb Movement 1 Elementary Operations This discussion is based on?:49-52. 1.1 Merge
More informationClausal Architecture and Verb Movement
Introduction to Transformational Grammar, LINGUIST 601 October 1, 2004 Clausal Architecture and Verb Movement 1 Clausal Architecture 1.1 The Hierarchy of Projection (1) a. John must leave now. b. John
More information1. He considers himself to be a genius. 2. He considered dieting to be unnecessary. 3. She considered that the waffle iron was broken. 4.
1. He considers himself to be a genius. 2. He considered dieting to be unnecessary. 3. She considered that the waffle iron was broken. 4. He finally managed to get the bill paid. 5. I see you found the
More informationUnit 4 Voice. Answer Key. Objectives
English Two Unit 4 Voice Objectives After the completion of this unit, you would be able to explain the functions of active and passive voice transform active sentences into passive and passive sentences
More informationFractions and their Equivalent Forms
Fractions Fractions and their Equivalent Forms Little kids use the concept of a fraction long before we ever formalize their knowledge in school. Watching little kids share a candy bar or a bottle of soda
More informationLing/CSE 472: Introduction to Computational Linguistics. 5/9/17 Feature structures and unification
Ling/CSE 472: Introduction to Computational Linguistics 5/9/17 Feature structures and unification Overview Problems with CFG Feature structures Unification Agreement Subcategorization Long-distance Dependencies
More informationThe anatomy of a syntax paper
The anatomy of a syntax paper Seminar week 4: Understanding the Theory of Syntax, Summer 2014 Asad Sayeed Uni-Saarland Asad Sayeed (Uni-Saarland) The anatomy of a syntax paper 1 There is a special secret
More informationANALYSING TURNS IN TELEPHONING
Analysing Turns in Telephoning ESP-Receptionist 28 ANALYSING TURNS IN TELEPHONING Your study of the first two units emphasizes politeness and efficiency on the phone. Which of the options will you choose?
More information2 Ambiguity in Analyses of Idiomatic Phrases
Representing and Accessing [Textual] Digital Information (COMS/INFO 630), Spring 2006 Lecture 22: TAG Adjunction Trees and Feature Based TAGs 4/20/06 Lecturer: Lillian Lee Scribes: Nicolas Hamatake (nh39),
More informationComputational Linguistics: Feature Agreement
Computational Linguistics: Feature Agreement Raffaella Bernardi Contents 1 Admin................................................... 4 2 Formal Grammars......................................... 5 2.1 Recall:
More informationIntroduction to Lexical Functional Grammar. Wellformedness conditions on f- structures. Constraints on f-structures
Introduction to Lexical Functional Grammar Session 8 f(unctional)-structure & c-structure/f-structure Mapping II & Wrap-up Summary of last week s lecture LFG-specific grammar rules (i.e. PS-rules annotated
More informationCHAPTER 10. The Passive
CHAPTER 10 The Passive CONTENTS 10-1 Active sentences and passive sentences(cg-26.1) 10-2 Form of the passive(cg-26.2) 10-3 Transitive and intransitive verbs(cg-26.3) 10-4 Using the by-phrase(cg-26.4)
More information10-1 Active sentences and passive sentences
CONTENTS 10-1 Active sentences and passive sentences 10-2 Form of the passive 10-3 Transitive and intransitive verbs 10-4 Using the by-phrase 10-5 The passive forms of the present and past progressive
More informationLogical Connectives. All kittens are cute. ; I like pizza. ; The sky is blue. ; Triangles have three sides.
Logical Connectives We have learned what a statement is. Recall that a statement is just a proposition that asserts something that is either true or false. For instance, these are propositions: All kittens
More informationF08: Intro to Composition
F08: Intro to Composition Semantics - Ling 331/731 University of Kansas 1 erbs as functions (1). Here is a sadly simplified sentence structure: S P P There are two lexical items that feed this structure:
More informationFractions and their Equivalent Forms
Fractions Fractions and their Equivalent Forms Little kids use the concept of a fraction long before we ever formalize their knowledge in school. Watching little kids share a candy bar or a bottle of soda
More informationCOMMA RULE 1: COMMAS IN A SERIES (ITEMS IN A SERIES)
COMMA RULE 1: COMMAS IN A SERIES (ITEMS IN A SERIES) Use a comma to separate three or more items in a series. 1. Sam, Ed, and Gloria sat down. 2. They passed the plate, served the scrumptious food, and
More informationFractions and their Equivalent Forms
Fractions Fractions and their Equivalent Forms Little kids use the concept of a fraction long before we ever formalize their knowledge in school. Watching little kids share a candy bar or a bottle of soda
More informationSyntax 380L December 4, Wh-Movement 2. For notational convenience, I have used traces (t i,t j etc.) to indicate copies throughout this handout.
Syntax 380L December 4, 2001 Wh-Movement 2 For notational convenience, I have used traces (t i,t j etc.) to indicate copies throughout this handout. 1 The Basics of wh-movement (1) Who i does John think
More informationWhen using and, or, or nor, people sometimes omit the last comma. This, however, can make sentences unclear.
Commas in a series Use commas to separate items in a series/list Ex. Beasley likes to eat, sleep, and bark. (words) Beasley is naughty in the morning, during school, and at night. (phrases) When using
More informationNotebook Assignments
Notebook Assignments These six assignments are a notebook using techniques from class in the single concrete context of graph theory. This is supplemental to your usual assignments, and is designed for
More informationThe LC3's micro-coded controller ("useq") is nothing more than a finite-state machine (FSM). It has these inputs:
midterm exam COSC-120, Computer Hardware Fundamentals, fall 2012 Computer Science Department Georgetown University NAME Open books, open notes (laptops included). Show and explain all your work. Answers
More informationAttach Love From Mr Mrs. Miss Ms Sir Sirs Madam. CC BCC Best Unfortunately, XXX. Bye Regards Re: Ref./ Reference. To: Btw Tel.
Email and telephoning vocabulary and collocations Choose one of the cards below and explain what it means and how it is used without saying the words on the card until your partner guesses what it says.
More informationThe Writer s Guild. Commas
The Writer s Guild Commas Commas and periods are the most frequently used punctuation marks. Commas customarily indicate a brief pause; they're not as final as periods. Rule 1. Use commas to separate words
More information10 Tips For Effective Content
10 Tips For Effective Email Content Nowadays when it comes to online marketing, and the Internet as a whole, so many people are being added to so many email lists. They're being bombarded constantly by
More informationValuable points from Lesson 6 Adobe Flash CS5 Professional Classroom in a Book
Valuable points from Lesson 6 Adobe Flash CS5 Professional Classroom in a Book You are expected to understand and know how to use/do each of these tasks in Flash CS5, unless otherwise noted below. If you
More informationHot X: Algebra Exposed
Hot X: Algebra Exposed Solution Guide for Chapter 11 Here are the solutions for the Doing the Math exercises in Hot X: Algebra Exposed! DTM from p.149 2. Since m = 2, our equation will look like this:
More informationSection 7D Systems of Linear Equations
Section 7D Systems of Linear Equations Companies often look at more than one equation of a line when analyzing how their business is doing. For example a company might look at a cost equation and a profit
More informationCat Magic. - The Hole -
Cat Magic - The Hole - By: Billy Hammond Keisuke is a student. He lives in Sumiyoshi-ku in Osaka. He is twelve. He has a sister. Her name is Yumi. She is eleven. They like cats. They have a cat named Ootama.
More informationFrom video conversation 2. This is a gap fill exercise and can be used as either a quiz/test of
Teacher s guide to the quizzes/tests available for Unit 4 Quiz 1 Quiz 2 Quiz 3 Quiz 4 From video conversation 1. This is a gap fill exercise and can be used as either a quiz/test of target language acquisition,
More informationIf Statements, For Loops, Functions
Fundamentals of Programming If Statements, For Loops, Functions Table of Contents Hello World Types of Variables Integers and Floats String Boolean Relational Operators Lists Conditionals If and Else Statements
More informationGenerating Animation from Natural Language Texts and Semantic Analysis for Motion Search and Scheduling
The Visual Computer manuscript No. (will be inserted by the editor) Generating Animation from Natural Language Texts and Semantic Analysis for Motion Search and Scheduling Masaki Oshita Received: date
More informationLecture 1: Overview
15-150 Lecture 1: Overview Lecture by Stefan Muller May 21, 2018 Welcome to 15-150! Today s lecture was an overview that showed the highlights of everything you re learning this semester, which also meant
More informationLecture 14: Annotation
Lecture 14: Annotation Nathan Schneider (with material from Henry Thompson, Alex Lascarides) ENLP 23 October 2016 1/14 Annotation Why gold 6= perfect Quality Control 2/14 Factors in Annotation Suppose
More informationFractions and their Equivalent Forms
Fractions Fractions and their Equivalent Forms Little kids use the concept of a fraction long before we ever formalize their knowledge in school. Watching little kids share a candy bar or a bottle of soda
More informationReadyGEN Grade 1, 2016
A Correlation of ReadyGEN, 2016 To the Webb s Depth of Knowledge (DOK) Levels of Reading and the Introduction This document demonstrates how ReadyGEN, 2016 meets the Webb s Depth of Knowledge (DOK) Levels
More informationMay Read&Write 5 Gold for Mac Beginners Guide
May 2012 Read&Write 5 Gold for Mac Beginners Guide Read&Write 5 Gold for Mac INTRODUCTION... 3 SPEECH... 4 SPELLING... 6 PREDICTION... 8 DICTIONARY... 10 PICTURE DICTIONARY... 12 SOUNDS LIKE AND CONFUSABLE
More informationWhere The Objects Roam
CS61A, Spring 2006, Wei Tu (Based on Chung s Notes) 1 CS61A Week 8 Where The Objects Roam (v1.0) Paradigm Shift (or: The Rabbit Dug Another Hole) And here we are, already ready to jump into yet another
More informationObjective- Students will be able to use the Order of Operations to evaluate algebraic expressions. Evaluating Algebraic Expressions
Objective- Students will be able to use the Order of Operations to evaluate algebraic expressions. Evaluating Algebraic Expressions Variable is a letter or symbol that represents a number. Variable (algebraic)
More informationOCR Coverage. Open Court Reading Grade K CCSS Correlation
Grade K Common Core State Standards Reading: Literature Key Ideas and Details RL.K.1 With prompting and support, ask and answer questions about key details in a text. OCR Coverage Unit 1: T70 Unit 2: T271,
More informationLecture 2: Analyzing Algorithms: The 2-d Maxima Problem
Lecture 2: Analyzing Algorithms: The 2-d Maxima Problem (Thursday, Jan 29, 1998) Read: Chapter 1 in CLR. Analyzing Algorithms: In order to design good algorithms, we must first agree the criteria for measuring
More informationLING 510, Lab 3 September 23, 2013
LING 510, Lab 3 September 23, 2013 Agenda: Go over Homework 1 Go over JYW, if there are questions Go over function application (what we ended with on Thursday) 1. Frequently missed questions on Homework
More informationCommas. Review Mini Lesson
Commas Review Mini Lesson Why use a Comma? l A comma is a punctuation mark that helps keep distinct ideas separate. l Commas signal meaning, so it is critical to use them correctly! How do I use commas
More informationLing 571: Deep Processing for Natural Language Processing
Ling 571: Deep Processing for Natural Language Processing Julie Medero February 4, 2013 Today s Plan Assignment Check-in Project 1 Wrap-up CKY Implementations HW2 FAQs: evalb Features & Unification Project
More informationC++ Data Types. 1 Simple C++ Data Types 2. 3 Numeric Types Integers (whole numbers) Decimal Numbers... 5
C++ Data Types Contents 1 Simple C++ Data Types 2 2 Quick Note About Representations 3 3 Numeric Types 4 3.1 Integers (whole numbers)............................................ 4 3.2 Decimal Numbers.................................................
More informationUnit 9 Tech savvy? Tech support. 1 I have no idea why... Lesson A. A Unscramble the questions. Do you know which battery I should buy?
Unit 9 Tech savvy? Lesson A Tech support 1 I have no idea why... A Unscramble the questions. 1. which battery / Do you know / should / buy / I? Do you know which battery I should buy? 2. they / where /
More information1 Introduction. 2 Set-Theory Formalisms. Formal Semantics -W2: Limitations of a Set-Theoretic Model SWU LI713 Meagan Louie August 2015
Formal Semantics -W2: Limitations of a Set-Theoretic Model SWU LI713 Meagan Louie August 2015 1 Introduction Recall from last week: The Semantic System 1. The Model/Ontology 2. Lexical Entries 3. Compositional
More informationPre-Algebra Notes Unit 8: Graphs and Functions
Pre-Algebra Notes Unit 8: Graphs and Functions The Coordinate Plane A coordinate plane is formed b the intersection of a horizontal number line called the -ais and a vertical number line called the -ais.
More informationISA 562: Information Security, Theory and Practice. Lecture 1
ISA 562: Information Security, Theory and Practice Lecture 1 1 Encryption schemes 1.1 The semantics of an encryption scheme. A symmetric key encryption scheme allows two parties that share a secret key
More informationMeeting 1 Introduction to Functions. Part 1 Graphing Points on a Plane (REVIEW) Part 2 What is a function?
Meeting 1 Introduction to Functions Part 1 Graphing Points on a Plane (REVIEW) A plane is a flat, two-dimensional surface. We describe particular locations, or points, on a plane relative to two number
More informationHeuristic Evaluation of Team Betamax
Heuristic Evaluation of Team Betamax Eric Gallimore Connor Riley Becky Scholl Chris Stone November 4, 2006 Overview Evaluation Let s just state for the record that we like this a whole lot better than
More informationIntroduction to Lexical Analysis
Introduction to Lexical Analysis Outline Informal sketch of lexical analysis Identifies tokens in input string Issues in lexical analysis Lookahead Ambiguities Specifying lexers Regular expressions Examples
More informationPart II Composition of Functions
Part II Composition of Functions The big idea in this part of the book is deceptively simple. It s that we can take the value returned by one function and use it as an argument to another function. By
More informationFlux Integrals. Solution. We want to visualize the surface together with the vector field. Here s a picture of exactly that:
Flu Integrals The pictures for problems # - #4 are on the last page.. Let s orient each of the three pictured surfaces so that the light side is considered to be the positie side. Decide whether each of
More informationQuestion 1: Comprehension. Read the following passage and answer the questions that follow.
Question 1: Comprehension Read the following passage and answer the questions that follow. You know that you're doing something big when your company name becomes a verb. Ask Xerox. In 1959 they created
More informationF15: Formalizing definiteness
F15: Formalizing definiteness Ling 331 / 731 Spring 2016 We saw how the truth-conditional meaning of definiteness involves reference and a presupposition of uniqueness We know the syntactic structure of
More informationITCS 6150 Intelligent Systems. Lecture 13 First-Order Logic Chapter 8
ITCS 6150 Intelligent Systems Lecture 13 First-Order Logic Chapter 8 First-order logic We saw how propositional logic can create intelligent behavior But propositional logic is a poor representation for
More informationLast week: Breadth-First Search
1 Last week: Breadth-First Search Set L i = [] for i=1,,n L 0 = {w}, where w is the start node For i = 0,, n-1: For u in L i : For each v which is a neighbor of u: If v isn t yet visited: - mark v as visited,
More informationUser Manual. Tellus smart
User Manual Tellus smart Content Introduction 3 How to turn on the Tellus smart. 4 Connectors and buttons.. 5 Touch screen. 8 On-screen keyboard. 9 Battery and charging 10 How to create a communication
More informationTOPIC 2 INTRODUCTION TO JAVA AND DR JAVA
1 TOPIC 2 INTRODUCTION TO JAVA AND DR JAVA Notes adapted from Introduction to Computing and Programming with Java: A Multimedia Approach by M. Guzdial and B. Ericson, and instructor materials prepared
More informationOutline. Data Definitions and Templates Syntax and Semantics Defensive Programming
Outline Data Definitions and Templates Syntax and Semantics Defensive Programming 1 Data Definitions Question 1: Are both of the following data definitions ok? ; A w-grade is either ; - num ; - posn ;
More informationCPSC 467b: Cryptography and Computer Security
Outline ZKIP Other IP CPSC 467b: Cryptography and Computer Security Lecture 19 Michael J. Fischer Department of Computer Science Yale University March 31, 2010 Michael J. Fischer CPSC 467b, Lecture 19
More informationKuratowski Notes , Fall 2005, Prof. Peter Shor Revised Fall 2007
Kuratowski Notes 8.30, Fall 005, Prof. Peter Shor Revised Fall 007 Unfortunately, the OCW notes on Kuratowski s theorem seem to have several things substantially wrong with the proof, and the notes from
More informationEnrico s holiday job
TIME FOR PRACTICE PRESENT TENSE or PAST TENSE? Things that happened in the past and are now finished (an hour, yesterday, last week, last month, in 2010, when I was six. Enrico s holiday job Present Tense
More informationCMPSCI 250: Introduction to Computation. Lecture #7: Quantifiers and Languages 6 February 2012
CMPSCI 250: Introduction to Computation Lecture #7: Quantifiers and Languages 6 February 2012 Quantifiers and Languages Quantifier Definitions Translating Quantifiers Types and the Universe of Discourse
More information(Refer Slide Time: 06:01)
Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 28 Applications of DFS Today we are going to be talking about
More information1.7 Limit of a Function
1.7 Limit of a Function We will discuss the following in this section: 1. Limit Notation 2. Finding a it numerically 3. Right and Left Hand Limits 4. Infinite Limits Consider the following graph Notation:
More information6.001 Notes: Section 6.1
6.001 Notes: Section 6.1 Slide 6.1.1 When we first starting talking about Scheme expressions, you may recall we said that (almost) every Scheme expression had three components, a syntax (legal ways of
More information1 Introduction CHAPTER ONE: SETS
1 Introduction CHAPTER ONE: SETS Scientific theories usually do not directly describe the natural phenomena under investigation, but rather a mathematical idealization of them that abstracts away from
More informationThe next several pages summarize some of the best techniques to achieve these three goals.
Writing and Reviewing Documents You are required to write the following documents in this course: 1) A description of your GPS data collection and results. 2) A technical description of a data collection
More informationIntro. Scheme Basics. scm> 5 5. scm>
Intro Let s take some time to talk about LISP. It stands for LISt Processing a way of coding using only lists! It sounds pretty radical, and it is. There are lots of cool things to know about LISP; if
More informationEngineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3
Engineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3 In this case let s say delta B and delta C are the kinematically consistent displacements.
More informationSECTION 2: PUNCTUATION
PUNCTUATION SECTION 2: PUNCTUATION This section will cover the use of: Commas Quotation Marks Hyphens 2 When to Use Commas% A comma is like a small pause in your sentence. Commas are often misused. Taking
More informationCSCI 1100L: Topics in Computing Lab Lab 11: Programming with Scratch
CSCI 1100L: Topics in Computing Lab Lab 11: Programming with Scratch Purpose: We will take a look at programming this week using a language called Scratch. Scratch is a programming language that was developed
More information(2 1) What does evaluate to? What does evaluate to? What does evaluate to?
Order of Operations (Time 20 minutes) Math is a language, just like English, Spanish, or any other language. We use nouns, like "bread", "tomato", "mustard" and "cheese" to describe physical objects. Math
More informationReplication. Feb 10, 2016 CPSC 416
Replication Feb 10, 2016 CPSC 416 How d we get here? Failures & single systems; fault tolerance techniques added redundancy (ECC memory, RAID, etc.) Conceptually, ECC & RAID both put a master in front
More informationKnowledge Sharing Among Heterogeneous Agents
Knowledge Sharing Among Heterogeneous Agents John F. Sowa VivoMind Research, LLC 29 July 2013 Facts of Life: Diversity and Heterogeneity Open-ended variety of systems connected to the Internet: The great
More informationIntroduction to Programming
CHAPTER 1 Introduction to Programming Begin at the beginning, and go on till you come to the end: then stop. This method of telling a story is as good today as it was when the King of Hearts prescribed
More informationProseminar on Semantic Theory Fall 2013 Ling 720 An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1
An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1 1. Statement of the Problem, Outline of the Solution to Come (1) The Key Problem There is much to recommend an algebraic
More informationIntroduction. Hi, I m Sarah. Let s follow along with Jane while she navigates the Internet to learn about the parts of a website.
Introduction Hi, I m Sarah. Let s follow along with Jane while she navigates the Internet to learn about the parts of a website. 1 Getting around on the Internet is a lot like navigating a city on foot
More informationFoundations, Reasoning About Algorithms, and Design By Contract CMPSC 122
Foundations, Reasoning About Algorithms, and Design By Contract CMPSC 122 I. Logic 101 In logic, a statement or proposition is a sentence that can either be true or false. A predicate is a sentence in
More information#2 Madlibs. Print out a story using the five variables into a text box. Make a procedure called madlibs that works with a Main and a Start procedure.
#2 Madlibs We are going to work on a new project, a game called Madlibs. It will give us some more practice dealing with variables. We are going to follow a defined set of steps in programming this. They
More information4.3, Math 1410 Name: And now for something completely different... Well, not really.
4.3, Math 1410 Name: And now for something completely different... Well, not really. How derivatives affect the shape of a graph. Please allow me to offer some explanation as to why the first couple parts
More informationHeuristic Evaluation of Covalence
Heuristic Evaluation of Covalence Evaluator #A: Selina Her Evaluator #B: Ben-han Sung Evaluator #C: Giordano Jacuzzi 1. Problem Covalence is a concept-mapping tool that links images, text, and ideas to
More informationIntroduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14
600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14 23.1 Introduction We spent last week proving that for certain problems,
More informationHave the students look at the editor on their computers. Refer to overhead projector as necessary.
Intro to Programming (Time 15 minutes) Open the programming tool of your choice: If you ve installed, DrRacket, double-click the application to launch it. If you are using the online-tool, click here to
More informationThe WideRuled Story Generator Tutorial Alex Mitchell Communications and New Media Programme National University of Singapore
The WideRuled Story Generator Tutorial Alex Mitchell Communications and New Media Programme National University of Singapore Table of Contents 1. Introduction... 1 2. Getting Started... 2 3. Creating Characters...
More informationUsability Test Report: Requesting Library Material 1
Usability Test Report: Requesting Library Material 1 Summary Emily Daly and Kate Collins conducted usability testing on the processes of requesting library material. The test was conducted at the temporary
More informationDisjoint Sets. The obvious data structure for disjoint sets looks like this.
CS61B Summer 2006 Instructor: Erin Korber Lecture 30: 15 Aug. Disjoint Sets Given a set of elements, it is often useful to break them up or partition them into a number of separate, nonoverlapping groups.
More informationNOTES: ALGEBRA FUNCTION NOTATION
STARTER: 1. Graph f by completing the table. f, y -1 0 1 4 5 NOTES: ALGEBRA 4.1 FUNCTION NOTATION y. Graph f 4 4 f 4 4, y --5-4 - - -1 0 1 y A Brief Review of Function Notation We will be using function
More informationPart 1: Understanding Windows XP Basics
542362 Ch01.qxd 9/18/03 9:54 PM Page 1 Part 1: Understanding Windows XP Basics 1: Starting Up and Logging In 2: Logging Off and Shutting Down 3: Activating Windows 4: Enabling Fast Switching between Users
More informationCopy COMAP Inc. Not for Resale
Examination Copy COMAP Inc. Not for Resale CHAPTER 4 Animation/ Special Effects LESSON ONE Get Moving LESSON TWO Get to the Point LESSON THREE Escalating Motion LESSON FOUR Calculator Animation LESSON
More informationImproving the crab: more sophisticated programming
Chapter 3 Improving the crab: more sophisticated programming topics: concepts: random behavior, keyboard control, sound dot notation, random numbers, defining methods, comments In the previous chapter,
More informationMicrolab 3 COMMA USAGE
Microlab 3 COMMA USAGE Placed correctly, commas help create a clear meaning. Placed incorrectly, commas can distort meaning and confuse readers. Good writers learn when and when not to use commas for the
More informationChris Skorlinski Microsoft SQL Escalation Services Charlotte, NC
Chris Skorlinski Microsoft SQL Escalation Services Charlotte, NC http://blogs.msdn.com/repltalk One of my favorite shows is CarTalk on Public Radio. Those guys always make me laugh. I enjoy listening to
More informationCS 167 Final Exam Solutions
CS 167 Final Exam Solutions Spring 2018 Do all questions. 1. [20%] This question concerns a system employing a single (single-core) processor running a Unix-like operating system, in which interrupts are
More informationLaboratory 5: Implementing Loops and Loop Control Strategies
Laboratory 5: Implementing Loops and Loop Control Strategies Overview: Objectives: C++ has three control structures that are designed exclusively for iteration: the while, for and do statements. In today's
More information