4 Pages

10_grammar_mistakes

Course: C 340, Fall 2009
School: CSU Fullerton
Rating:
 
 
 
 
 

Word Count: 1123

Document Preview

flagrant 10 grammar mistakes that make you look stupid Version 1.0 May 23, 2006 By Jody Gilbert These days, we tend to communicate via the keyboard as much as we do verbally. Often, we're in a hurry, quickly dashing off e-mails with typos, grammatical shortcuts (I'm being kind here), and that breezy, e.e. cummings, no-caps look. It's expected. It's no big deal. But other times, we try to invest a little care,...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> CSU Fullerton >> C 340

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
flagrant 10 grammar mistakes that make you look stupid Version 1.0 May 23, 2006 By Jody Gilbert These days, we tend to communicate via the keyboard as much as we do verbally. Often, we're in a hurry, quickly dashing off e-mails with typos, grammatical shortcuts (I'm being kind here), and that breezy, e.e. cummings, no-caps look. It's expected. It's no big deal. But other times, we try to invest a little care, avoiding mistakes so that there's no confusion about what we're saying and so that we look professional and reasonably bright. In general, we can slip up in a verbal conversation and get away with it. A colleague may be thinking, Did she just say "irregardless"?, but the words flow on, and our worst transgressions are carried away and with luck, forgotten. That's not the case with written communications. When we commit a grammatical crime in e-mails, discussion posts, reports, memos, and other professional documents, there's no going back. We've just officially gone on record as being careless or clueless. And here's the worst thing. It's not necessary to be an editor or a language whiz or a spelling bee triathlete to spot such mistakes. They have a way of doing a little wiggle dance on the screen and then reaching out to grab the reader by the throat. So here we are in the era of Word's red-underline "wrong spelling, dumb ass" feature and Outlook's Always Check Spelling Before Sending option, and still the mistakes proliferate. Catching typos is easy (although not everyone does it). It's the other stuff--correctly spelled but incorrectly wielded--that sneaks through and makes us look stupid. Here's a quick review of some of the big ones. 1 Loose for lose No: I always loose the product key. Yes: I always lose the product key. 2 It's for its (or god forbid, its') No: Download the HTA, along with it's readme file. Yes: Download the HTA, along with its readme file. No: The laptop is overheating and its making that funny noise again. Yes: The laptop is overheating and it's making that funny noise again. 3 They're for their for there No: The managers are in they're weekly planning meeting. Yes: The managers are in their weekly planning meeting. No: The techs have to check there cell phones at the door, and their not happy about it. Yes: The techs have to check their cell phones at the door, and they're not happy about it. 4 i.e. for e.g. No: Use an anti-spyware program (i.e., Ad-Aware). Yes: Use an anti-spyware program (e.g., Ad-Aware). Note: The term i.e. means "that is"; e.g. means "for example." And a comma follows both of them. Page 1 Copyright 2006 CNET Networks, Inc. All rights reserved. For more downloads and a free TechRepublic membership, please visit http://techrepublic.com.com/2001-6240-0.html 10 flagrant grammar mistakes that make you look stupid 5 Effect for affect No: The outage shouldn't effect any users during work hours. Yes: The outage shouldn't affect any users during work hours. Yes: The outage shouldn't have any effect on users. Yes: We will effect several changes during the downtime. Note: Impact is not a verb. Purists, at least, beg you to use affect instead: No: The outage shouldn't impact any users during work hours. Yes: The outage shouldn't affect any users during work hours. Yes: The outage should have no impact on users during work hours. 6 You're your No: for Remember to defrag you're machine on a regular basis. Yes: Remember to defrag your machine on a regular basis. No: Your right about the changes. Yes: You're right about the changes. 7 Different than for different from No: This setup is different than the one at the main office. Yes: This setup is different from the one at the main office. Yes: This setup is better than the one at the main office. 8 Lay for lie No: I got dizzy and had to lay down. Yes: I got dizzy and had to lie down. Yes: Just lay those books over there. 9 Then for than No: The accounting department had more problems then we did. Yes: The accounting department had more problems than we did. Note: Here's a sub-peeve. When a sentence construction begins with If, you don't need a then. Then is implicit, so it's superfluous and wordy: No: If you can't get Windows to boot, then you'll need to call Ted. Yes: If you can't get Windows to boot, you'll need to call Ted. Page 2 Copyright 2006 CNET Networks, Inc. All rights reserved. For more downloads and a free TechRepublic membership, please visit http://techrepublic.com.com/2001-6240-0.html 10 flagrant grammar mistakes that make you look stupid 10 Could of, would of for could have, would have No: I could of installed that app by mistake. Yes: I could have installed that app by mistake. No: I would of sent you a meeting notice, but you were out of town. Yes: I would have sent you a meeting notice, but you were out of town. Bonus peeve I'll just throw one more thing out here: My current burning pet peeve. At some point, who knows when, it became common practice to say that something is "hit and miss." Nuh-UH. It can't be both, right? It either hits or it misses... "Hit OR miss." Granted, it's a small thing, a Boolean-obsessive sort of thing. But it's nonetheless vexing because it's so illogical. Okay, that's mine. If you've got a peeve of your own, share it in the discussion (or post a comment and tell me to get over it). Page 3 Copyright 2006...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Iowa State - COP - 4020
I. Relational Programming (Ch 9) A. Motivation- MOTIVATIONS FOR RELATIONAL PROGRAMMING - 1. programming is difficult, expensive Why is programming so hard? What approaches might solve this problem? What are the steps in building a computer system
Western Washington - BIOL - 345
Bacteria Are Beautifulby Dianne K. NewmanAbove: The widespread use of antibacterial chemicals in common household products could be doing more harm than good (Annals of Internal Medi-cine, 2004, 140, 321329).Below: In contrast to the bacteriophobia of
Iowa State - COP - 4020
COP 4020 Lecture -*- Outline -*-* Relational Programming (Ch 9) Based on Peter van Roy and Seif Haridi's book, "Concepts, Techniques, and Models of Computer Programming" (MIT Press, 2004), where all references that are not otherwise attributed are fo
Iowa State - COP - 4020
COP 4020 Lecture -*- Outline -*-* Message-Passing Concurrency (Ch 5) Based on Peter van Roy and Seif Haridi's book, "Concepts, Techniques, and Models of Computer Programming" (MIT Press, 2004), where all references that are not otherwise attributed a
Iowa State - COP - 4020
COP 4020 Lecture -*- Outline -*-* Declarative Computation Model (Ch 2) Based on Peter van Roy and Seif Haridi's book, "Concepts, Techniques, and Models of Computer Programming" (MIT Press, 2004), where all references that are not otherwise attributed
Iowa State - COP - 4020
COP 4020 Lecture -*- Outline -*-* The Data-Driven Concurrent Model (Ch 4) Based on Peter van Roy and Seif Haridi's book, "Concepts, Techniques, and Models of Computer Programming" (MIT Press, 2004), where all references that are not otherwise attribu
Iowa State - COP - 4020
COP 4020 Lecture -*- Outline -*-* Introduction to Programming Concepts (Chapter 1) Based on Peter van Roy and Seif Haridi's book, "Concepts, Techniques, and Models of Computer Programming" (MIT Press, 2004), where all references that are not otherwis
Iowa State - CPRE - 310
Transparencies to accompany Rosen, Discrete Mathematics and Its ApplicationsSection 9.4Section 9.4 Connectivity We extent the notion of a path to undirected graphs. An informal definition (see the text for a formal definition): There is a path v0, v1, v
Iowa State - CPRE - 310
Transparencies to accompany Rosen, Discrete Mathematics and Its ApplicationsSection 9.3Section 9.3 Representing Graphs and Graph Isomorphism We wish to be able to determine when two graphs are identical except perhaps for the labeling of the vertices. W
Iowa State - CPRE - 310
Transparencies to accompany Rosen, Discrete Mathematics and Its ApplicationsSection 9.2Section 9.2 Graph Terminology and Special Types of Graphs Undirected Graphs Definition: Two vertices u, v in V are adjacent or neighbors if there is an edge e between
Iowa State - CPRE - 310
Transparencies to accompany Rosen, Discrete Mathematics and Its ApplicationsSection 7.4Section 7.4 Generating Functions Generating functions are useful for manipulating sequences and therefore for solving counting problems. _ Definition: Let S = cfw_a0,
Iowa State - CPRE - 310
Transparencies to accompany Rosen, Discrete Mathematics and Its ApplicationsSection 9.1Section 9.1 Graphs and Graph Models Undirected Graphs A simple graph (V,E) consists of vertices, V, and edges, E, connecting distinct elements of V. - no arrows - no
Iowa State - CPRE - 310
Transparencies to accompany Rosen, Discrete Mathematics and Its ApplicationsSection 7.3Section 7.3 Divide-and-Conquer Algorithms and Recurrence Relations The form: The sequence: cfw_am ,am ,am ,., am ,.0 1 2 kan = an/ m + f (n)_ n = mk for some k. -
Iowa State - CPRE - 310
Transparencies to accompany Rosen, Discrete Mathematics and Its ApplicationsSection 7.2Section 7.2 Solving Linear Recurrence Relations If ag(n) = f (ag(0) ,ag(1) ,., ag(n1) ) find a closed form or an expression for ag(n). Recall: nth degree polynomials
Iowa State - CPRE - 310
Transparencies to accompany Rosen, Discrete Mathematics and Its ApplicationsSection 7.1Section 7.1 Recurrence Relations Definition: Given a sequence cfw_ag(0) ,ag(1) ,ag(2) ,., a recurrence relation (sometimes called a difference equation) is an equatio
Iowa State - CPRE - 310
Transparencies to accompany Rosen, Discrete Mathematics and Its ApplicationsSections 4.1 & 4.2Section 4.1 - Mathematical Induction and Section 4.2 - Strong Induction and Well-Ordering A very special rule of inference! Definition: A set S is well ordered
Iowa State - CPRE - 588
SpecC Modeling GuidelinesAndreas GerstlauerTechnical Report CECS-02-16 (revision of ICS-TR-00-48) April 12, 2002 Center for Embedded Computer Systems University of California, Irvine Irvine, CA 92697-3425, USA (949) 824-8919 gerstl@cecs.uci.edu http:/ww
Dallas - DXA - 081000
Linux Kernel Internals The File Subsystem- Gerlof Langeveld gerlof@ATComputing.nlNijmegen, The NetherlandsVersion: april 20032Linux Kernel Internals - The File SubsystemPrefaceThis document describes how the Linux-kernel keeps track of the administ
Iowa State - CPRE - 588
k & u twsxpv(h pyVhb"rx mpv1hphwehut)dqseqVVr%purh )th sqrvVi s thhq VDVhrequtpxi @h)v x vx)ssqhsx 1fi x& s x y q s i q rQwsvVhVrhrpfphs pVhb pppr ehieqbhVDv bdvxk)ssqhs1fq utx(ybm1hwut Vh%p 1h)1xVgwvs u 1fx Vxrxx iVhkrq equsi tpxx b Vx1if vVus VruvGVsx
Caltech - CH - 111
Supplemental Material can be found at: http:/www.jbc.org/cgi/content/full/M806668200/DC1 THE JOURNAL OF BIOLOGICAL CHEMISTRY VOL. 283, NO. 49, pp. 34129 34140, December 5, 2008 Printed in the U.S.A.Flexibility of Eukaryotic Okazaki Fragment Maturation th
Stanford - ILPUBS - 621
Adaptive Ordering of Pipelined Stream FiltersShivnath Babu Stanford University Rajeev Motwani Stanford University Kamesh Munagala Stanford UniversityItaru Nishizawa Jennifer Widom Hitachi, Ltd. Stanford University cfw_shivnath,rajeev,kamesh,widom@cs.sta
Lewis-Clark - HW - 106
Homework Assignment 3Perform the following conversions (HINT: use the iside cover of the back of your textbook for the relationships . . .): a.) 45.0 kcal to kJ b.) 1.00 g/cm3 to kg/dm3 c.) 9.81 m/s2 to miles/hr2 d.) 2.9979 x 108 m/s to miles/hr e.) 179
Cornell - WEB - 191
Math 191FINAL EXAMFall 2000SHOW ALL WORK. CIRCLE YOUR ANSWERS. CLOSED BOOK. NO CALCULATORS. 1. (25 pts) Let f (x) = xx = ex ln x , x > 0 (a) Compute lim f (x) if it exists. +x0(b) Locate and identify the critical points of f (x) in x > 0. (c) Find th
Cornell - WEB - 191
Math 191FINAL EXAM SOLUTIONSFall 20001. (a) Using l'Hopital's rule, the limit is 1. (b) The only critical point is x = e-1 . (f (x) = (1 + ln x)ex ln x ) (c) The absolute minimum occurs when x = e-1 where the value is e-1/e . There is no absolute maxim
Purdue - LISTS - 20030304
A10K 1 KFITC10K 1KB10K 1KPE10K 1KPE100A-633100PE100A-6331001 01010101 1 1011 1 10 1001 1 10FITC1001K10K10K10KPE1K10KFITC1001K10K11 010K10KPE1001K10K1 K1K1K1KA-633100A-680100A-633100A-6801001 01010
Oakland University - ME - 463
Table Top
Oakland University - ME - 463
Table Middle Level
Oakland University - ME - 463
Table (Bottom Level)
Oakland University - ME - 463
Table Top Legs
Oakland University - ME - 463
Steel Plate
Oakland University - ME - 463
Spring Cover
Oakland University - ME - 463
Spring Top Washer
Oakland University - ME - 463
Split Lock Washer
Oakland University - ME - 463
Pipe Clamp
Oakland University - ME - 463
Bike Pedal Surface
Oakland University - ME - 463
Bike Pedal Crank
Oakland University - ME - 463
Hex Washer Head Screw
Oakland University - ME - 463
Hex Nut
Oakland University - ME - 463
Hex Lock Nut
Oakland University - ME - 463
- 20 x 2 Hex Cap Screw
Oakland University - ME - 463
- 20 x 1 Hex Cap Screw
Oakland University - ME - 463
- 20 x 1 Hex Cap Screw
Oakland University - ME - 463
- 20 x 3/4 Hex Cap Screw
Oakland University - ME - 463
- 20 x Hex Cap Screw
Oakland University - ME - 463
Glass Clamp
Oakland University - ME - 463
Glass Clamp Rod
Oakland University - ME - 463
Floor Mount
Oakland University - ME - 463
Flat Washer
Oakland University - ME - 463
Fender Washer
Oakland University - ME - 463
Condensing Coil
Oakland University - ME - 463
Brake Pad Clamp
Oakland University - ME - 463
Boiling Flask
Oakland University - ME - 463
Brake Pad
Oakland University - ME - 463
Bike Seat Pipe
Oakland University - ME - 463
Bike Gear
Oakland University - ME - 463
Angle Iron with Holes
Oakland University - ME - 463
Angle Brace
Oakland University - ME - 463
Angle BraceAngle Iron with HolesAxleBike FrameBike GearBike Seat PipeBoiling FlaskBracketBrake PadBrake Pad ClampCapChainCollecting FlaskCondensing CoilConnectorFender WasherFlat WasherFloor MountGaroliteGlass ClampGlass Clamp RodHex
Oakland University - ME - 463
<?xml version="1.0" encoding="UTF-8"?> <Error><Code>NoSuchKey</Code><Message>The specified key does not exist.</Message><Key>1b409cd3253c88cbaf4432f4efe20eedd9424d37.ppt</Key><RequestId>B 4E2BE5F296FA358</RequestId><HostId>yde53XSmIihPPulKuFo/xFPFl78sMCT6
UNC - READ - 5361767
TECHNICAL MEMORANDUM No. TM-80-02SELECTION OF THE INDEPENDENT AUDITORTWO PART REQUEST FOR PROPOSAL FOR AUDITING SERVICES BY -COUNTIES-MUNICIPALITIESPUBLIC AUTHORITIES-SCHOOL ADMINISTRATIVE UNITSOF NORTH CAROLINAState and Local Government Finance Divisi