Have a look at this similar question: (Find most common substring in a list of strings?)
I added in the condition that it won't match the word if the length is less than 4
from difflib import SequenceMatcher
substring_counts={}
list = ['sinazz31', 'sinazz12', '45sinazz', 'sinazz_84']
for i in range(0, len(list)):
for j in range(i+1,len(list)):
string1 = list[i]
string2 = list[j]
match = SequenceMatcher(None, string1, string2).find_longest_match(0, len(string1), 0, len(string2))
matching_substring=string1[match.a:match.a+match.size]
if(matching_substring not in substring_counts and len(matching_substring) > 3):
substring_counts[matching_substring]=1
else:
substring_counts[matching_substring]+=1
print(substring_counts)