python的mapreduce_如何在python中实现mapreduce对模式

我尝试在python中尝试mapreduce pairs模式。需要检查一个单词是否在文本文件中，然后找到它旁边的单词并生成两个单词对。继续遇到：neighbors = words[words.index(w) + 1]

ValueError: substring not found

或者

^{pr2}$

文件工作_试用版.py在from mrjob.job import MRJob

class MRCountest(MRJob):

# Word count

def mapper(self, _, document):

# Assume document is a list of words.

#words = []

words = document.strip()

w = "the"

neighbors = words.index(w)

for word in words:

#searchword = "the"

#wor.append(str(word))

#neighbors = words[words.index(w) + 1]

yield(w,1)

def reducer(self, w, values):

yield(w,sum(values))

if __name__ == '__main__':

MRCountest.run()

编辑：

尝试使用pairs模式在文档中搜索特定单词的每个实例，然后每次都找到它旁边的单词。然后为每个实例生成一对结果，即查找“the”的实例及其旁边的单词，即[the]、[book]、[the]、[cat]等from mrjob.job import MRJob

class MRCountest(MRJob):

# Word count

def mapper(self, _, document):

# Assume document is a list of words.

#words = []

words = document.split(" ")

want = "the"

for w, want in enumerate(words, 1):

if (w+1) < len(words):

neighbors = words[w + 1]

pair = (want, neighbors)

for u in neighbors:

if want is "the":

#pair = (want, neighbors)

yield(pair),1

#neighbors = words.index(w)

#for word in words:

#searchword = "the"

#wor.append(str(word))

#neighbors = words[words.index(w) + 1]

#yield(w,1)

#def reducer(self, w, values):

#yield(w,sum(values))

if __name__ == '__main__':

MRCountest.run()

就目前的情况来看，我得到了每一个词对的产出率是同一对的倍数。在