CMSC 723 / LING 645: Intro to Computational Linguistics September 29, 2004: Dorr Toward a Kimmo FAQ Prof. Bonnie J. Dorr Dr. Christof Monz TA: Adam Lee.

Slides:



Advertisements
Similar presentations
Narrative Articles Things we’re going to learn about:
Advertisements

Recognising Languages We will tackle the problem of defining languages by considering how we could recognise them. Problem: Is there a method of recognising.
Accessing electronic journals from off- campus This causes lots of headaches, but dont despair, heres how to do it! (Please note – this presentation is.
Introducing DFA Formal Description Using Peer Instruction Cynthia Bailey Lee UCSD 2011 Theory of Computation Peer Instruction Lecture Slides by Dr. Cynthia.
LING 388: Language and Computers Sandiway Fong Lecture 5: 9/8.
Both finite sets, A and B, are relations. A= { (0,2), (1,3), (2,4) }
Chapter Section Section Summary Set of Strings Finite-State Automata Language Recognition by Finite-State Machines Designing Finite-State.
1 Introduction to Computability Theory Lecture15: Reductions Prof. Amos Israeli.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
1 Introduction to Computability Theory Lecture2: Non Deterministic Finite Automata Prof. Amos Israeli.
The standard error of the sample mean and confidence intervals
CMSC 723 / LING 645: Intro to Computational Linguistics September 22, 2004: Dorr Supplement: PC-Kimmo Tutorial Prof. Bonnie J. Dorr Dr. Christof Monz TA:
Smoothing Bonnie Dorr Christof Monz CMSC 723: Introduction to Computational Linguistics Lecture 5 October 6, 2004.
CMSC 723 / LING 645: Intro to Computational Linguistics September 8, 2004: Monz Regular Expressions and Finite State Automata (J&M 2) Prof. Bonnie J. Dorr.
1 Binary Arithmetic, Subtraction The rules for binary arithmetic are: = 0, carry = = 1, carry = = 1, carry = = 0, carry =
CSC 160 Computer Programming for Non-Majors Lecture #7: Variables Revisited Prof. Adam M. Wittenstein
Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.
Systems Analysis I Data Flow Diagrams
Simultaneous Equations The Elimination method. If a pair of simultaneous equations contain an x - term which are exactly the same, we can solve them by.
Clauses, sentence fragments and comma splices
SENTENCE COMPLETION SENTENCE COMPLETION Part 4 Notes SAT Preparation Mrs. Erdman Part 4 Notes SAT Preparation Mrs. Erdman.
Control Loop Interaction
Lecture 1, 7/21/2005Natural Language Processing1 CS60057 Speech &Natural Language Processing Autumn 2007 Lecture4 1 August 2007.
ME451 Kinematics and Dynamics of Machine Systems Singular Configurations of Mechanisms 3.7 October 26, 2010 © Dan Negrut, 2010 ME451, UW-Madison TexPoint.
1 Functions 1 Parameter, 1 Return-Value 1. The problem 2. Recall the layout 3. Create the definition 4. "Flow" of data 5. Testing 6. Projects 1 and 2.
CSE202: Introduction to Formal Languages and Automata Theory Chapter 9 The Turing Machine These class notes are based on material from our textbook, An.
Canadian English LING 202, Fall 2007 Dr. Tony Pi Research Ethics.
How to Run a Java Program CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
How to Run a Java Program CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
19/10/20151 Data Structures Arrays. 219/10/2015 Learning Objectives Explain initialising arrays and reading data into arrays. Design and write routine/s.
How To Install A New Hard Drive To Replace An Old One Sample Instructional Guide Odetta Rodriguez – Week 5.
The LC-3 – Chapter 7 COMP 2620 Dr. James Money COMP
Controlled Assessment A(iii) Recommended solution Recommended solution Reasons for this recommendation Refer to the information requirements and your research.
Kevin Murphy Basics of XML Masters Project CS 490.
Getting Started with MATLAB (part2) 1. Basic Data manipulation 2. Basic Data Understanding 1. The Binary System 2. The ASCII Table 3. Creating Good Variables.
Copyright © Curt Hill Finite State Machines The Simplest and Least Capable Automaton.
Copyright © Curt Hill Finite State Automata Again This Time No Output.
Definition of a Set DM is study of discrete structures. Fundamental discrete structure upon which most of other discrete structures are built is the sets.
Two-Way (Independent) ANOVA. PSYC 6130A, PROF. J. ELDER 2 Two-Way ANOVA “Two-Way” means groups are defined by 2 independent variables. These IVs are typically.
Validation final steps Stopping gaps being entered in an input.
By Joseph Cheatle.  Keep one idea to a paragraph  Unity  Single focus  Coherence  Makes the paragraph easily understandable to a reader  Logical.
Critical Essay Writing
Communication Arts The Writing Process. Communication Arts Five Stages of the Writing Process Prewriting Drafting Revising Editing Publishing.
Lecture 04: Theory of Automata:08 Transition Graphs.
Helpful Hints for Paper Writing Let’s get it right the first time…
Creating Paragraphs (and knowing when to separate them!!!)
Synchronous Counter Design
Chapter 13 Triggers. Trigger Overview A trigger is a program unit that is executed (fired) due to an event Event such as updating tables, deleting data.
C language + The Preprocessor. + Introduction The preprocessor is a program that processes that source code before it passes through the compiler. It.
-Joseph Beberman *Some slides are inspired by a PowerPoint presentation used by professor Seikyung Jung, which was derived from Charlie Wiseman.
The accuracy of averages We learned how to make inference from the sample to the population: Counting the percentages. Here we begin to learn how to make.
Arrangements for teacher assessments and SATs at Gamlingay First School in 2016.
Let try to identify the conectivity of these entity relationship
BİL711 Natural Language Processing
CS170 – Week 1 Lecture 3: Foundation Ismail abumuhfouz.
Understanding our EA1 Web
AIM: To understand how this structure helps us write about English
AIM: To understand how this structure helps us write about English
Deterministic Finite Automata
What Are They? Who Needs ‘em? An Example: Scoring in Tennis
IPC144 Introduction to Programming Using C Week 1 – Lesson 2
Deterministic Finite Automata
What Are They? Who Needs ‘em? An Example: Scoring in Tennis
How to Run a Java Program
Welcome to Year 5 and 6 transition meeting.
CPD ITK and Single Sign On (SSO)
Compiler Construction
Put the dots on the shift keys.
Turning in My Assignment
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Presentation transcript:

CMSC 723 / LING 645: Intro to Computational Linguistics September 29, 2004: Dorr Toward a Kimmo FAQ Prof. Bonnie J. Dorr Dr. Christof Monz TA: Adam Lee

FAQ for Kimmo 1) What order does PCKimmo go through the FSAs? Is it in the order listed in the.aut file? NO. They are simultaneously traversed (as described in class last week); I'll emphasize this again this week. 2) In the.aut file, there is an underscore in all of the FSAs. What does this mean? You should only use the characters that I have specified for German in the lab description. The underscore in English was only because that automaton was used in a working system, after tokenization had taken place. So it was there to deal with tokens like "because_of" or "so_that". But you don't need to do anything like this, so ignore it for your lab. 3) Can you have two letters after the colon (replacement operator)? NO. As described last week in class, only single characters are allowed.

FAQ for Kimmo (continued) 4) In an FSA, where specificity matters, it is only the feasible pair that matters, not the individual letter, correct? (for example if I have a pair of e:i, I do not need to mention e or i specifically if I do not want this feasible pair to happen again). If you have the feasible pair e:i in one automaton, you do not need to mention that pair explicitly again in some other automaton. However, unfortunately, once you have the feasible pair e:i, it will affect what you put in other automata. In particular, all your other automata need to have a transition to cover that case, even if it is simply the transition =:=, that is you need to make sure you don't fail in some *other* automaton while you are convering an "e" to an "i" in the e- to-i automaton.

FAQ for Kimmo (continued) 5) Nouns in German are capitalized, and this is how they are listed, but the root forms are not capitalized? I assumed we should make the root forms capitals. Is this correct? No, the root forms need not be capital letters. We stated this assumption explicitly in the lab: "For the purpose of this project, use lower case characters only, even for German nouns (which are usually otherwise capitalized)." 6) In PC Kimmo, how do we say which states are end states for the FSAs? I COMPLETELY FORGOT TO MENTION THIS LAST WEEK! However, it is very clearly stated in the PC Kimmo manual. Use colon (:) to indicate final state and dot (.) to indicate non-final state. (Although I didn't mention this, it is evident in the matrix form of the automaton I showed last week.)