Carnegie Mellon School of Computer Science Copyright © 2007, Carnegie Mellon. All Rights Reserved. 1 LTI Grammars and Lexicons Grammar Writing 11-721 Grammars.

Slides:



Advertisements
Similar presentations
Empowering Editing On Building a Proofreading Guide.
Advertisements

VARIABLES AND DEBUGGING Beginning Programming. Assignment Statements  Used to hold values in a variable  Calculates a result and stores it in a variable.
Copyright © 1997 Carnegie Mellon University Introduction to the Personal Software Process - Lecture 1 1 Introduction to the Personal Software Process Lecture.
General Computer Science for Engineers CISC 106 Lecture 21 Dr. John Cavazos Computer and Information Sciences 04/10/2009.
Lecture 37 CSE 331 Nov 4, Homework stuff (Last!) HW 10 at the end of the lecture Solutions to HW 9 on Monday Graded HW 9 on.
Exercise Exercise3.1 8 Exercise3.1 9 Exercise
Exercise Exercise Exercise Exercise
Exercise Exercise Exercise Exercise
Exercise Exercise6.1 7 Exercise6.1 8 Exercise6.1 9.
Chapter 1 Computer Networks and the Internet. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 1-2.
Class 1: What this course is about. Assignments Reading: Chapter 1, pp 1-33 Do in Class 1: –Exercises on pages 13, 14, 22, 28 To hand in in Class 2: –Exercises.
Carnegie Mellon School of Computer Science Copyright © 2007, Carnegie Mellon. All Rights Reserved. 1 LTI Grammars and Lexicons Grammar Writing Lecture.
Link Grammar ( by Davy Temperley, Daniel Sleator & John Lafferty ) Syed Toufeeq Ahmed ASU.
Information Technology Fundamentals (ITF) Mr. Shultz.
Research Paper – Part 2 Computer Information Technology.
Copyright © 2008 James Taylor All Rights Reserved Worldwide.
CS Unplugged Demo Lester Jackson, Sr. Program Manager.
Intro to C++. Getting Started with Microsoft Visual Studios Open Microsoft Visual Studios 2010 Click on file Click on New Project Choose Visual C++ on.
Words + picturesPicturesWords Day Day
Substitute 0 for y. Write original equation. To find the x- intercept, substitute 0 for y and solve for x. SOLUTION Find the x- intercept and the y- intercept.
computer
Carnegie Mellon School of Computer Science Copyright © 2001, Carnegie Mellon. All Rights Reserved. JAVELIN Project Briefing 1 AQUAINT Phase I Kickoff December.
Natural Language Processing Course Project: Zhao Hai 赵海 Department of Computer Science and Engineering Shanghai Jiao Tong University
15 Copyright © Oracle Corporation, All rights reserved. RMAN Incomplete Recovery.
© SKY Computers, Inc. All Rights Reserved 9/25/02 Slide 1 VSIPL, from API to Product Sharon M. Sacco.
Basic Programming Lingo. A program is also known as a  Sequence of instructions  Application  App  Binary  Executable.
Author: Alex Groce, Daniel Kroening, and Flavio Lerda Computer Science Department, Carnegie Mellon University Pittsburgh, PA Source: R. Alur and.
TECHNICAL WRITING November 2 nd, Today Instruction style Procedures for Policy.
Dangling Modifiers-> A dangling modifier is a word or phrase that modifies a word not clearly stated in the sentence.
ERRORS. Types of errors: Syntax errors Logical errors.
Wednesday, Sept. 30 Sophomores. Today’s “Writing Review” Purpose : 1.Review your understanding of how to use words correctly – word choice matters!
12. SENSE RELATION 3 Objective : Students are able to apply the notion of ambiguity in their daily communication Topics: Lexical Ambiguity Grammatical.
Carnegie Mellon School of Computer Science Copyright © 2007, Carnegie Mellon. All Rights Reserved. 1 LTI Grammars and Lexicons Grammar Writing Lecture.
+ Daily Grammar Warm-Up 10/1/09-10/13/09. + Thursday 10/1/09: Adjectives A little adjective practice.... Please turn to page 43 of you Holt Handbook.
Carnegie Mellon School of Computer Science Copyright © 2007, Carnegie Mellon. All Rights Reserved. 1 LTI Grammars and Lexicons Grammar Writing Lecture.
Solving One Step Equations Algebra I. Addition and Subtraction One Step Equations A solution of an equation is the value or values of the variable that.
Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Day 20.
Monday January 6, 2014 Math- Review for test Wednesday HW: Finish Study Guide 4 th –How do you solve for a equation? Reading- 1 st, 2 nd, 5 th : Giraffe~complete.
AP Computer Science. January 5, 2016 PowerPoint – Begin Array’s R7.1 R7.2 R7.6 E7.1 All this homework due Wednesday 1/6. Submit through Aspen pages Read.
Copyright © 2008 Vista Higher Learning. All rights reserved. 9.
Section 1.5 Circles Copyright © 2013 Pearson Education, Inc. All rights reserved.
Software Design and Development
Editing for Grammar and Punctuation
ASSIGNMENT NO.-2.
Copyrights apply.
Quick Start Guide for Visual Studio 2010
Unit Flow In the long run, the product flow through each operation must be proportional to the output flow of the process 8/24/04 Paul A. Jensen Operations.
توكيد الذات.
Brackets, Factors and Equations
Machine Requirements 8/24/04 Paul A. Jensen
Equation Review Given in class 10/4/13.
Section 7.3 Solving Absolute Value Equations
Section 1.5 Circles Copyright © 2013 Pearson Education, Inc. All rights reserved.
مديريت موثر جلسات Running a Meeting that Works
Fragments Fragments are incomplete sentences.
Solving Systems of Equation by Substitution
Lesson Objective: I will be able to …
The Rights the Data Acts give a data subject
7.3 Notes.
See requirements for practice program on next slide.
copyright ALL RIGHTS RESERVED. 4/12/2019 copyright ALL RIGHTS RESERVED.
The University of Adelaide, School of Computer Science
copyright ALL RIGHTS RESERVED.
“Day D” November 19, :57 - 8:45 English 8:47 - 9:35 Science
Absolute Value in Open Sentences
Piecewise-defined Functions
Equation Review.
The University of Adelaide, School of Computer Science
The University of Adelaide, School of Computer Science
When we want to find the sum of a certain number of terms (n) we use summation notation. It is written like this. The last value you will plug in to find.
Presentation transcript:

Carnegie Mellon School of Computer Science Copyright © 2007, Carnegie Mellon. All Rights Reserved. 1 LTI Grammars and Lexicons Grammar Writing Grammars and Lexicons November 12, 2007 Teruko Mitamura

Carnegie Mellon School of Computer Science Copyright © 2007, Carnegie Mellon. All Rights Reserved. 2 LTI Grammars and Lexicons Schedule of Grammar Writing Nov 7 Wednesday How to run the parser –Grammar guide –Simple-dog.gra –Create Result file How to debug a grammar –Dog.gra (This grammar has problems.) –Debugger –Result file –Dog-correct.gra (Fix the problems and create a new grammar.) –Create Result file Grammar writing project

Carnegie Mellon School of Computer Science Copyright © 2007, Carnegie Mellon. All Rights Reserved. 3 LTI Grammars and Lexicons November 12, 2007 Q/A for the 1 st assignment: step 1-2 and test suite for one type Finish the dog grammar exercise –Grammar file: dog.gra –Test file: dog-test.lisp –File location: /afs/cs/project/cmt-55/lti/Lab/Modules/GNL-721/2007/ Start a new grammar exercise –Grammar file: bird.gra –Test file: bird-test.lisp

Carnegie Mellon School of Computer Science Copyright © 2007, Carnegie Mellon. All Rights Reserved. 4 LTI Grammars and Lexicons Grammar Exercise Goal: To learn basic equations General problems we often have: –Incomplete F-structure –Incorrect F-structure F-structure should contain all the necessary grammatical information Be able to reconstruct the original sentence