2002 October 10SFWR ENG 4G030 Translating from English into Mathematics SFWR ENG 4G03 2002 Robert L. Baber.

Slides:



Advertisements
Similar presentations
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Advertisements

Semantics Static semantics Dynamic semantics attribute grammars
Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
Describing Process Specifications and Structured Decisions Systems Analysis and Design, 7e Kendall & Kendall 9 © 2008 Pearson Prentice Hall.
Chapter 12 – Strategies for Effective Written Reports
User Mediation & the Reference Interview IS 530 Fall 2009 Dr. D. Bilal.
ISBN Chapter 3 Describing Syntax and Semantics.
1 Semantic Description of Programming languages. 2 Static versus Dynamic Semantics n Static Semantics represents legal forms of programs that cannot be.
CS 355 – Programming Languages
English 12. Taking Notes and Annotating Record enough information to help you recall the major points of the source Put the information in the form in.
Software Engineering CSE470: Requirements Analysis 1 Requirements Analysis Defining the WHAT.
Describing Syntax and Semantics
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Fundamentals (Chapter 4) Denotational Semantics ICS.
© 2005 by Prentice Hall Chapter 9 Structuring System Requirements: Logic Modeling Modern Systems Analysis and Design Fourth Edition.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Conceptual modelling. Overview - what is the aim of the article? ”We build conceptual models in our heads to solve problems in our everyday life”… ”By.
1/25 Pointer Logic Changki PSWLAB Pointer Logic Daniel Kroening and Ofer Strichman Decision Procedure.
Midterm 1 Concepts Relational Algebra (DB4) SQL Querying and updating (DB5) Constraints and Triggers (DB11) Unified Modeling Language (DB9) Relational.
CSC 8310 Programming Languages Meeting 2 September 2/3, 2014.
M.Hosseinzadeh EDC Translation Art or Skill Session.
Chapter 9 Structuring System Requirements: Logic Modeling
Formal Methods 1. Software Engineering and Formal Methods  Every software engineering methodology is based on a recommended development process  proceeding.
Demystifying the Michigan Merit Exam October 9, 2006.
NYC Schools Task Alignment Project The Common Core State Standards Aligning and Rating Math Tasks April 28, 2011.
Software Engineering – University of Tampere, CS DepartmentJyrki Nummenmaa USE CASES In this lecture: Use cases - What are use.
Term 2, 2011 Week 1. CONTENTS Types and purposes of graphic representations Spreadsheet software – Producing graphs from numerical data Mathematical functions.
Simple Program Design Third Edition A Step-by-Step Approach
Number Sense Standards Measurement and Geometry Statistics, Data Analysis and Probability CST Math 6 Released Questions Algebra and Functions 0 Questions.
Artificial intelligence project
Describing Process Specifications and Structured Decisions Systems Analysis and Design, 7e Kendall & Kendall 9 © 2008 Pearson Prentice Hall.
Selection Control Structures Simple Program Design Third Edition A Step-by-Step Approach 4.
Logics for Data and Knowledge Representation Exercises: Modeling Fausto Giunchiglia, Rui Zhang and Vincenzo Maltese.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
Tips for Writing Tech. Doc.. 1.Top-down structure of document is important Be careful to organize sections, subsections, paragraphs, sub-bullets logically.
Approaching a Problem Where do we start? How do we proceed?
© 2011 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Stewart Venit ~ Elizabeth Drake Developing a Program.
ISBN Chapter 3 Describing Semantics -Attribute Grammars -Dynamic Semantics.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Introduction to Problem Solving. Steps in Programming A Very Simplified Picture –Problem Definition & Analysis – High Level Strategy for a solution –Arriving.
These courseware materials are to be used in conjunction with Software Engineering: A Practitioner’s Approach, 6/e and are provided with permission by.
Part4 Methodology of Database Design Chapter 07- Overview of Conceptual Database Design Lu Wei College of Software and Microelectronics Northwestern Polytechnical.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
1 / 48 Formal a Language Theory and Describing Semantics Principles of Programming Languages 4.
AP Physics 1: Unit 0 Topic: Language of Physics Learning Goals: Compare and contrast object and system Define the make up of an object of a system of objects.
Understanding Smarter Balanced Assessment Results.
Alaska Measures of Progress (AMP) Summative Assessment Framework 1.
© 2005 by Prentice Hall Chapter 9 Structuring System Requirements: Logic Modeling Modern Systems Analysis and Design Fourth Edition Jeffrey A. Hoffer Joey.
CES 592 Theory of Software Systems B. Ravikumar (Ravi) Office: 124 Darwin Hall.
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
WRITING A SUMMARY. A summary is a short and concise representation of the main points, ideas, concepts, facts or statements of a text written IN YOUR.
CMPSC 16 Problem Solving with Computers I Spring 2014 Instructor: Tevfik Bultan Lecture 4: Introduction to C: Control Flow.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
CSC3315 (Spring 2009)1 CSC 3315 Languages & Compilers Hamid Harroud School of Science and Engineering, Akhawayn University
C HAPTER 3 Describing Syntax and Semantics. D YNAMIC S EMANTICS Describing syntax is relatively simple There is no single widely acceptable notation or.
User Mediation IS 530 Fall 2007 Dr. D. Bilal. Mediation Aims at identifying and satisfying user information need A series of decision-making steps from.
Dillon: CSE470: ANALYSIS1 Requirements l Specify functionality »model objects and resources »model behavior l Specify data interfaces »type, quantity,
Objective Examination: Multiple Choice Questions Dr. Madhulika Mistry.
Writing Requirements Lecture # 23.
Chapter 9 Structuring System Requirements: Logic Modeling
Chapter 9 Structuring System Requirements: Logic Modeling
Chapter 9 Structuring System Requirements: Logic Modeling
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Chapter 9 Structuring System Requirements: Logic Modeling
Chapter 9 Structuring System Requirements: Logic Modeling
Basic Concepts of Algorithm
TECHNICAL REPORTS WRITING
Presentation transcript:

2002 October 10SFWR ENG 4G030 Translating from English into Mathematics SFWR ENG 4G Robert L. Baber

2002 October 10SFWR ENG 4G031 English and Mathematics as Languages English is a language. So is Mathematics. Both have l rules of grammar (syntax) l semantics When writing in any language, pay attention to grammar and semantics. Get both right.

2002 October 10SFWR ENG 4G032 English and Mathematics: A Difference In English and other natural languages l ambiguity desired, intentionally possible l unambiguous statements almost impossible In Mathematics l ambiguity not desired, intentionally prevented l ambiguous statements almost impossible (even in probability theory, fuzzy logic)

2002 October 10SFWR ENG 4G033 Mathematics and Engineering Therefore, mathematics is the language of engineering.

2002 October 10SFWR ENG 4G034 Different World Views English and other natural languages l express both static and dynamic views l states and actions (verbs of being and action) Programming languages l primarily dynamic world view (changes) Mathematics l static world view only Fundamental conceptual differences

2002 October 10SFWR ENG 4G035 Static vs. Dynamic Views These very different world views pose a conceptual hurdle for the translator. The translator must bridge the gap between l dynamic and static view of problem statement, l dynamic world view of programming and l purely static world view of mathematics. Not hard, but requires conscious attention.

2002 October 10SFWR ENG 4G036 Translating between Languages Translating a statement from one language to another is a multistep (not single) process. 1. statement in source language to a mental understanding of the meaning of the statement 2. reformulate mental understanding into target language view, concepts, culture 3. mental understanding of the meaning of the statement to a statement in the target language The first and last statements must mean the same.

2002 October 10SFWR ENG 4G037 Translators Knowing two languages: not enough to translate A good translator knows well l the two languages l AND the subject being translated l AND how to translate These three things are different.

2002 October 10SFWR ENG 4G038 Organization and Style When writing in English or any other natural language, one pays careful attention to l organization of the essay, report, etc. l style of expression When writing in Mathematics, to do the same: l clear, complete, concise — KISSS l understandable l interesting

2002 October 10SFWR ENG 4G039 Strategies l Understand the meaning of the original l Obtain all needed information l Close the gap between the English text and mathematics l Divide and conquer (complexity)

2002 October 10SFWR ENG 4G0310 Strategy: Understand the original l describe specific instance of general problem l distinguish essentials from background l draw a diagram l express in intermediate or mixed language l identify objects referred to l identify implicit (but false) "information" l identify missing information l identify relationships between essential objects l identify special cases

2002 October 10SFWR ENG 4G0311 Strategy: Obtain all needed information l ask the author of the task description l identify gaps in the description of the task l identify implicit "information" l ask if implicit "information" may be assumed l identify data present and ask about related details l ask if missing information is really needed l read carefully, thoroughly, precisely

2002 October 10SFWR ENG 4G0312 Strategy: Close gap English – math l express implicit information explicitly l reduce vagueness and ambiguity l reword English text to be closer to mathematics (express in intermediate, mixed language)

2002 October 10SFWR ENG 4G0313 Strategy: Divide and conquer l construct a table l distinguish between specific cases l introduce an auxiliary mathematical function l modularize

2002 October 10SFWR ENG 4G0314 A Small Translator’s Glossary English: Mathematics l and, but:  (and) l or:  (or) l for all, each, every, any: ,  (and) series, universal quantification l for no, none: ,  (and) series, universal quantification with a negated assertion l there is (are), there exist(s), for some, at least one: ,  (or) series, existential quantification

2002 October 10SFWR ENG 4G0315 A Small Translator’s Glossary English: Mathematics l integer:...  Z l sorted:  i=1 n-1 A(i)  A(i+1), (A i : i  Z  1  i  n-1 : A(i)  A(i+1)) l if (when, whenever) … then … : …  … l search, find, equal, present: = l exchange, rearrange, different order, different sequence, merge, copy, sort: permutation

2002 October 10SFWR ENG 4G0316 Your Translator’s Glossary A professional translator compiles his/her own translation glossary l over time l based on own accumulated experience You should, too.

2002 October 10SFWR ENG 4G0317 Exercise Consider an array D with index values ranging from 1 to n. The subject of this example is part of a specification for a subprogram that will count how many times a particular given value occurs in the array D. The goal of this exercise is to write a postcondition for the subprogram, relating the various relevant variables’ values when the search is complete.

2002 October 10SFWR ENG 4G0318 Exercise Understand the task in the original language l identify objects referred to (look for nouns in the original English text): array D, index value, times (count), particular given value, relevant variables' values l identify missing information: names of variables for: index, times (count), particular given value. Are there any other relevant variables?

2002 October 10SFWR ENG 4G0319 Exercise Identify missing information: names of variables for l index: assume "i" l times (count): Ask the author of the task. assume "count" l particular given value: Ask the author of the task. assume "key" l Are there any other relevant variables? (no?)

2002 October 10SFWR ENG 4G0320 Exercise Close the gap between the English text and mathematics l reword the English text to be closer to mathematics: the English verb count

2002 October 10SFWR ENG 4G0321 Exercise The English verb count means, in programming language and in terms closer to mathematics, add 1. But this is a dynamic (action) concept. The corresponding static (state, relational) concept in mathematics is the function addition with 1, i.e. +1.

2002 October 10SFWR ENG 4G0322 Exercise The occurrence of the particular given value in an array element in D, i.e. D(i)=key is a condition for the addition with 1. The repetition over a variable number of index values suggests quantification with the function addition and with the argument 1, i.e. (+ i : …  D(i)=key : 1)

2002 October 10SFWR ENG 4G0323 Exercise Identify relationships between essential objects: l array D, index value, particular given value: D(i)=key l above and count (+ conditionally with 1): count = (+ i : i  Z  …  i  …  D(i)=key : 1) l range of i missing. Refer to original English text: 1 to n. Then, count = (+ i : i  Z  1  i  n  D(i)=key : 1)

2002 October 10SFWR ENG 4G0324 Exercise: New glossary entry Now we have a new entry for our glossary: l count: (+ i : i  Z  …  i  …  … : 1), where the … define the range of the quantified variable and the condition for counting

2002 October 10SFWR ENG 4G0325 Summary l Knowledge of English and Mathematics necessary but not sufficient to translate into Mathematics l knowledge of subject area also needed l translating skills needed The three are different.

2002 October 10SFWR ENG 4G0326 Summary l Compile your own glossary l Make intermediate steps, expressions, languages conscious l Modularize l Organize systematically l KISSS

2002 October 10SFWR ENG 4G0327 Reference Baber, Robert L., Translating English to Mathematics, 2002, neral/EnglToMath.pdf neral/EnglToMath.pdf