摘要： 之前一直看不懂马尔科夫算法的awk实现。最近学习了awk，基本上能看懂了。C++版的参见这里。#!/bin/awk -f#markov.awk: markov chain algorithm for 2-word perfixesBEGIN { MAXGEN = 10000; NONWORD = "\n"; w1=w2=NONWORD }{ for(i = 1; i <= NF; i++) { #read all words statetab[w1,w2,++nsuffix[w1,w2] ] = $i #print "IN",$i w1 = w2 阅读全文