Journalists have the ability to state a thing more clearly. What can we learn from them to help us report or explain things like them?

There are six ways as follows:

1. Know your audience and adapt your voice accordingly (认清受众。对应调整声音)

Spend some time carefully defining who you want to read your content and figuring out their interests and behaviors.

2. Understand five determinants of "newsworthiness" (明确“新闻报道价值”的五个决定性因素)

Timing, Significance, Proximity, Prominence, Interest.

Proximity: Is the topic close enough to readers for it to pique their attention?

Prominence: Put simply, why should people care?

3. There are lots of facts, but only one core story (事实有非常多,但核心仅仅有一个)

Remenber that, as a content marketer, the first goal is storytelling.

Draw readers in with text that entertains them, gives them answers and makes them want to learn more, then close everything out with a conclusion that ties it all together and reinforces what you've just said.

4.  Support your claims (支持你的说法)

No journalist would send his or her editor an article full of unsupported statements.

Beyond a credibility boost, supplementing what you say can also help readers make sense of more complex subjects.

5.  Package and Repackage your content (不断包装你的内容)

Quality content has potential beyond a single piece of text.

When you're brainstorming, try thinking about ideas in a broader sense.

6.  If you haven't done the necessary legwork, it's going to show (假设没有搜集工作,别人会知道的)

When someone choose to read your content, they're dedicating part of their day to checking out what you have to say.

Show them you value their time and they'll respond by coming back for more.

这六点事实上告诉了我们在写文章或者在说话时要注意的地方。

首先。我们应该弄清楚我们的对象是谁。你不可能给一个艺术家去谈论你的科技问题吧

其次, 要明确意义,重要性,一些毫无意义的东西给读者看。那不是浪费人家时间

然后。 我们的精力是有限的,要有核心和重点,不能范谈,由于这样会让人看了半天不知所以然

再, 要有支持的观念,还要包装,就是举一反三,帮助更好地理解

最后, 一定要有积累。你都没有预先准备好,那写出来的东西会不会就非常空洞呢!

Six ways to think like a journalist!的更多相关文章

  1. [LeetCode] Different Ways to Add Parentheses 添加括号的不同方式

    Given a string of numbers and operators, return all possible results from computing all the differen ...

  2. [LeetCode] Decode Ways 解码方法

    A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' - ...

  3. Decode Ways

    https://leetcode.com/problems/decode-ways/ A message containing letters from A-Z is being encoded to ...

  4. 【LeetCode】241. Different Ways to Add Parentheses

    Different Ways to Add Parentheses Given a string of numbers and operators, return all possible resul ...

  5. [Leetcode] Decode Ways

    A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' - ...

  6. Three ways to set specific DeviceFamily XAML Views in UWP

    Three ways to set specific DeviceFamily XAML Views in UWP http://igrali.com/2015/08/02/three-ways-to ...

  7. 241. Different Ways to Add Parentheses

    241. Different Ways to Add Parentheses https://leetcode.com/problems/different-ways-to-add-parenthes ...

  8. Different Ways to Add Parentheses

    Given a string of numbers and operators, return all possible results from computing all the differen ...

  9. 【leetcode】Decode Ways(medium)

    A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' - ...

随机推荐

  1. day02 Python 的模块,运算,数据类型以及方法

    初识pyhton的模块: 什么是模块: 我的理解就是实现一个功能的函数,把它封装起来,在你需要使用的时候直接调用即可,我的印象里类似于shell 的单独函数脚本. python 的模块分为标准的和第三 ...

  2. Python 综合应用小项目一

    数据库报错重连机制 利用异常捕获来获取mysql断开的报错,然后再重连 import MySQLdb as mysql class DB: def __init__(self,host,user,pa ...

  3. luogu1578 奶牛浴场 枚举点最大子矩阵

    建议看看王知昆dalao的论文,讲得很好 #include <algorithm> #include <iostream> #include <cstring> # ...

  4. 图解spring事务管理的实现

  5. CM10 WIFI连不上解决方案

    手机是Moto Mileston2 ,好久之前就刷成了CM10, 但是一直没出问题. 最近,发现在某些路由器上连接不上,总是 在验证账户或者获取IP. 解决办法如下: http://moto.zol. ...

  6. uiautomator 一个简单脚本创建流程

    http://www.codeceo.com/article/android-ui-auto-test.html

  7. TOJ 3581: 最简IPv6表示

    3581: 最简IPv6表示  Time Limit(Common/Java):1000MS/3000MS     Memory Limit:65536KByteTotal Submit: 121   ...

  8. Educational Codeforces Round 20 B. Distances to Zero

    B. Distances to Zero time limit per test 2 seconds memory limit per test 256 megabytes input standar ...

  9. kb-07专题线段树-02--单点修改,区间最值

    /* 区间单点该值,区间查询最大值: hdu-1754 */ #include<iostream> #include<cstdio> #include<cstring&g ...

  10. HDU-2234 无题I

    为每个状态定义两个函数S和H,分别表示当前状态到列一致和行一致的目标状态的最少操作次数. 然后有了估价函数F=Min(S,H)就可以IDA*了. #include <cstdio> #in ...