LING 388: Language and Computers Sandiway Fong Lecture 17.

Slides:



Advertisements
Similar presentations
Present, Past, and Future Tenses Tense means time.
Advertisements

LING 388: Language and Computers Sandiway Fong Lecture 23.
Common Grammar Mistake Students are not able to construct grammatically correct sentences particularly on subject-verb agreement. eg: Ahmad eat durians.
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
LING 388: Language and Computers Sandiway Fong Lecture 5: 9/5.
LING 388: Language and Computers Sandiway Fong Lecture 5: 9/8.
CSA4050: Advanced Topics in NLP Semantics IV Partial Execution Proper Noun Adjective.
LING/C SC/PSYC 438/538 Lecture 22 Sandiway Fong 1.
Morphology.
Grammars, constituency and order A grammar describes the legal strings of a language in terms of constituency and order. For example, a grammar for a fragment.
Statistical NLP: Lecture 3
Fall 2008Programming Development Techniques 1 Topic 9 Symbol Manipulation Generating English Sentences Section This is an additional example to symbolic.
LING 388: Language and Computers Sandiway Fong Lecture 15.
LING 438/538 Computational Linguistics Sandiway Fong Lecture 7: 9/12.
Parsing: Features & ATN & Prolog By
LING 388: Language and Computers Sandiway Fong Lecture 15: 10/17.
LING 438/538 Computational Linguistics Sandiway Fong Lecture 22: 11/15.
LING 388: Language and Computers Sandiway Fong Lecture 20: 11/2.
Sag et al., Chapter 4 Complex Feature Values 10/7/04 Michael Mulyar.
LING 388: Language and Computers Sandiway Fong Lecture 14: 10/13.
LING/C SC/PSYC 438/538 Computational Linguistics Sandiway Fong Lecture 9: 9/25.
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
LING 388 Language and Computers Take-Home Final Examination 12/9/03 Sandiway FONG.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 2.
LING 388 Language and Computers Lecture 18 10/30/03 Sandiway FONG.
LING 388: Language and Computers Sandiway Fong Lecture 17: 10/25.
LING 388: Language and Computers Sandiway Fong Lecture 16: 10/19.
CS 4705 Lecture 11 Feature Structures and Unification Parsing.
LING 388 Language and Computers Lecture 13 10/14/03 Sandiway FONG.
LING 388: Language and Computers Sandiway Fong Lecture 17: 10/24.
LING 364: Introduction to Formal Semantics Lecture 5 January 26th.
LING 388 Language and Computers Lecture 17 10/28/03 Sandiway FONG.
LING 388: Language and Computers Sandiway Fong Lecture 13: 10/10.
LING 388 Language and Computers Lecture 12 10/9/03 Sandiway FONG.
LING 388 Language and Computers Lecture 15 10/21/03 Sandiway FONG.
LING 388: Language and Computers Sandiway Fong Lecture 8.
LING 388: Language and Computers Sandiway Fong 10/4 Lecture 12.
LING/C SC/PSYC 438/538 Lecture 19 Sandiway Fong 1.
LING 388: Language and Computers Sandiway Fong Lecture 11.
Latin Grammar: Singular and Plural Magister Henderson Latin I.
1 Features and Unification Chapter 15 October 2012 Lecture #10.
Form Classes Ed McCorduck English 402—Grammar SUNY Cortland
LING 388: Language and Computers Sandiway Fong Lecture 14 10/11.
LING 388: Language and Computers Sandiway Fong Lecture 27.
LING 388: Language and Computers Sandiway Fong Lecture 7.
LING 388: Language and Computers Sandiway Fong Lecture 15 10/13.
Phonemes A phoneme is the smallest phonetic unit in a language that is capable of conveying a distinction in meaning. These units are identified within.
LING 388: Language and Computers Sandiway Fong Lecture 3.
LING 388: Language and Computers Sandiway Fong Lecture 18.
LING 388: Language and Computers Sandiway Fong Lecture 19.
LING 388: Language and Computers Sandiway Fong Lecture 13.
LING/C SC/PSYC 438/538 Lecture 26 Sandiway Fong. Administrivia 538 Presentations – Send me your choices if you haven’t already Thanksgiving Holiday –
LING 388: Language and Computers Sandiway Fong Lecture 12.
LING 388: Language and Computers Sandiway Fong Lecture 11: 10/4.
Rules, Movement, Ambiguity
CSA2050 Introduction to Computational Linguistics Parsing I.
Auckland 2012Kilgarriff: NLP and Corpus Processing1 The contribution of NLP: corpus processing.
LING 388: Language and Computers Sandiway Fong Lecture 21.
LING 388: Language and Computers Sandiway Fong Lecture 25.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 2.
LING/C SC/PSYC 438/538 Lecture 20 Sandiway Fong 1.
LING 388: Language and Computers Sandiway Fong Lecture 16.
LING 388: Language and Computers Sandiway Fong Lecture 20.
3.3 A More Detailed Look At Transformations Inversion (revised): Move Infl to C. Do Insertion: Insert interrogative do into an empty.
The Challenge Suffixes Parts of Speech in a Dictionary Irregular Verbs
LING/C SC/PSYC 438/538 Lecture 19 Sandiway Fong 1.
Grammar Log #2 Cornell Notes Out! The Verb & Verb Phrase / The verb is an action or linking word / The “Verb Phrase” (VP) indicates ALL of the words.
Week 10 X-bar syntax: More on Clauses English Syntax.
LING/C SC/PSYC 438/538 Lecture 21 Sandiway Fong.
LING/C SC/PSYC 438/538 Lecture 24 Sandiway Fong.
Presentation transcript:

LING 388: Language and Computers Sandiway Fong Lecture 17

Morphology: Plural inflection Note: –{ … } allows the insertion of Prolog code into a grammar rule – atom_concat(A1,A2,A3) can concatenate atoms A1 and A2 to form A3, or split A3 into left side A1 and right side A2 Root must already have an entry in the grammar Saves us writing rules for regular plurals like rat/cat but it over-generates, e.g. man/men Saves us writing rules for regular plurals like rat/cat but it over-generates, e.g. man/men

Last Time Two methods for encoding the lexical feature Number – (1) Renaming the matching nonterminal dt becomes dt_singular/dt_plural/dt_mass nn becomes nn_singular/nn_plural/nn_mass – (2) adding an extra argument with a Number variable There’s a tradeoff: – number of rules vs. – extra complexity in terms of the number of arguments

Last Time Nonterminal renaming: dt  dt_singular/plural/mass and nn  nn_singular/plural/mass Triple the number of rules!

Determiner Noun Agreement Used an extra argument for nonterminals dt and nn to hold the value of the Number feature np(np(np(DT,NN),SBAR)) --> dt(DT,Number), nn(NN,Number), objrel_sbar(SBAR). np(np(np(DT,NN),SBAR)) --> dt(DT,Number), nn(NN,Number), subjrel_sbar(SBAR). empty_np(np(0)) --> []. complementizer(c(that)) --> [that]. dt(dt(the),_) --> [the]. dt(dt(a),singular) --> [a]. nn(nn(man),singular) --> [man]. nn(nn(men),plural) --> [men]. nn(nn(rat),singular) --> [rat]. nn(nn(cat),singular) --> [cat]. nn(nn(Root-Suffix),plural) --> [Word], {atom_concat(Root,Suffix,Word), nn(_,singular,[Root],[])}. nn(nn(cheese),mass) --> [cheese]. suffix(plural) --> [-s]. vbd(vbd(saw)) --> [saw]. vbd(vbd(ate)) --> [ate]. vbd(vbd(chased)) --> [chased].

Today’s Topic We’ve implement English determiner-noun agreement – Uses the multiple argument strategy Subject-verb agreement is also necessary in English Example: – John eats cheese – *John eat cheese Verb inflectional endings Example: FormEndingComment eat basenot 3 rd person singular eats-s3 rd person singular ate-edpast (eaten)-enpast participle (eating)-inggerund Verb inflectional endings Example: FormEndingComment eat basenot 3 rd person singular eats-s3 rd person singular ate-edpast (eaten)-enpast participle (eating)-inggerund

Subject Verb Agreement Examples 1.John eats cheese 2.*John eat cheese 3.John ate cheese 4.*I eats cheese 5.I ate cheese 6.I eat cheese 7.*We eats cheese 8.We eat cheese 9.We ate cheese 10.*You eats cheese 11.You eat cheese 12.You ate cheese 13.He eats cheese 14.*He eat cheese 15.He ate cheese 16.*They eats cheese 17.They eat cheese 18.They ate cheese Let’s modify the grammar to constrain this properly: – -s form of the verb is compatible with 3rd person singular only for the subject NP – base form is not compatible with 3 rd person singular for the subject NP

Bare Mass Nouns For sentences like: – John eats cheese we can add a NP rule to allow mass nouns to not require an accompanying determiner: np(np(N)) --> nn(N,mass).

Subject Verb Agreement What lexical features do we need to implement agreement? eats *eat FormEndingComment eat basenot 3 rd person singular eats-s3 rd person singular ate-edpast (eaten)-enpast participle (eating)-inggerund FormEndingComment eat basenot 3 rd person singular eats-s3 rd person singular ate-edpast (eaten)-enpast participle (eating)-inggerund Person Number Person Number Ending Subject and VP come together at this rule Person Number Person Number Ending

Subject Verb Agreement S NP VP rule: not a non-terminal, but inside curly braces, a call to Prolog predicate checkSubjVerb/3 Add database rules for checkSubjVerb/3 to make sure only compatible endings get through: FormEndingComment eat basenot 3 rd person singular eats-s3 rd person singular ate-edpast (eaten)-enpast participle (eating)-inggerund FormEndingComment eat basenot 3 rd person singular eats-s3 rd person singular ate-edpast (eaten)-enpast participle (eating)-inggerund

Subject Verb Agreement Worry about other S NP VP rules later…

Subject Verb Agreement 1.Need to modify NP rules to pass up the Person and Number features 2.Need to modify VP rules to pass up the Ending feature eats *eat Person Number Person Number Ending Person Number Person Number Ending

Subject Verb Agreement Update np(Parse)  np(Parse,Number,Person)

Subject Verb Agreement Update vp(Parse)  vp(Parse,Ending) We could use the endings suggested earlier (-s, -ed, -en, -ing) or the POS tags:

Subject Verb Agreement Implementation 1: use verb endings

Subject Verb Agreement Implementation 2: use POS tags