Knuth-Morris-Pratt Algorithm

I've been looking at this Algorithm and I understand how it works given a Next table (a table which after a failed match tells us which position in the pattern to compare next) and I understand that you work out the Next table by comparing the pattern to itself, but I do not understand how to do this.

So, I'm asking if anyone could attempt to explain how to create the next table using the pattern ACACB. Just to clarify, I'm not wanting to know how to code this in java, but how to do it on paper.

[516 byte] By [Phoresisa] at [2007-10-2 9:08:00]