Finding Pattern Score in Python
Code Style
Remember to follow PEP 8 where you can. In particular, you should use snake_case rather than camelCase.
Making your Intentions Clear
Be sure to use comments to explain why your steps are needed rather than just what your code does:
lenText -= 1 # reduce lenText by 1

It is reasonably clear what your code is doing, but you could comment to explain why you're doing this. I'd be tempted to rewrite your substring finding loop as:
# Iterate over all possible substrings of text
for start_index in range(0, len(text)):
    for end_index in range(start_index + 1, len(text) + 1):
        L = text[start_index:end_index]
        # Your logic here

Storing Results
If you preferred, you could save some memory by only storing the patterns that have the highest score we've seen so far.
# Stores the highest seen pattern score so far.
highest_score = 0
# Stores the substrings of text that give highest_score.
highest_substrings = []

You then just need to check if your current score is strictly greater than the highest score seen so far and empty highest_substrings, then if you see a score greater than or equal to highest_score you add that substring to highest_substrings.