The Cocke-Younger-Kasami algorithm for cyclic strings

The chain-code representation of contours is widely used in syntactic shape recognition. However the ignorance of a starting point makes the time complexity of traditional parsers increase in one order. This paper describes a technique for adapting, any Cocke-Younger-Kasami context-free parser in order to use it with cyclic strings. The parsers obtained with this technique have the same time and space complexity as the original one (usually O(n³))