zoukankan      html  css  js  c++  java
  • Zipf’s Law

    Let f(w) be the frequency of a word w in free text. Suppose that all the words of a text are ranked according to their frequency, with the most frequent word first. Zipf’s Law states that the frequency of a word type is inversely proportional to its rank (i.e., f × r = k, for some constant k). For example, the 50th most common word type should occur three times as frequently as the 150th most common word type.
    a. Write a function to process a large text and plot word frequency against word rank using pylab.plot. Do you confirm Zipf’s law? (Hint: it helps to use a logarithmic scale.) What is going on at the extreme ends of the plotted line?
    b. Generate random text, e.g., using random.choice("abcdefg "), taking care to include the space character. You will need to import random first. Use the string concatenation operator to accumulate characters into a (very) long string. Then tokenize this string, generate the Zipf plot as before, and compare the two plots. What do you make of Zipf’s Law in the light of this?

     1 from nltk.corpus import gutenberg as gb
     2 
     3 def validate_zipf(text,ranklimit):
     4     fdist=nltk.FreqDist([w for w in text if w.isalpha()])
     5     x=range(ranklimit)
     6     freq=[]
     7     for key in fdist.keys():
     8        freq.append(fdist[key])
     9     y=sorted(freq,reverse=True)[:ranklimit]
    10     pylab.plot(x,y)
    11 
    12 def test():
    13     text=gb.words(fileids=['shakespeare-hamlet.txt'])
    14     validate_zipf(text,150)
    15     

    运行的结果为:

  • 相关阅读:
    HSF原理
    Spring IOC 容器源码分析
    Spring Bean注册和加载
    CAP和BASE理论
    Java内存模型
    Java线程模型
    IO复用、多进程和多线程三种并发编程模型
    无锁编程本质论
    An Introduction to Lock-Free Programming
    安装与配置ironic
  • 原文地址:https://www.cnblogs.com/gui0901/p/4449126.html
Copyright © 2011-2022 走看看