以下转自www.eslpod.com,翻译为本人添加。其余版权均归原网站所有。

ESLPOD是一个英语学习网站,我最初知道这个网站,是因为“奶爸”《把你的英语用起来》一书的推荐。

ESLPOD的六本书国内尚未出版。

下面这篇文章是从官网转载的。http://www.eslpod.com/eslpod_blog/

Learn From George, Not Pinocchio

Did you break this lamp? No.

是你打破这盏台灯的吗?不是的。

Who ate these cookies? Not me.

谁吃了这些小甜饼?不是我。

Where is your homework? My dog ate it.

你的作业在哪儿?我的小狗把它吃了。

We all want our children to be truthful (honest; not telling lies). Let George Washington, not Pinocchio, be your teaching tool.

我们都希望孩子诚实。那么就让乔治华盛顿而不是匹诺曹成为你的教育帮手。

You have probably heard the story of George Washington and the cherry tree (see English Cafe 275). When George was a boy, he used his hatchet(sharp tool with a handle) to cut down his father’s favorite cherry tree. When his father asked him if he had done it, he said, “I cannot tell a lie. I did it with my little hatchet.” Most historians don’t believe this actually happened, but it is a story many American children are told to show the virtues (benefits of having a high moral standard) of honesty (telling the truth).

你一定听说过乔治华盛顿和樱桃树的故事(可以参考“英语咖啡第275期”)当乔治还是一个孩子时,他用他的小斧头砍倒了他父亲最心爱的樱桃树。当他父亲询问是否是他干的时,乔治说,“我不能撒谎,是我用我的小斧头砍的”。很多历史学家都不认为这个故事曾经发生过,但是很多美国孩子都听过这个告知他们“诚实是美德”的故事。

The story of Pinocchio is probably even more well known. Pinocchio is a character from an Italian children’s novel (book), and the story is known in many countries. Pinocchio is a puppet (toy moved by strings) made by a man named Geppetto. Each time Pinocchio tells a lie, his nose gets longer. This story is often told to children to show the negative consequences (results) of telling lies.

匹诺曹的故事可能更加为人们熟知,匹诺曹是一个意大利儿童小说的人物,故事在很多国家流传。匹诺曹是一个叫做 Geppetto的木匠做的木偶,每次匹诺曹说谎,他的鼻子就会变长。这个故事用来告诉孩子们说谎的负面结果。

In a recent study, researchers who have spent years studying children and honesty set up a situation where it would be easy for children to lie: namely (specifically), a chance for children to peek (look when they are not supposed to) to get the right answer to a question when the researcher leaves the room. Before asking the children, ages 3 to 7, if they had peeked, the researchers told them a story. The children heard one of three stories: the story about George Washington, the one about Pinocchio, or an unrelated story. After hearing the story, the children were asked if they had peeked.

在一项近期的研究中,调查者设立了一个孩子们很容易说谎的场景,这些调查者都开展过多年有关孩子诚实问题的调查。具体点说呢,这个场景就是调查者提供一个环境,在这里孩子们可以在调查者离开时通过偷看来获得一个问题的正确答案。在问这些年龄从3岁到7岁的孩子他们是否偷看之前,调查者会给孩子们讲一个故事。孩子们会听到以下三个故事中的一个:乔治华盛顿的故事,匹诺曹的故事,或者其他一个与诚实与否不相关的故事。在听完这个故事后,孩子们会被问及他们刚才是否偷看过。

Nearly all of the children peeked, and about 65% of the them lied about it. But those who had heard the George Washington story lied significantly less. The researchers interpreted this to mean (believed it meant) that children responded better to being told the benefits of telling the truth than the negative consequences of lying.

几乎所有的孩子都偷看了,其中大约65%的孩子会说谎,说他们没有偷看。但是那些听了乔治华盛顿故事的孩子很少说谎。调查者将这解释为相比说谎的负面效应,孩子们在听到讲真话的好处后,更乐于做出积极的改变。

Maybe there’s a lesson here for handling our politicians? Maybe Washington, D.C. (our national government) should have enforced (required) story time (when an adult reads aloud to groups of children).

也许这对于我们对付政治家说谎也是一个有益的教训?也许华盛顿州应该多一些讲故事的时间。

Lucy

露西

[翻译角]Learn From George, Not Pinocchio(ESLPOD)的更多相关文章

  1. [翻译角]Headline English: A Captain Should Be Pitch Perfect at a Multitude of Skills (ESLPOD Blog)

    以下转自www.eslpod.com,翻译为本人添加.其余版权均归原网站所有. ESLPOD是一个英语学习网站,我最初知道这个网站,是因为“奶爸”<把你的英语用起来>(电子版3元)一书的推 ...

  2. [翻译]Review——Learn these core JavaScript concepts in just a few minutes

    Learn these core JavaScript concepts in just a few minutes(只需几分钟即可学习这些核心JavaScript概念) 原文地址:https://m ...

  3. 用Python从零开始创建区块链

    本文主要内容翻译自Learn Blockchains by Building One 本文原始链接,转载请注明出处. 作者认为最快的学习区块链的方式是自己创建一个,本文就跟随作者用Python来创建一 ...

  4. 十分钟入门less(翻译自:Learn lESS in 10 Minutes(or less))

    十分钟入门less(翻译自:Learn lESS in 10 Minutes(or less)) 注:本文为翻译文章,因翻译水平有限,难免有缺漏不足之处,可查看原文. 我们知道写css代码是非常枯燥的 ...

  5. [翻译]C# BAD PRACTICES: Learn how to make a good code by bad example---C#:如何将坏的代码重新编译为好的代码

    自己的前言说明: 本文原作者:Radoslaw Sadowski,原文链接为:C# BAD PRACTICES: Learn how to make a good code by bad exampl ...

  6. [翻译]深度学习的机器(The learning machines)

    学习的机器 用大量的数据识别图像和语音,深度学习的计算机(deep-learning computers) 向真正意义上的人工智能迈出了一大步. Nicola Jones Computer Scien ...

  7. face recognition[翻译][深度人脸识别:综述]

    这里翻译下<Deep face recognition: a survey v4>. 1 引言 由于它的非侵入性和自然特征,人脸识别已经成为身份识别中重要的生物认证技术,也已经应用到许多领 ...

  8. AlexNet论文翻译-ImageNet Classification with Deep Convolutional Neural Networks

    ImageNet Classification with Deep Convolutional Neural Networks 深度卷积神经网络的ImageNet分类 Alex Krizhevsky ...

  9. 第七章 : Git 介绍 (下)[Learn Android Studio 汉化教程]

    Learn Android Studio 汉化教程 Let’s reset even further to remove all traces of your work on the deprecat ...

随机推荐

  1. 01Hibernate

    Hibernate Hibernate是一个开放源代码的对象关系映射框架,它对JDBC进行了非常轻量级的对象封装,它将POJO与数据库表建立映射关系,是一个全自动的orm框架,hibernate可以自 ...

  2. CodeForces - 1020C C - Elections(贪心+枚举)

    题目: 党派竞争投票 有n个人,m个党派,这n个人每个人有一个想要投的党派的编号Pi,如果想要这个人改变他的想法,那么就需要花费Ci元钱. 现在你是编号为1的党派,如果你想要赢(你的票数严格大于其他党 ...

  3. ajax 简单学习

    客户端代码function login(type) { $.ajax({ type: "post", url: "logindo.aspx", data: { ...

  4. java设置项目根目录 工作目录 working dictionary

    改变java项目中,绝对路径的根目录 run->run configuration ->Arguments 更改 working dictioinary

  5. JavaEE JDBC 可滚动和可更新的结果集ResultSet

    可滚动和可更新的结果集ResultSet @author ixenos 需求背景 1.对于一个只需要分析数据的程序来说,普通的ResultSet已够用 2.但如果ResultSet用于显示一张表或查询 ...

  6. [HAOI2011]Problem b 题解

    题目大意: 对于给出的n个询问,每次求有多少个数对(x,y),满足a≤x≤b,c≤y≤d,且gcd(x,y)=k. 思路: 设f(k)为当1≤x≤n,1≤y≤m,且n≤m,使gcd(x,y)=k的数对 ...

  7. [luoguP2626] 斐波那契数列(升级版)(模拟)

    传送门 模拟 代码 #include <cmath> #include <cstdio> #include <iostream> #define N 50 #def ...

  8. 启的服务有时候突然报错:org.xml.sax.SAXParseException: schema_reference.4

    记录一下,原文地址:http://blog.csdn.net/bluishglc/article/details/7596118

  9. hdu - 2266 How Many Equations Can You Find (简单dfs)

    http://acm.hdu.edu.cn/showproblem.php?pid=2266 给一个字符串和一个数n,在字符串中间可以插入+或者 -,问有多少种等于n的情况. 要注意任意两个数之间都可 ...

  10. poj——1470 Closest Common Ancestors

    Closest Common Ancestors Time Limit: 2000MS   Memory Limit: 10000K Total Submissions: 20804   Accept ...