Created
January 10, 2012 15:10
-
-
Save AlexDel/1589515 to your computer and use it in GitHub Desktop.
NLTK. Ex 2.18 Write a program to print the 50 most frequent bigrams (pairs of adjacent words) of a text, omitting bigrams that contain stopwords.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def top_bigrams(text): | |
| fdist = nltk.probability.FreqDist(nltk.bigrams(text)) #формируем список кортежей биграмм | |
| stopwords = nltk.corpus.stopwords.words('english') #формируем стоплист | |
| top_list = [(x,y) for x,y in fdist.keys() if x.isalpha() and y.isalpha() and x not in stopwords and y not in stopwords] #показываем только если элементы кортежа - слова и невходят в стоплист | |
| return top_list |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment