Pattern Matching Algorithms

Naive.py

def naive(pattern, text):
    occurrences = []
    for i in range(len(text) - len(pattern) + 1):
        match = True
        for k in range(len(pattern)):
            if text[i+k] != pattern[k]:
                match = False
                break
        if match:
            occurrences.append(i)
    return occurrences

print naive('word', 'There would have been a time for such a word')