Analyzing the Linearization Algorithms of Multidominant Structures: In Search of a Theoretical Generalization

Parallel merge generates a structure that contains a double symmetric relation, in which the shared object has two mother nodes. Naturally, the Linearization of multidominant structures derived from parallel merge will face challenges. The purpose of this study was to analyze and dissect the algorithms that have been proposed in the relevant literature to address the challenge of the linearization of multidominant structures. Specifically, in this research, the content of the proposed algorithms regarding linearization of multidominant structure was qualitatively examined using graph and set notations. The empirical and computational quantitative approaches, in relation to the existence of this type of structure, showed that multidominant structure was the natural result of the function of merge in the workspace rather than the consequences of parallel merge. To shed light on the performance of merge in the workspace, putting order into set merge was raised. Hence, part of the linearization took place in narrow syntax.