From the title of a word game

Independent Blog Address: http://cxh.me/2015/01/05/a-word-puzzle/

The origins are such a topic:

So I thought of word dict to calculate:

First to download the Chinese thesaurus:

git clone [email protected].com:ling0322/webdict.git 

Then remove the word frequency information:

awk  ‘{ if (length($1)==2) print $1}‘ webdict_with_freq.txt >webdict.txt

Filter the candidate set by the occurrence position first, and remove the big/day/wind/think four characters:

Grep' ^ Big. 'Webdict.Txt|Sed' s/Big//g ' >Da.Txtgrep' ^ th. * 'Webdicttxt| sed  ' s/day//g '  >ri. * Wind $ '  Webdict. Txt| sed  s/wind//g '  >< Span class= "PLN" >feng. Webdict. Txt| sed  s/think//g '  >< Span class= "PLN" >si.                 

After the thing is very interesting, each join two files, because the big/day/wind/think four words are no intersection, so the result is the required word:

Comm-12 < (Sort da.Txt|Uniq) < (Sort RI.Txt|Uniq) >Da_ri.Txtcomm-12 < (Sort Feng.Txt|Uniq) < (sort da_ri.| Uniq )  >da_ri_fengtxtcomm -12 < (sort si.| Uniq )  < (sort Da_ri_feng txt|)  >da_ri_feng_si txt                

The last murderer has only one answer:

Thank you for watching ~.

Reference documents:

[1] LINUX Shell for two file intersection and differential set method, http://blog.csdn.net/autofei/article/details/6579320

From the title of a word game