Grammar Development with LFG and XLE. Miriam Butt University of Konstanz
|
|
|
- Silvester Holland
- 6 years ago
- Views:
Transcription
1 Grammar Development with LFG and XLE Miriam Butt University of Konstanz
2 Last Time Integration of a Finite-State Morphological Analyzer - Sublexical Rules - Sublexical Entries - The -unknown entry The XLE Lexicon Lookup Model
3 This Time: Lesson 8 1. Verbal Complements: COMP and XCOMP Finite Complements (COMP) Non-finite Complements (XCOMP) Control Verbs Theory of Control and Complementation 2. Regression Testing (Testsuites) and Debugging
4 Types of Arguments! So far we have been working with the following grammatical functions (GFs): SUBJ, OBJ, OBJ2, OBL! But there are also GFs corresponding to clausal arguments: XCOMP, COMP! COMP is generally used for finite that-clauses! XCOMP is generally used for non-finite embedded clauses.
5 Types of Arguments! You can read up on grammatical functions in LFG and how to test for them in the Dalrymple book, Ch. 2.
6 Complements: COMP! Some verbs require finite clausal arguments: think: Kim thinks [that the gorilla ate the bananas]. say: Kim said [that the gorilla ate the bananas]. believe: Kim believes [that the gorilla eats cake]....! These arguments are treated as COMP in LFG at f-structure and as a CP at c-structure.! Note that they are recursive Kim thinks that Sandy said that the gorilla ate the bananas. Kim thinks that Sandy said that the dog believes that the gorilla ate the bananas.
7 A (simplified) f-str with COMP PRED SUBJ 'believe<(^subj),(^comp)>' PRED 'Kim' NUM sg, PERS 3, CASE nom COMP PRED 'eat<(^subj),(^obj)>' SUBJ OBJ PRED 'Kim' NUM sg, PERS 3, CASE nom PRED 'cake' NUM sg, PERS 3, CASE acc
8 Complements: XCOMP! Some verbs require non-finite clausal arguments: persuade: Kim persuaded the gorilla [to eat cake]. promise: Kim promised the gorilla [to eat cake]. want: Kim wanted [to eat cake.] want: Kim wanted the gorilla [to eat cake.]! These arguments are treated as XCOMP in LFG at f-structure and generally as a VP at c-structure.
9 Complements: XCOMP! Note that they are recursive as well Kim wanted to persuade Sandy to eat cake. Kim wanted to persuade Sandy to promise the gorilla to eat cake....! They also interact with the COMPs Kim thinks that Sandy wants to persuade Peter to believe that the gorilla ate cake. Kim promised Sandy to believe that Peter persuaded the gorilla to eat cake....
10 XCOMP: Functional Control! The non-finite clauses are called XCOMPs in LFG because the embedded clause contains a open SUBJ argument that is controlled by an argument in the matrix clause.! Which argument controls the embedded SUBJ is lexically determined.! Who is doing the eating? Sandy Kim persuaded Sandy [ to eat cake].! Who is doing the eating? Kim Kim promised Sandy [ to eat cake].
11 Open Functions! XCOMP is considered to be an open GF because one of its arguments is not specified within the clause.! XADJUNCT is its adjunct counterpart. [ Having eaten the cake], Kim ordered some tea.! The subject of the embedded non-finite adjunct is controlled by an entity outside of the clause.
12 XCOMP: Functional Control! Each control verb needs to specify in the lexicon whether it is a subject or an object control verb (want does both).! Object control verb: persuade Kim persuaded Sandy [ to eat cake].! Subject control verb: promise Kim promised Sandy [ to eat cake].
13 A (simplified) f-str with XCOMP OBJ control PRED SUBJ OBJ 'persuade<(^subj)(^ OBJ)(^XCOMP)>' PRED 'Kim' NUM sg, PERS 3, CASE nom PRED 'Sandy' NUM sg, PERS 3, CASE acc XCOMP PRED 'eat<(^subj),(^obj)>' SUBJ OBJ PRED 'cake' NUM sg, PERS 3, CASE acc
14 A (simplified) f-str with XCOMP SUBJ control PRED SUBJ OBJ 'promise<(^subj)(^ OBJ)(^XCOMP)>' PRED 'Kim' NUM sg, PERS 3, CASE nom PRED 'Sandy' NUM sg, PERS 3, CASE acc XCOMP PRED 'eat<(^subj),(^obj)>' SUBJ OBJ PRED 'cake' NUM sg, PERS 3, CASE acc
15 XCOMP: Functional Control! The lexical specification is done by means of a control equation.! Object control verb: persuade (^ XCOMP SUBJ) = (^ OBJ) Kim persuaded Sandy [ to eat cake].! Subject control verb: promise (^ XCOMP SUBJ) = (^ SUBJ) Kim promised Sandy [ to eat cake]
16 Control and Complementation! The basic theoretical concepts for understanding control and complementation in LFG were worked out in the early 1980s.! Classic article: Bresnan, Joan Control and Complementation. In The Mental Representation of Grammatical Relations. The MIT Press. Reprinted in: Bresnan, Joan Control and Complementation. Linguistic Inquiry 11(3):
17 Demo grammar7.lfg testsuite7.lfg Grammar Engineering: Testsuites and Debugging (morphological analyzer) COMP and XCOMP
18 Practical Work! This concludes Lesson 8.! The practical work you should do now is detailed in Exercise 8.! You will practice with integrating verbal complements (COMP, XCOMP) writing entries for control verbs learn about raising verbs
19
Grammar Development with LFG and XLE. Miriam Butt University of Konstanz
Grammar Development with LFG and XLE Miriam Butt University of Konstanz Last Time Verbal Complements: COMP and XCOMP - Finite Complements - Subject vs. Object Control in XCOMPs - Control Equations in lexical
Introduction 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
Grammar Knowledge Transfer for Building RMRSs over Dependency Parses in Bulgarian
Grammar Knowledge Transfer for Building RMRSs over Dependency Parses in Bulgarian Kiril Simov and Petya Osenova Linguistic Modelling Department, IICT, Bulgarian Academy of Sciences DELPH-IN, Sofia, 2012
Unification in Unification-based Grammar
THE SIXTH JAPANESE-KOREAN JOINT CONFERENCE ON FORMAL LINGUISTICS,1991 Unification in Unification-based Grammar K.S.Choi, D.J.Son, and G.C.Kim Department of Computer Science Korea Advanced Institute of
Lexical entries & clauses
Lexical entries & clauses 2013 Jan 18 The problem The inadequacy of PS-rules a. * John devoured. John fainted. b. * Cezanne fainted the apple. Cezanne painted the apple. c. * John ate the apple the pear.
The uniform treatment of constraints, coherency and completeness in a Lexical Functional Grammar compiler
The uniform treatment of constraints, coherency and completeness in a Lexical Functional Grammar compiler Peter Hancox School of Computer Science University of Birmingham Lexical Functional Grammar (LFG)
Goals of the talk: of linking theory into the projection architecture of Integration LFG Choice of correct linkings by preference rankings 2
An architecture for linking theory in LFG Butt, Mary Dalrymple, and Anette Frank Miriam of Konstanz/Xerox PARC/RXRC-Grenoble University June 1997 LFG97, of California{San Diego University 1 Goals of the
AUTOMATIC LFG GENERATION
AUTOMATIC LFG GENERATION MS Thesis for the Degree of Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science (Computer Science) at the National University of Computer and
Computational Linguistics: Feature Agreement
Computational Linguistics: Feature Agreement Raffaella Bernardi Contents 1 Admin................................................... 4 2 Formal Grammars......................................... 5 2.1 Recall:
Clausal 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
Context-Free Grammars
Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 3, 2012 (CFGs) A CFG is an ordered quadruple T, N, D, P where a. T is a finite set called the terminals; b. N is a
LING 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
Context-Free Grammars. Carl Pollard Ohio State University. Linguistics 680 Formal Foundations Tuesday, November 10, 2009
Context-Free Grammars Carl Pollard Ohio State University Linguistics 680 Formal Foundations Tuesday, November 10, 2009 These slides are available at: http://www.ling.osu.edu/ scott/680 1 (1) Context-Free
Computational Linguistics (INF2820 TFSs)
S NP Det N VP V The dog barked LTOP h 1 INDEX e 2 def q rel bark v rel prpstn m rel LBL h 4 dog n rel LBL h RELS LBL h 1 ARG0 x 5 LBL h 9 8 ARG0 e MARG h 3 RSTR h 6 ARG0 x 2 5 ARG1 x BODY h 5 7 HCONS h
Einführung in die Computerlinguistik
Einführung in die Computerlinguistik Feature Structures Merkmalsstrukturen Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2018 1 / 23 Introduction (1) Non-terminals that are used in CFGs
Wh-questions. Ling 567 May 9, 2017
Wh-questions Ling 567 May 9, 2017 Overview Target representation The problem Solution for English Solution for pseudo-english Lab 7 overview Negative auxiliaries interactive debugging Wh-questions: Target
Elementary 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
Context-Free Grammars
Context-Free Grammars Carl Pollard yntax 2 (Linguistics 602.02) January 3, 2012 Context-Free Grammars (CFGs) A CFG is an ordered quadruple T, N, D, P where a. T is a finite set called the terminals; b.
Computational Linguistics (INF2820 TFSs)
S NP Det N VP V The dog barked LTOP h 1 INDEX e 2 def q rel bark v rel prpstn m rel LBL h 4 dog n rel LBL h RELS LBL h 1 ARG0 x 5 LBL h 9 8 ARG0 e MARG h 3 RSTR h 6 ARG0 x 2 5 ARG1 x BODY h 5 7 HCONS h
Lesson 3: Solving for Unknown Angles using Equations
Classwork Opening Exercise Two lines meet at the common vertex of two rays; the measurement of. Set up and solve an equation to find the value of and. Example 1 Set up and solve an equation to find the
The Verb. From Probabilities to Internal Categories. Cem Bozşahin. Cognitive Science Department, The Informatics Institute, ODTÜ
The Verb From Probabilities to Internal Categories Cem Bozşahin bozsahin@metu.edu.tr Cognitive Science Department, The Informatics Institute, ODTÜ November 18, 2016 Joint work with Mark Steedman (with
1 Informal Motivation
CHAPTER SEVEN: (PRE)SEMILATTICES AND TREES 1 Informal Motivation As we will illustrate presently, given a CFG T,N,D,P, a nonterminal A N, and a T-string s C A, we can use the CFG to guide us in constructing
11-682: Introduction to IR, NLP, MT and Speech. Parsing with Unification Grammars. Reading: Jurafsky and Martin, Speech and Language Processing
11-682: Introduction to IR, NLP, MT and Speech Parsing with Unification Grammars Reading: Jurafsky and Martin, Speech and Language Processing Chapter 11 Augmenting CFGs with Features Certain linguistic
1 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
Knowledge Engineering for NLP May 1, 2005 Clausal semantics
Knowledge Engineering for NLP May 1, 2005 Clausal semantics Overview Why clausal semantics? What s a clause? Messages in G&S, MRS, the Matrix Messages and the syntax-semantics interface Details about this
A Lattice Based Algebraic Model for Verb Centered Constructions
A Lattice Based Algebraic Model for Verb Centered Constructions Bálint Sass Research Institute for Linguistics, Hungarian Academy of Sciences sass.balint@nytud.mta.hu Abstract. In this paper we present
FLE Preliminary Results
FLE Preliminary Results Damir Cavar, Lwin Moe, Hai Hu Indiana University Headlex 2016, Warsaw, Poland 1 Help Graduate Students Hai Hu, Kenneth Steimel, Tim Gilmanov, Joshua Herring Support Kenneth Beesley
exlepse Eclipse XLE Plugin
exlepse Eclipse XLE Plugin Motivation During the course Grammar Development, held at the University of Konstanz in the Summer Term 2010, we were confronted with XLE and its development environment, the
synsem local cat head head-dtr... head 1 dtrs hd-str headed-phrase
headed-phrase synsem local cat head [ 1 head-dtr... head 1 dtrs hd-str pred likes, tense pres subj pred Fido obj pred bones AVMs in L A TEX Andrew Bredenkamp September 25, 2007 Most people use Chris Manning
User-Defined Nonmonotonicity in Unification-Based Formalisms
User-Defined Nonmonotonicity in Unification-Based Formalisms Lena Str~Smb~ick Department of Computer and Information Science LinkSping University S-58185 LinkSping, Sweden lestr~ida, liu. so Abstract A
L322 Syntax. Chapter 3: Structural Relations. Linguistics 322 D E F G H. Another representation is in the form of labelled brackets:
L322 Syntax Chapter 3: Structural Relations Linguistics 322 1 The Parts of a Tree A tree structure is one of an indefinite number of ways to represent a sentence or a part of it. Consider the following
Proseminar 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
Towards a basic DCG for English: X-bar Theory. A DCG for English using gap threading for unbounded dependencies. Verb phrases and sentences
Towards a basic DCG for English: X-bar Theory A DCG for English using gap threading for unbounded dependencies Detmar Meurers: Intro to Computational Linguistics I OSU, LING 684.01 Generalizing over possible
Overview and Future Promise of Battle Management Language
C 4 I Center Overview and Future Promise of Battle Management Language Dr. Michael Hieb Center of Excellence in C4I George Mason University mhieb@gmu.edu Content 1. BML Definition 2. BML Motivation 3.
More Theories, Formal semantics
Parts are based on slides by Carl Pollard Charles University, 2011-11-12 Optimality Theory Universal set of violable constraints: Faithfulness constraints:surface forms should be as close as to underlying
Optional Arguments in Abstract Categorial Grammar
Optional Arguments in Abstract Categorial Grammar Chris Blom MSc. Thesis, 30 ECTS Master in Cognitive Artificial Intelligence, Utrecht University May 2012 First supervisor : dr. Yoad Winter Second supervisor
A simple syntax-directed
Syntax-directed is a grammaroriented compiling technique Programming languages: Syntax: what its programs look like? Semantic: what its programs mean? 1 A simple syntax-directed Lexical Syntax Character
A Minimal GB Parser. Marwan Shaban. October 26, Boston University
A Minimal GB Parser Marwan Shaban shaban@cs.bu.edu October 26, 1993 BU-CS Tech Report # 93-013 Computer Science Department Boston University 111 Cummington Street Boston, MA 02215 Abstract: We describe
COP 3402 Systems Software Syntax Analysis (Parser)
COP 3402 Systems Software Syntax Analysis (Parser) Syntax Analysis 1 Outline 1. Definition of Parsing 2. Context Free Grammars 3. Ambiguous/Unambiguous Grammars Syntax Analysis 2 Lexical and Syntax Analysis
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.
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
fragments covered in earlier work more than 1,000,000 words in over 49,000 sentences so this newer work is an attempt to demonstrate that sets of f-st
Evaluating Automatic F-Structure Annotation for the Penn-II Treebank Aoife Cahill, Mairead McCarthy, Josef Van Genabith and Andy Way School of Computer Applications, Dublin City University, Dublin, Ireland.
A Method for. Disjunctive Constraint Satisfaction. Xerox Palo Alto Research Center
A Method for Disjunctive Constraint Satisfaction John T. Maxwell III Ronald M. Kaplan Xerox Palo Alto Research Center 1 Introduction A distinctive property of many current grammatical formalisms is their
Computational Linguistics
Computational Linguistics CSC 2501 / 485 Fall 2018 3 3. Chart parsing Gerald Penn Department of Computer Science, University of Toronto Reading: Jurafsky & Martin: 13.3 4. Allen: 3.4, 3.6. Bird et al:
A partial and impartial view on partitives
A partial and impartial view on partitives Anne Tamm tamm.anne@gmail.com Research Institute of Linguistics, Hungarian Academy of Sciences The University of Hungarian Reformed Church, Budapest Workshop
Algorithms for AI and NLP (INF4820 TFSs)
S Det N VP V The dog barked LTOP h 1 INDEX e 2 def q rel bark v rel prpstn m rel LBL h 4 dog n rel LBL h RELS LBL h 1 ARG0 x 5 LBL h 9 8 ARG0 e MARG h 3 RSTR h 6 ARG0 x 2 5 ARG1 x BODY h 5 7 HCONS h 3
Statistical Parsing for Text Mining from Scientific Articles
Statistical Parsing for Text Mining from Scientific Articles Ted Briscoe Computer Laboratory University of Cambridge November 30, 2004 Contents 1 Text Mining 2 Statistical Parsing 3 The RASP System 4 The
Theory and Compiling COMP360
Theory and Compiling COMP360 It has been said that man is a rational animal. All my life I have been searching for evidence which could support this. Bertrand Russell Reading Read sections 2.1 3.2 in the
The MetaGrammar Compiler: An NLP Application with a Multi-paradigm Architecture
The MetaGrammar Compiler: An NLP Application with a Multi-paradigm Architecture Denys Duchier Joseph Le Roux Yannick Parmentier LORIA Campus cientifique, BP 239, F-54 506 Vandœuvre-lès-Nancy, France MOZ
Dependency grammar and dependency parsing
Dependency grammar and dependency parsing Syntactic analysis (5LN455) 2014-12-10 Sara Stymne Department of Linguistics and Philology Based on slides from Marco Kuhlmann Mid-course evaluation Mostly positive
Application of recursion. Grammars and Parsing. Recursive grammar. Grammars
Application of recursion Grammars and Parsing So far, we have written recursive programs on integers. Let us now consider a new application, grammars and parsing, that shows off the full power of recursion.
A logic-based grammar formalism incorporating feature-structures and inheritance
Oregon Health & Science University OHSU Digital Commons Scholar Archive December 1988 A logic-based grammar formalism incorporating feature-structures and inheritance Harry H. III Porter Follow this and
Syntax Analysis, VII One more LR(1) example, plus some more stuff. Comp 412 COMP 412 FALL Chapter 3 in EaC2e. target code.
COMP 412 FALL 2017 Syntax Analysis, VII One more LR(1) example, plus some more stuff Comp 412 source code IR Front End Optimizer Back End IR target code Copyright 2017, Keith D. Cooper & Linda Torczon,
Ling/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
Dependency Grammar as Graph Description
Dependency Grammar as Graph Description Ralph Debusmann Programming Systems Lab Universität des Saarlandes Dependency Grammar as Graph Description p.1 This talk introduces a new meta grammar formalism
CMSC 201 Fall 2016 Lab 09 Advanced Debugging
CMSC 201 Fall 2016 Lab 09 Advanced Debugging Assignment: Lab 09 Advanced Debugging Due Date: During discussion Value: 10 points Part 1: Introduction to Errors Throughout this semester, we have been working
Getting Started With Syntax October 15, 2015
Getting Started With Syntax October 15, 2015 Introduction The Accordance Syntax feature allows both viewing and searching of certain original language texts that have both morphological tagging along with
Argument Structures and Semantic Roles: Actual State in ISO TC37/SC4 TDG 3
ISO/TC 37/SC 4 N280 Argument Structures and Semantic Roles: Actual State in ISO TC37/SC4 TDG 3 Thierry Declerck (DFKI), joined work with Mandy Schiffrin (Tilburg) Possible Definition of Semantic Roles
Ling 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
6.037 Lecture 7B. Scheme Variants Normal Order Lazy Evaluation Streams
6.037 Lecture 7B Scheme Variants Normal Order Lazy Evaluation Streams Edited by Mike Phillips & Ben Vandiver Original Material by Eric Grimson & Duane Boning Further Variations on a Scheme Beyond Scheme
Homework & NLTK. CS 181: Natural Language Processing Lecture 9: Context Free Grammars. Motivation. Formal Def of CFG. Uses of CFG.
C 181: Natural Language Processing Lecture 9: Context Free Grammars Kim Bruce Pomona College pring 2008 Homework & NLTK Review MLE, Laplace, and Good-Turing in smoothing.py Disclaimer: lide contents borrowed
Ontology-guided Extraction of Complex Nested Relationships
2010 22nd International Conference on Tools with Artificial Intelligence Ontology-guided Extraction of Complex Nested Relationships Sushain Pandit, Vasant Honavar Department of Computer Science Iowa State
The Application of Constraint Rules to Data-driven Parsing
The Application of Constraint Rules to Data-driven Parsing Sardar Jaf The University of Manchester jafs@cs.man.ac.uk Allan Ramsay The University of Manchester ramsaya@cs.man.ac.uk Abstract In this paper,
Compilers - Chapter 2: An introduction to syntax analysis (and a complete toy compiler)
Compilers - Chapter 2: An introduction to syntax analysis (and a complete toy compiler) Lecturers: Paul Kelly (phjk@doc.ic.ac.uk) Office: room 304, William Penney Building Naranker Dulay (nd@doc.ic.ac.uk)
Unit 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
Subtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5.
Objective 1 Subtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5. -7-6 -5-4 -3-2 -1 0 1 2 3 4 5 6 7 Using the number line
A high-level approach to language description
A high-level approach to language description Lionel Clément and Jérôme Kirman and Sylvain Salvati Université de Bordeaux - LaBRI INRIA Polymnie meeting 12 Mars 2014 Context and motivation Linguistic formalization
6.1 Basics of functional type theory, semantics of serial verbs via function composition.
PART 6. SEMANTIC PARSING OF THE VERB CLUSTER IN DUTCH AND GERMAN 6.1 Basics of functional type theory, semantics of serial verbs via function composition. Basics of functional type theory (ignoring intensionality)
Ling/CSE 472: Introduction to Computational Linguistics. 5/21/12 Unification, parsing with unification Meaning representation
Ling/CSE 472: Introduction to Computational Linguistics 5/21/12 Unification, parsing with unification Meaning representation Overview Unification Unification algorithm Parsing with unification Representing
Defining Program Syntax. Chapter Two Modern Programming Languages, 2nd ed. 1
Defining Program Syntax Chapter Two Modern Programming Languages, 2nd ed. 1 Syntax And Semantics Programming language syntax: how programs look, their form and structure Syntax is defined using a kind
MINIMALIST INQUIRIES AND DERIVATION BY PHASE MAIN POINTS
Anagnostopoulou / Fox Advanced Syntax, Spring 2007 MINIMALIST INQUIRIES AND DERIVATION BY PHASE MAIN POINTS [This handout contains material from Winfried Lechner s handout Economy in the Minimalist Program
Lecture 5: Declarative Programming. The Declarative Kernel Language Machine. September 12th, 2011
Lecture 5: Declarative Programming. The Declarative Kernel Language Machine September 12th, 2011 1 Lecture Outline Declarative Programming contd Dataflow Variables contd Expressions and Statements Functions
Ling/CSE 472: Introduction to Computational Linguistics. 4/6/15: Morphology & FST 2
Ling/CSE 472: Introduction to Computational Linguistics 4/6/15: Morphology & FST 2 Overview Review: FSAs & FSTs XFST xfst demo Examples of FSTs for spelling change rules Reading questions Review: FSAs
The CKY algorithm part 2: Probabilistic parsing
The CKY algorithm part 2: Probabilistic parsing Syntactic analysis/parsing 2017-11-14 Sara Stymne Department of Linguistics and Philology Based on slides from Marco Kuhlmann Recap: The CKY algorithm The
A Principle Compiler for Extensible Dependency Grammar
A Principle Compiler for Extensible Dependency Grammar Bachelor Thesis Programming Systems Lab Jochen Setz, 08.11.2007 Betreuer: Ralph Debusmann A Principle Compiler for Extensible Dependency Grammar p.1/45
1 Ellipsis resolution as a semantic relation between source and target. Dalrymple et al. (1991), Shieber et al. (1996): The equational analysis
Ellipsis Resource accounting at the syntax-semantics interface 26 Feb 02 The basic data (1) Ellipsis resolution: a. John saw a flying saucer, and Bill did too. b. = Bill saw a flying saucer. (2) Strict
Indexing Methods for Efficient Parsing with Typed Feature Structure Grammars
Indexing Methods for Efficient Parsing with Typed Feature Structure Grammars Cosmin Munteanu A thesis submitted in conformity with the requirements for the degree of Master of Science Department of Computer
Linguistics and Philosophy 23: , Is Compositionality Formally Vacuous? Francis Jeffry Pelletier
Linguistics and Philosophy 23: 629-633, 1998 Is Compositionality Formally Vacuous? Ali Kazmi Dept. Philosophy Univ. Calgary Francis Jeffry Pelletier Dept. Philosophy Univ. Alberta We prove a theorem stating
Introduction to Semantics. Expanding Our Formalism, Part 2 1
Expanding Our Formalism, Part 2 1 1. Lambda Notation for Defining Functions As you may have guessed by this point, most expressions of natural language will have some kind of function as their extension
Compiler I: Sytnax Analysis
Elements of Computing Systems, Nisan & Schocken, MIT Press www.idc.ac.il/tecs Compiler I: Sytnax Analysis Usage and Copyright Notice: Copyright 2005 Noam Nisan and Shimon Schocken This presentation contains
Theory of Computation - Module 1
Theory of Computation - Module 1 Syllabus Proving techniques- Mathematical induction - Diagonalization principle - Pigeonhole principle - Functions - Primitive recursive and partial recursive functions
LING 253: SYNTAX I SECTION. (Specifier Rule) (Adjunct Rule) (Complement Rule)
LIG 253: SYAX I SECIO SABIA MAYIKU OC. 17, 2012 1. Our current rules for English XP (YP) X X (ZP) X or X X (ZP) X X (WP) XP XP Conj XP X X Conj X X X Conj X X X WP UP (Specifier Rule) (Adjunct Rule) (Complement
Computer Project #2 (Matrix Operations)
Math 0280 Introduction to Matrices and Linear Algebra Fall 2006 Computer Project #2 (Matrix Operations) SCHEDULE: This assignment is due in class on Monday, October 23, 2006. One submission per group is
2 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.
Lexical vs. Dynamic Scope
Intro Lexical vs. Dynamic Scope where do I point to? Remember in Scheme whenever we call a procedure we pop a frame and point it to where the procedure points to (its defining environment). This is called
4.2 Variations on a Scheme -- Lazy Evaluation
[Go to first, previous, next page; contents; index] 4.2 Variations on a Scheme -- Lazy Evaluation Now that we have an evaluator expressed as a Lisp program, we can experiment with alternative choices in
Prolog-embedding typed feature structure grammar and grammar tool. Version 4.
1 Prolog-embedding typed feature structure grammar and grammar tool. Version 4. Mats Dahllöf Department of Linguistics, Uppsala University E-mail: mats.dahllof@ling.uu.se August, 2002 Work in progress!
XML. extensible Markup Language. ... and its usefulness for linguists
XML extensible Markup Language... and its usefulness for linguists Thomas Mayer thomas.mayer@uni-konstanz.de Fachbereich Sprachwissenschaft, Universität Konstanz Seminar Computerlinguistik II (Miriam Butt)
Topic 3: Syntax Analysis I
Topic 3: Syntax Analysis I Compiler Design Prof. Hanjun Kim CoreLab (Compiler Research Lab) POSTECH 1 Back-End Front-End The Front End Source Program Lexical Analysis Syntax Analysis Semantic Analysis
Tree Macros. Emma Pease November 4, 2005
Tree Macros Emma Pease November 4, 2005 The tree macros package allows one to integrate TEX and Postscript. For example, one can use TEX to layout a tree and have Postscript draw the lines. top node left
Only the original curriculum in Danish language has legal validity in matters of discrepancy
CURRICULUM Only the original curriculum in Danish language has legal validity in matters of discrepancy CURRICULUM OF 1 SEPTEMBER 2007 FOR THE BACHELOR OF ARTS IN INTERNATIONAL BUSINESS COMMUNICATION (BA
Related Course Objec6ves
Syntax 9/18/17 1 Related Course Objec6ves Develop grammars and parsers of programming languages 9/18/17 2 Syntax And Seman6cs Programming language syntax: how programs look, their form and structure Syntax
Dependency grammar and dependency parsing
Dependency grammar and dependency parsing Syntactic analysis (5LN455) 2015-12-09 Sara Stymne Department of Linguistics and Philology Based on slides from Marco Kuhlmann Activities - dependency parsing
Delimited Continuations, Applicative Functors and Natural Language Semantics
Delimited Continuations, Applicative Functors and Natural Language Semantics Björn Bringert Department of Computer Science and Engineering Chalmers University of Technology and University of Gothenburg
Specifying Syntax COMP360
Specifying Syntax COMP360 The most important thing in the programming language is the name. A language will not succeed without a good name. I have recently invented a very good name and now I am looking
Logic and Natural Language Semantics: Formal Semantics
Logic and Natural Language Semantics: Formal Semantics Raffaella Bernardi DISI, University of Trento e-mail: bernardi@disi.unitn.it Contents 1 Logic....................................................
A Brief Incomplete Introduction to NLTK
A Brief Incomplete Introduction to NLTK This introduction ignores and simplifies many aspects of the Natural Language TookKit, focusing on implementing and using simple context-free grammars and lexicons.
RAISE in Perspective
RAISE in Perspective Klaus Havelund NASA s Jet Propulsion Laboratory, Pasadena, USA Klaus.Havelund@jpl.nasa.gov 1 The Contribution of RAISE The RAISE [6] Specification Language, RSL, originated as a development
Dependency grammar and dependency parsing
Dependency grammar and dependency parsing Syntactic analysis (5LN455) 2016-12-05 Sara Stymne Department of Linguistics and Philology Based on slides from Marco Kuhlmann Activities - dependency parsing
STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH
Slide 3.1 3 STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH 3.0 Introduction 3.1 Graph Theory 3.2 Strategies for State Space Search 3.3 Using the State Space to Represent Reasoning with the Predicate
Abstract Syntax and Universal Dependencies
Abstract Syntax and Universal Dependencies Aarne Ranta Joint work with Prasanth Kolachina University of Malta, 4 April 2017 Structural representations - defining the level of abstraction In computational