max no of times a particular character in a string in knuth morris pratt algorithm comes into comparison with the string?

Let

T:String
P:pattern

what is the max no of times a particular character in a string(T) in knuth morris pratt algorithm comes into comparison with the pattern(P) ?