On the implementation of the algorithm for representation of discontinuity in natural language

The present paper is a demonstration of the algorithm to integrate the representational principles of three grammar formalisms: constituency by Phrase Structure Grammar (PSG), head-dependency relations by Dependency Grammar (DG) and functor-argument relations by Categorial Grammar (CG) for achieving a unified representation. This algorithm is written for analyzing both continuous and discontinuous sentences in natural language and thereby provides a unique solution towards discontinuity in natural language. For mustrative purposes, a discontinuous relative clause from Salish has been taken to show the implementation of the algorithm. A discussion on the significance of this algorithm and the unified representation is present towards the end of the paper, followed by a conclusion.