JKP, i was expecting such a remark and of course, because you are right.
I can explain how this happend: in the beginning...MarcoP started with that definition and because i want to compare that method with my first-last letter method, it was already hard to explain that, i did not want to make things more complex and confusing and we held onto the "prefix-suffix" naming.
Anton:
We considered only words length>=4.
Wordcount with letter c on any position: 11887 words (i use another text now than for the matrix above)
NO. 7088 words have the prefix -c
The concept of the "prefx-suffix" is counting the occurence of 2 letters at the same time in that combination
So if you look at prefix-suffix-> c- i -> occurs only once -> we need to look for a word that looks like c..... and following word i......
I can explain how this happend: in the beginning...MarcoP started with that definition and because i want to compare that method with my first-last letter method, it was already hard to explain that, i did not want to make things more complex and confusing and we held onto the "prefix-suffix" naming.
Anton:
We considered only words length>=4.
Wordcount with letter c on any position: 11887 words (i use another text now than for the matrix above)
Quote:If so, then 7088 words end with c? Can this be true?
NO. 7088 words have the prefix -c
The concept of the "prefx-suffix" is counting the occurence of 2 letters at the same time in that combination
So if you look at prefix-suffix-> c- i -> occurs only once -> we need to look for a word that looks like c..... and following word i......

