Overview. 1 Introduction. 2 TAG for Natural Languages. 3 Conclusion. Introduction to TAG. John ADV VP 1 S NP VP 2 VP ADV VP 3 VP V.
|
|
- Sherman Paul
- 6 years ago
- Views:
Transcription
1 Overview Tree-Adjoining Grammar (TAG) Linguistics 64 With thanks to Detmar Meurers & Laura Kallmeyer pring 205 Introduction 2 TAG for atural Languages 3 Conclusion () (2) Phrase tructure Trees TAG (Joshi et al. 975, Joshi & chabes 997) extends CFG in the following sense: In a CFG, each derivation step amounts to substituting a new tree of height for a leaf. In a TAG, we allow (finite) trees that are arbitrarily large AD sometimes 2 AD AD sometimes 6 (3) tring rewriting derivation (4) ubstitution (Tree ubstitution Grammars (TGs) 0 (rule #) 2 (rule #4) 3 AD (rule #2) 4 sometimes (rule #5) 5 sometimes (rule #3) 6 sometimes (rule #6) Elementary structures are trees Arrow indies where substitution takes place tree : tree 2: derived tree:
2 (5) (6) Q: with TGs, how would we obtain heartily? Besides substitution at leaves, we also can replace internal nodes with new trees (adjunction). In an adjunction, the new tree is an auxiliary tree and has a special leaf, the foot node. The trees that are added in substitution operations are called initial trees. Auxiliary tree modifies an XP only if root & foot nodes are both XP Using adjunction gives Tree Adjoining Grammar (TAG) () sometimes derived tree: AD sometimes AD sometimes (7) (8) A Tree Adjoining Grammar (TAG) is a quadruple G =, T, I, A such that T and are disjoint alphabets, the terminals and nonterminals, I is a finite set of initial trees, and A is a finite set of auxiliary trees. The trees in I A are called elementary trees. nodes in elementary trees are labeled with symbols from T {ε} all internal nodes have labels from G is lexicalized iff each elementary tree has at least one leaf with a terminal label. TAG as defined above are more powerful than CFG but they cannot generate the copy language ({ww w {a, b} }). In order to increase the expressive power, adjunction constraints are introduced that specify for each node whether adjunction is mandatory and 2 which trees can be adjoined. (9) (6) Example: TAG for the copy language Three types of constraints are distinguished: A node is said to carry a obligatory adjunction (OA) constraint if adjunction is obligatory at that node. 2 A node is said to carry a null adjunction (A) constraint if adjunction is not obligatory and the set of adjoinable trees is empty. 3 A node is said to carry a selective adjunction (A) constraint if adjunction is not obligatory and the set of adjoinable trees is not empty. a A A a b A A b
3 (7) Example (8) (2) seems to sleep OA to sleep seems TAG derivations are described by derivation trees: For each derivation in a TAG there is a corresponding derivation tree. This tree contains nodes for all elementary trees used in the derivation, and edges for all adjunctions and substitutions performed throughout the derivation. Whenever an elementary tree γ was attached to the node at address p in the elementary tree γ, there is an edge from γ to γ labeled with p. We use Gorn addresses: The root has address ε, and the i th daughter of the node with address p has address pi. (9) Derivation tree example FTAG () The derivation tree for the derivation of (2) seems to sleep: sleep 2 john seems Feature-structure based TAG (FTAG) (ijay-hanker & Joshi, 988): each node has a top and a bottom feature structure (except substitution nodes that have only a top). odes in the same elementary tree can share features (extended domain of locality). Intuition: The top feature structure tells us something about what the node represents within the surrounding structure, and the bottom feature structure tells us something about what the tree below the node represents. In the final derived tree, both must be the same. FTAG (2) Example: agr agr pers 3 num sing sings FTAG (3) Example: agr agr mode ind mode ger singing
4 FTAG (4) Unifiion during derivation: ubstitution: the top of the root of the new initial tree unifies with the top of the substitution node Adjunction: the top of the root of the new auxiliary tree unifies with the top of the adjunction site, and the bottom of the foot of the new tree unifies with the bottom of the adjunction site. In the final derived tree, top and bottom unify for all nodes. FTAG (5) Example: agr pers 3 num sing agr agr pers 3 num sing sings FTAG (6) Example: agr 2 mode ind agr 2 pers 3 num sing is agr agr mode ind mode ger mode ger singing FTAG (7) In FTAG, there are no explicit adjunction constraints. Instead, adjunction constraints are expressed via feature unifiion requirements. Important: LTAG feature structures are restricted; there is only a finite set of possible feature structures. Therefore, the following can be shown: For each FTAG there exists a weakly equivalent TAG with adjunction constraints and vice versa. The two TAGs generate even the same sets of trees, only with different node labels. Elementary trees () Elementary trees (2) Important features of LTAG (Lexicalized TAG): Grammar is lexicalized Recursive parts are put into separate elementary trees that can be adjoined (Factoring of recursion, FR) Elementary trees can be arbitrarily large, in particular (because of FR) they can contain elements that are far apart in the final derived tree (Extended domain of locality) LTAG game: (3) a. who i did tell am that Bill likes t i b. who i did tell am that Mary said that Bill likes t i WH i COMP OA that WH i who likes i Bill IFL did tell am
5 Elementary trees (3) Elementary trees (4) Example Elementary trees are extended projections of lexical items. Recursion is factored away finite set of elementary trees. The elementary tree of a lexical predie contains slots for all arguments of the predie, for nothing more. Besides lexical predies, there are functional elements (complementizers, determiners, auxiliaries, negation) whose treatment in LTAG is less clear. They can be either in separate elementary trees (XTAG, 200) or in the elementary tree of the lexical item they are associated with (Frank, 2002). (4) gives a book to Mary PP gives P to Elementary trees (5) Elementary trees (6) Example: (5) expected Mary to make a comment expected selects for a subject and an infinitival sentence: expected to make a comment The sentential object is realised as a foot node in order to allow extractions: (6) whom does expect to come? to make a comment: make and comment in the same elementary tree since they form a light verb construction: to make comment Det a Elementary trees (7) Elementary trees (8) Example with modifiers: (7) the good student participated in every course during the semester AP A good Det the student PP participated P in PP P during
6 Elementary trees (9) Elementary trees (0) Tree families Constraints on larger structures (constraints on unbounded dependencies ) need not be stipulated but follow from the possibilities of adjunction in the elementary trees. Fundamental LTAG hypothesis: Every syntactic dependency is expressed locally within a single elementary tree. on-local dependency corollary: on-local dependencies always reduce to local ones once recursive structure is factored away. What do the elementary trees look like for the following sentence? (8) which book did Harvey say Cecile had read In the lexicon, the trees are organized in tree families. Each family contains a base tree and trees derived from the base tree using transformations. Important: These transformations operate only on a finite set, i.e., on structures of bounded size. Tree families group together trees belonging to the same subegorization frame. Elementary trees () Tree family example () The trees for the different forms of buy in (9) belong to one tree family. (9) a. bought a book b. What does buy? c. Who bought a book? d. A book was bought by e. The man who bought the book this morning was from Tübingen. buy in (0) has a different tree family. The derived tree gives the constituent structure. The derivation tree records the history of how the elementary trees are put together. the edges in the derivation tree represent predie-argument dependencies where a substitution-edge has a downward direction, an adjunction edge an upward direction; the derivation tree is close to a semantic dependency graph. compute semantics on derivation tree (0) bought Mary a book (2) Ditransitive verb (3) entential Complement () buys Bill a book Elementary trees: Derivation tree buys buys Bill a book Bill Det a book (2) Bill hopes that wins Bill wins hopes Bill hopes Comp that wins
7 (4) Raising to Object (5) Object-control Equi (3) expects Bill to win to win expects expects Bill to win (4) persuades Bill PRO to leave to leave persuades 22 Bill persuades PRO to leave (6) ubject raising (7) Long distance phenomena (5) seems to like Bill seems to like to like 2 22 seems Bill (6) which book did Harvey say Cecile had read had read 2 2 which book did say Cecile 2 Harvey (8) (9) The derivation tree is not always the semantic dependency structure: (7) roasted red pepper AP roasted AP red pepper pepper red roasted proposal of alternative derivation with multiple adjunctions of modifier trees at the same node. On the other hand, multiple adjunctions are not always desired: (8) seems to be likely to win the race to win 2 22 to be likely the race seems This is the correct dependency structure.
8 (0) Conclusion Another problematic case: (9) claims Bill is likely to win to win 2 Bill claims is likely TAG extend CFGs by introducing adjunction, in addition to substitution. TAG are only slightly more powerful that CFG. Elementary trees of lexical predies encapsulate subegorization frames: For each subegorized argument, there is a non-terminal leaf (either a substitution node or a foot node). Recursion is factored away: only slots for subegorized arguments are provided. Modifiers are added by adjunction. Extended domain of locality: yntactic dependencies are defined locally, within single elementary trees. Unbounded dependencies arise from adjunction between an argument and its lexical head. References Frank, R. (2002): Phrase tructure Copmposition and yntactic Dependencies. MIT Press, Cambridge, Mass. Gardent, C., Kallmeyer, L. (2003): emantic Construction in FTAG. Proceedings of EACL 2003, Joshi, A.K., Levy, L.., Takahashi, M. (975): Tree Adjunct Grammars. Journal of Computer and ystem cience 0, Joshi, A.K., chabes, Y. (997): Tree-Adjoning Grammars. In Rozenberg, G., alomaa, A., eds.: Handbook of Formal Languages. pringer, Berlin, Kallmeyer, L., Romero, M. (2008): cope and ituation Binding in LTAG using emantic Unifiion. Research on Language and Computation 6(), esson, R., hieber,.m. (2006): impler TAG semantics through synchronization. In: Proceedings of the th Conference on Formal Grammar, Malaga, pain. hieber,.m. (985): Evidence against the context-freeness of natural language. Linguistics and Philosophy 8, ijay-hanker, K. and Joshi, A.K. (988): Feature tructures Based Tree Adjoining Grammar. Proceedings of COLIG, XTAG Research Group (200): A Lexicalized Tree Adjoining Grammar for English. Technical report, Institute for Research in Cognitive cience, Philadelphia. Available from ftp://ftp.cis.upenn.edu/pub/xtag/release /tech-report.pdf.
"f TOPIC =T COMP COMP... OBJ
TREATMENT OF LONG DISTANCE DEPENDENCIES IN LFG AND TAG: FUNCTIONAL UNCERTAINTY IN LFG IS A COROLLARY IN TAG" Aravind K. Joshi Dept. of Computer & Information Science University of Pennsylvania Philadelphia,
More informationDeveloping a TT-MCTAG for German with an RCG-based Parser
Developing a TT-MCTAG for German with an RCG-based Parser Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yannick Parmentier, Johannes Dellert University of Tübingen, Germany CNRS-LORIA, France LREC 2008,
More informationLTAG-spinal and the Treebank
LTAG-spinal and the Treebank a new resource for incremental, dependency and semantic parsing Libin Shen (lshen@bbn.com) BBN Technologies, 10 Moulton Street, Cambridge, MA 02138, USA Lucas Champollion (champoll@ling.upenn.edu)
More informationSyntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm
Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm syntax: from the Greek syntaxis, meaning setting out together
More informationProof Theory for Syntacticians
Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 5, 2012 Logics for Linguistics Many different kinds of logic are directly applicable to formalizing theories in syntax
More informationContext Free Grammars. Many slides from Michael Collins
Context Free Grammars Many slides from Michael Collins Overview I An introduction to the parsing problem I Context free grammars I A brief(!) sketch of the syntax of English I Examples of ambiguous structures
More informationGrammars & Parsing, Part 1:
Grammars & Parsing, Part 1: Rules, representations, and transformations- oh my! Sentence VP The teacher Verb gave the lecture 2015-02-12 CS 562/662: Natural Language Processing Game plan for today: Review
More informationIntroduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions.
to as a linguistic theory to to a member of the family of linguistic frameworks that are called generative grammars a grammar which is formalized to a high degree and thus makes exact predictions about
More informationChapter 4: Valence & Agreement CSLI Publications
Chapter 4: Valence & Agreement Reminder: Where We Are Simple CFG doesn t allow us to cross-classify categories, e.g., verbs can be grouped by transitivity (deny vs. disappear) or by number (deny vs. denies).
More informationA Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many
Schmidt 1 Eric Schmidt Prof. Suzanne Flynn Linguistic Study of Bilingualism December 13, 2013 A Minimalist Approach to Code-Switching In the field of linguistics, the topic of bilingualism is a broad one.
More informationCS 598 Natural Language Processing
CS 598 Natural Language Processing Natural language is everywhere Natural language is everywhere Natural language is everywhere Natural language is everywhere!"#$%&'&()*+,-./012 34*5665756638/9:;< =>?@ABCDEFGHIJ5KL@
More informationarxiv:cmp-lg/ v1 16 Aug 1996
Punctuation in Quoted Speech arxiv:cmp-lg/9608011v1 16 Aug 1996 Christine Doran Department of Linguistics University of Pennsylvania Philadelphia, PA 19103 cdoran@linc.cis.upenn.edu Quoted speech is often
More informationControl and Boundedness
Control and Boundedness Having eliminated rules, we would expect constructions to follow from the lexical categories (of heads and specifiers of syntactic constructions) alone. Combinatory syntax simply
More informationInleiding Taalkunde. Docent: Paola Monachesi. Blok 4, 2001/ Syntax 2. 2 Phrases and constituent structure 2. 3 A minigrammar of Italian 3
Inleiding Taalkunde Docent: Paola Monachesi Blok 4, 2001/2002 Contents 1 Syntax 2 2 Phrases and constituent structure 2 3 A minigrammar of Italian 3 4 Trees 3 5 Developing an Italian lexicon 4 6 S(emantic)-selection
More information11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation
tatistical Parsing (Following slides are modified from Prof. Raymond Mooney s slides.) tatistical Parsing tatistical parsing uses a probabilistic model of syntax in order to assign probabilities to each
More informationInformatics 2A: Language Complexity and the. Inf2A: Chomsky Hierarchy
Informatics 2A: Language Complexity and the Chomsky Hierarchy September 28, 2010 Starter 1 Is there a finite state machine that recognises all those strings s from the alphabet {a, b} where the difference
More informationHyperedge Replacement and Nonprojective Dependency Structures
Hyperedge Replacement and Nonprojective Dependency Structures Daniel Bauer and Owen Rambow Columbia University New York, NY 10027, USA {bauer,rambow}@cs.columbia.edu Abstract Synchronous Hyperedge Replacement
More informationBasic Syntax. Doug Arnold We review some basic grammatical ideas and terminology, and look at some common constructions in English.
Basic Syntax Doug Arnold doug@essex.ac.uk We review some basic grammatical ideas and terminology, and look at some common constructions in English. 1 Categories 1.1 Word level (lexical and functional)
More informationBasic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1
Basic Parsing with Context-Free Grammars Some slides adapted from Julia Hirschberg and Dan Jurafsky 1 Announcements HW 2 to go out today. Next Tuesday most important for background to assignment Sign up
More informationSome Principles of Automated Natural Language Information Extraction
Some Principles of Automated Natural Language Information Extraction Gregers Koch Department of Computer Science, Copenhagen University DIKU, Universitetsparken 1, DK-2100 Copenhagen, Denmark Abstract
More informationTowards a MWE-driven A* parsing with LTAGs [WG2,WG3]
Towards a MWE-driven A* parsing with LTAGs [WG2,WG3] Jakub Waszczuk, Agata Savary To cite this version: Jakub Waszczuk, Agata Savary. Towards a MWE-driven A* parsing with LTAGs [WG2,WG3]. PARSEME 6th general
More informationSom and Optimality Theory
Som and Optimality Theory This article argues that the difference between English and Norwegian with respect to the presence of a complementizer in embedded subject questions is attributable to a larger
More informationUniversal Grammar 2. Universal Grammar 1. Forms and functions 1. Universal Grammar 3. Conceptual and surface structure of complex clauses
Universal Grammar 1 evidence : 1. crosslinguistic investigation of properties of languages 2. evidence from language acquisition 3. general cognitive abilities 1. Properties can be reflected in a.) structural
More informationENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist
Meeting 2 Chapter 7 (Morphology) and chapter 9 (Syntax) Today s agenda Repetition of meeting 1 Mini-lecture on morphology Seminar on chapter 7, worksheet Mini-lecture on syntax Seminar on chapter 9, worksheet
More informationHindi-Urdu Phrase Structure Annotation
Hindi-Urdu Phrase Structure Annotation Rajesh Bhatt and Owen Rambow January 12, 2009 1 Design Principle: Minimal Commitments Binary Branching Representations. Mostly lexical projections (P,, AP, AdvP)
More informationParsing of part-of-speech tagged Assamese Texts
IJCSI International Journal of Computer Science Issues, Vol. 6, No. 1, 2009 ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 28 Parsing of part-of-speech tagged Assamese Texts Mirzanur Rahman 1, Sufal
More informationConstraining X-Bar: Theta Theory
Constraining X-Bar: Theta Theory Carnie, 2013, chapter 8 Kofi K. Saah 1 Learning objectives Distinguish between thematic relation and theta role. Identify the thematic relations agent, theme, goal, source,
More informationThe Structure of Multiple Complements to V
The Structure of Multiple Complements to Mitsuaki YONEYAMA 1. Introduction I have recently been concerned with the syntactic and semantic behavior of two s in English. In this paper, I will examine the
More informationCase government vs Case agreement: modelling Modern Greek case attraction phenomena in LFG
Case government vs Case agreement: modelling Modern Greek case attraction phenomena in LFG Dr. Kakia Chatsiou, University of Essex achats at essex.ac.uk Explorations in Syntactic Government and Subcategorisation,
More informationThe building blocks of HPSG grammars. Head-Driven Phrase Structure Grammar (HPSG) HPSG grammars from a linguistic perspective
Te building blocks of HPSG grammars Head-Driven Prase Structure Grammar (HPSG) In HPSG, sentences, s, prases, and multisentence discourses are all represented as signs = complexes of ponological, syntactic/semantic,
More informationAn Introduction to the Minimalist Program
An Introduction to the Minimalist Program Luke Smith University of Arizona Summer 2016 Some findings of traditional syntax Human languages vary greatly, but digging deeper, they all have distinct commonalities:
More informationThe presence of interpretable but ungrammatical sentences corresponds to mismatches between interpretive and productive parsing.
Lecture 4: OT Syntax Sources: Kager 1999, Section 8; Legendre et al. 1998; Grimshaw 1997; Barbosa et al. 1998, Introduction; Bresnan 1998; Fanselow et al. 1999; Gibson & Broihier 1998. OT is not a theory
More informationApproaches to control phenomena handout Obligatory control and morphological case: Icelandic and Basque
Approaches to control phenomena handout 6 5.4 Obligatory control and morphological case: Icelandic and Basque Icelandinc quirky case (displaying properties of both structural and inherent case: lexically
More informationCompositional Semantics
Compositional Semantics CMSC 723 / LING 723 / INST 725 MARINE CARPUAT marine@cs.umd.edu Words, bag of words Sequences Trees Meaning Representing Meaning An important goal of NLP/AI: convert natural language
More informationLING 329 : MORPHOLOGY
LING 329 : MORPHOLOGY TTh 10:30 11:50 AM, Physics 121 Course Syllabus Spring 2013 Matt Pearson Office: Vollum 313 Email: pearsonm@reed.edu Phone: 7618 (off campus: 503-517-7618) Office hrs: Mon 1:30 2:30,
More informationNatural Language Processing. George Konidaris
Natural Language Processing George Konidaris gdk@cs.brown.edu Fall 2017 Natural Language Processing Understanding spoken/written sentences in a natural language. Major area of research in AI. Why? Humans
More informationStructure-Preserving Extraction without Traces
Empirical Issues in Syntax and Semantics 5 O. Bonami & P. Cabredo Hofherr (eds.) 2004, pp. 27 44 http://www.cssp.cnrs.fr/eiss5 Structure-Preserving Extraction without Traces Wesley Davidson 1 Introduction
More informationArgument structure and theta roles
Argument structure and theta roles Introduction to Syntax, EGG Summer School 2017 András Bárány ab155@soas.ac.uk 26 July 2017 Overview Where we left off Arguments and theta roles Some consequences of theta
More informationOn the Notion Determiner
On the Notion Determiner Frank Van Eynde University of Leuven Proceedings of the 10th International Conference on Head-Driven Phrase Structure Grammar Michigan State University Stefan Müller (Editor) 2003
More informationDependency, licensing and the nature of grammatical relations *
UCL Working Papers in Linguistics 8 (1996) Dependency, licensing and the nature of grammatical relations * CHRISTIAN KREPS Abstract Word Grammar (Hudson 1984, 1990), in common with other dependency-based
More informationTowards a Machine-Learning Architecture for Lexical Functional Grammar Parsing. Grzegorz Chrupa la
Towards a Machine-Learning Architecture for Lexical Functional Grammar Parsing Grzegorz Chrupa la A dissertation submitted in fulfilment of the requirements for the award of Doctor of Philosophy (Ph.D.)
More informationThe Interface between Phrasal and Functional Constraints
The Interface between Phrasal and Functional Constraints John T. Maxwell III* Xerox Palo Alto Research Center Ronald M. Kaplan t Xerox Palo Alto Research Center Many modern grammatical formalisms divide
More informationAgree or Move? On Partial Control Anna Snarska, Adam Mickiewicz University
PLM, 14 September 2007 Agree or Move? On Partial Control Anna Snarska, Adam Mickiewicz University 1. Introduction While in the history of generative grammar the distinction between Obligatory Control (OC)
More informationUCLA UCLA Electronic Theses and Dissertations
UCLA UCLA Electronic Theses and Dissertations Title Head Movement in Narrow Syntax Permalink https://escholarship.org/uc/item/3fg4273b Author O'Flynn, Kathleen Chase Publication Date 2016-01-01 Peer reviewed
More informationThe Discourse Anaphoric Properties of Connectives
The Discourse Anaphoric Properties of Connectives Cassandre Creswell, Kate Forbes, Eleni Miltsakaki, Rashmi Prasad, Aravind Joshi Λ, Bonnie Webber y Λ University of Pennsylvania 3401 Walnut Street Philadelphia,
More informationMinimalism is the name of the predominant approach in generative linguistics today. It was first
Minimalism Minimalism is the name of the predominant approach in generative linguistics today. It was first introduced by Chomsky in his work The Minimalist Program (1995) and has seen several developments
More informationA Grammar for Battle Management Language
Bastian Haarmann 1 Dr. Ulrich Schade 1 Dr. Michael R. Hieb 2 1 Fraunhofer Institute for Communication, Information Processing and Ergonomics 2 George Mason University bastian.haarmann@fkie.fraunhofer.de
More informationErkki Mäkinen State change languages as homomorphic images of Szilard languages
Erkki Mäkinen State change languages as homomorphic images of Szilard languages UNIVERSITY OF TAMPERE SCHOOL OF INFORMATION SCIENCES REPORTS IN INFORMATION SCIENCES 48 TAMPERE 2016 UNIVERSITY OF TAMPERE
More informationTHE INTERNATIONAL JOURNAL OF HUMANITIES & SOCIAL STUDIES
THE INTERNATIONAL JOURNAL OF HUMANITIES & SOCIAL STUDIES PRO and Control in Lexical Functional Grammar: Lexical or Theory Motivated? Evidence from Kikuyu Njuguna Githitu Bernard Ph.D. Student, University
More informationCh VI- SENTENCE PATTERNS.
Ch VI- SENTENCE PATTERNS faizrisd@gmail.com www.pakfaizal.com It is a common fact that in the making of well-formed sentences we badly need several syntactic devices used to link together words by means
More informationDerivational: Inflectional: In a fit of rage the soldiers attacked them both that week, but lost the fight.
Final Exam (120 points) Click on the yellow balloons below to see the answers I. Short Answer (32pts) 1. (6) The sentence The kinder teachers made sure that the students comprehended the testable material
More informationCOMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR
COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR ROLAND HAUSSER Institut für Deutsche Philologie Ludwig-Maximilians Universität München München, West Germany 1. CHOICE OF A PRIMITIVE OPERATION The
More informationBULATS A2 WORDLIST 2
BULATS A2 WORDLIST 2 INTRODUCTION TO THE BULATS A2 WORDLIST 2 The BULATS A2 WORDLIST 21 is a list of approximately 750 words to help candidates aiming at an A2 pass in the Cambridge BULATS exam. It is
More informationFeature-Based Grammar
8 Feature-Based Grammar James P. Blevins 8.1 Introduction This chapter considers some of the basic ideas about language and linguistic analysis that define the family of feature-based grammars. Underlying
More informationA Version Space Approach to Learning Context-free Grammars
Machine Learning 2: 39~74, 1987 1987 Kluwer Academic Publishers, Boston - Manufactured in The Netherlands A Version Space Approach to Learning Context-free Grammars KURT VANLEHN (VANLEHN@A.PSY.CMU.EDU)
More informationParsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank
Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford,
More informationEnhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities
Enhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities Yoav Goldberg Reut Tsarfaty Meni Adler Michael Elhadad Ben Gurion
More informationFocusing bound pronouns
Natural Language Semantics manuscript No. (will be inserted by the editor) Focusing bound pronouns Clemens Mayr Received: date / Accepted: date Abstract The presence of contrastive focus on pronouns interpreted
More informationFocus of the Unit: Much of this unit focuses on extending previous skills of multiplication and division to multi-digit whole numbers.
Approximate Time Frame: 3-4 weeks Connections to Previous Learning: In fourth grade, students fluently multiply (4-digit by 1-digit, 2-digit by 2-digit) and divide (4-digit by 1-digit) using strategies
More informationAdvanced Grammar in Use
Advanced Grammar in Use A self-study reference and practice book for advanced learners of English Third Edition with answers and CD-ROM cambridge university press cambridge, new york, melbourne, madrid,
More informationSwitched Control and other 'uncontrolled' cases of obligatory control
Switched Control and other 'uncontrolled' cases of obligatory control Dorothee Beermann and Lars Hellan Norwegian University of Science and Technology, Trondheim, Norway dorothee.beermann@ntnu.no, lars.hellan@ntnu.no
More informationLNGT0101 Introduction to Linguistics
LNGT0101 Introduction to Linguistics Lecture #11 Oct 15 th, 2014 Announcements HW3 is now posted. It s due Wed Oct 22 by 5pm. Today is a sociolinguistics talk by Toni Cook at 4:30 at Hillcrest 103. Extra
More information1/20 idea. We ll spend an extra hour on 1/21. based on assigned readings. so you ll be ready to discuss them in class
If we cancel class 1/20 idea We ll spend an extra hour on 1/21 I ll give you a brief writing problem for 1/21 based on assigned readings Jot down your thoughts based on your reading so you ll be ready
More informationAP Statistics Summer Assignment 17-18
AP Statistics Summer Assignment 17-18 Welcome to AP Statistics. This course will be unlike any other math class you have ever taken before! Before taking this course you will need to be competent in basic
More informationThe Strong Minimalist Thesis and Bounded Optimality
The Strong Minimalist Thesis and Bounded Optimality DRAFT-IN-PROGRESS; SEND COMMENTS TO RICKL@UMICH.EDU Richard L. Lewis Department of Psychology University of Michigan 27 March 2010 1 Purpose of this
More informationHans-Ulrich Block, Hans Haugeneder Siemens AG, MOnchen ZT ZTI INF W. Germany. (2) [S' [NP who][s does he try to find [NP e]]s IS' $=~
The Treatment of Movement-Rules in a LFG-Parser Hans-Ulrich Block, Hans Haugeneder Siemens AG, MOnchen ZT ZT NF W. Germany n this paper we propose a way of how to treat longdistance movement phenomena
More informationIntra-talker Variation: Audience Design Factors Affecting Lexical Selections
Tyler Perrachione LING 451-0 Proseminar in Sound Structure Prof. A. Bradlow 17 March 2006 Intra-talker Variation: Audience Design Factors Affecting Lexical Selections Abstract Although the acoustic and
More informationPseudo-Passives as Adjectival Passives
Pseudo-Passives as Adjectival Passives Kwang-sup Kim Hankuk University of Foreign Studies English Department 81 Oedae-lo Cheoin-Gu Yongin-City 449-791 Republic of Korea kwangsup@hufs.ac.kr Abstract The
More informationAlgebra 2- Semester 2 Review
Name Block Date Algebra 2- Semester 2 Review Non-Calculator 5.4 1. Consider the function f x 1 x 2. a) Describe the transformation of the graph of y 1 x. b) Identify the asymptotes. c) What is the domain
More informationa) analyse sentences, so you know what s going on and how to use that information to help you find the answer.
Tip Sheet I m going to show you how to deal with ten of the most typical aspects of English grammar that are tested on the CAE Use of English paper, part 4. Of course, there are many other grammar points
More informationLanguage Acquisition Fall 2010/Winter Lexical Categories. Afra Alishahi, Heiner Drenhaus
Language Acquisition Fall 2010/Winter 2011 Lexical Categories Afra Alishahi, Heiner Drenhaus Computational Linguistics and Phonetics Saarland University Children s Sensitivity to Lexical Categories Look,
More informationDerivations (MP) and Evaluations (OT) *
Derivations (MP) and Evaluations (OT) * Leiden University (LUCL) The main claim of this paper is that the minimalist framework and optimality theory adopt more or less the same architecture of grammar:
More informationA First-Pass Approach for Evaluating Machine Translation Systems
[Proceedings of the Evaluators Forum, April 21st 24th, 1991, Les Rasses, Vaud, Switzerland; ed. Kirsten Falkedal (Geneva: ISSCO).] A First-Pass Approach for Evaluating Machine Translation Systems Pamela
More informationPRODUCT PLATFORM DESIGN: A GRAPH GRAMMAR APPROACH
Proceedings of DETC 99: 1999 ASME Design Engineering Technical Conferences September 12-16, 1999, Las Vegas, Nevada DETC99/DTM-8762 PRODUCT PLATFORM DESIGN: A GRAPH GRAMMAR APPROACH Zahed Siddique Graduate
More information6.863J Natural Language Processing Lecture 12: Featured attraction. Instructor: Robert C. Berwick
6.863J Natural Language Processing Lecture 12: Featured attraction Instructor: Robert C. Berwick berwick@ai.mit.edu The Menu Bar Administrivia: 3a due Friday; Lab 3b out Weds; due after vacation Agenda:
More informationA General Class of Noncontext Free Grammars Generating Context Free Languages
INFORMATION AND CONTROL 43, 187-194 (1979) A General Class of Noncontext Free Grammars Generating Context Free Languages SARWAN K. AGGARWAL Boeing Wichita Company, Wichita, Kansas 67210 AND JAMES A. HEINEN
More informationCharacter Stream Parsing of Mixed-lingual Text
Character Stream Parsing of Mixed-lingual Text Harald Romsdorfer and Beat Pfister Speech Processing Group Computer Engineering and Networks Laboratory ETH Zurich {romsdorfer,pfister}@tik.ee.ethz.ch Abstract
More informationObjectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition Objectives Introduce the study of logic Learn the difference between formal logic and informal logic
More informationHindi Aspectual Verb Complexes
Hindi Aspectual Verb Complexes HPSG-09 1 Introduction One of the goals of syntax is to termine how much languages do vary, in the hope to be able to make hypothesis about how much natural languages can
More informationAnalysis of Probabilistic Parsing in NLP
Analysis of Probabilistic Parsing in NLP Krishna Karoo, Dr.Girish Katkar Research Scholar, Department of Electronics & Computer Science, R.T.M. Nagpur University, Nagpur, India Head of Department, Department
More informationParsing natural language
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 1983 Parsing natural language Leonard E. Wilcox Follow this and additional works at: http://scholarworks.rit.edu/theses
More informationOhio s Learning Standards-Clear Learning Targets
Ohio s Learning Standards-Clear Learning Targets Math Grade 1 Use addition and subtraction within 20 to solve word problems involving situations of 1.OA.1 adding to, taking from, putting together, taking
More informationMOODLE 2.0 GLOSSARY TUTORIALS
BEGINNING TUTORIALS SECTION 1 TUTORIAL OVERVIEW MOODLE 2.0 GLOSSARY TUTORIALS The glossary activity module enables participants to create and maintain a list of definitions, like a dictionary, or to collect
More informationAbstractions and the Brain
Abstractions and the Brain Brian D. Josephson Department of Physics, University of Cambridge Cavendish Lab. Madingley Road Cambridge, UK. CB3 OHE bdj10@cam.ac.uk http://www.tcm.phy.cam.ac.uk/~bdj10 ABSTRACT
More informationCitation for published version (APA): Veenstra, M. J. A. (1998). Formalizing the minimalist program Groningen: s.n.
University of Groningen Formalizing the minimalist program Veenstra, Mettina Jolanda Arnoldina IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF if you wish to cite from
More informationPrediction of Maximal Projection for Semantic Role Labeling
Prediction of Maximal Projection for Semantic Role Labeling Weiwei Sun, Zhifang Sui Institute of Computational Linguistics Peking University Beijing, 100871, China {ws, szf}@pku.edu.cn Haifeng Wang Toshiba
More informationModeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures
Modeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures Ulrike Baldewein (ulrike@coli.uni-sb.de) Computational Psycholinguistics, Saarland University D-66041 Saarbrücken,
More informationTheoretical Syntax Winter Answers to practice problems
Linguistics 325 Sturman Theoretical Syntax Winter 2017 Answers to practice problems 1. Draw trees for the following English sentences. a. I have not been running in the mornings. 1 b. Joel frequently sings
More informationUnderlying and Surface Grammatical Relations in Greek consider
0 Underlying and Surface Grammatical Relations in Greek consider Sentences Brian D. Joseph The Ohio State University Abbreviated Title Grammatical Relations in Greek consider Sentences Brian D. Joseph
More informationUniversity of Edinburgh. University of Pennsylvania
Behrens & Fabricius-Hansen (eds.) Structuring information in discourse: the explicit/implicit dimension, Oslo Studies in Language 1(1), 2009. 171-190. (ISSN 1890-9639) http://www.journals.uio.no/osla :
More informationGuidelines for Writing an Internship Report
Guidelines for Writing an Internship Report Master of Commerce (MCOM) Program Bahauddin Zakariya University, Multan Table of Contents Table of Contents... 2 1. Introduction.... 3 2. The Required Components
More informationThe semantics of case *
The semantics of case * ANNABEL CORMACK 1 Introduction As it is currently understood within P&P theory, the Case module appears to be a purely syntactic condition, contributing to regulating the syntactic
More informationThe Structure of Relative Clauses in Maay Maay By Elly Zimmer
I Introduction A. Goals of this study The Structure of Relative Clauses in Maay Maay By Elly Zimmer 1. Provide a basic documentation of Maay Maay relative clauses First time this structure has ever been
More informationSetting Up Tuition Controls, Criteria, Equations, and Waivers
Setting Up Tuition Controls, Criteria, Equations, and Waivers Understanding Tuition Controls, Criteria, Equations, and Waivers Controls, criteria, and waivers determine when the system calculates tuition
More informationA relational approach to translation
A relational approach to translation Rémi Zajac Project POLYGLOSS* University of Stuttgart IMS-CL /IfI-AIS, KeplerstraBe 17 7000 Stuttgart 1, West-Germany zajac@is.informatik.uni-stuttgart.dbp.de Abstract.
More informationRANKING AND UNRANKING LEFT SZILARD LANGUAGES. Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A ER E P S I M S
N S ER E P S I M TA S UN A I S I T VER RANKING AND UNRANKING LEFT SZILARD LANGUAGES Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A-1997-2 UNIVERSITY OF TAMPERE DEPARTMENT OF
More informationImproved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form
Orthographic Form 1 Improved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form The development and testing of word-retrieval treatments for aphasia has generally focused
More informationToday we examine the distribution of infinitival clauses, which can be
Infinitival Clauses Today we examine the distribution of infinitival clauses, which can be a) the subject of a main clause (1) [to vote for oneself] is objectionable (2) It is objectionable to vote for
More informationSOME MINIMAL NOTES ON MINIMALISM *
In Linguistic Society of Hong Kong Newsletter 36, 7-10. (2000) SOME MINIMAL NOTES ON MINIMALISM * Sze-Wing Tang The Hong Kong Polytechnic University 1 Introduction Based on the framework outlined in chapter
More informationOn Labeling: Principle C and Head Movement
Syntax 2010 DOI: 10.1111/j.1467-9612.2010.00140.x On Labeling: Principle C and Head Movement Carlo Cecchetto and Caterina Donati Abstract. In this paper, we critically reexamine the two algorithms that
More information