2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/151220First we define a unification grammar formalism called the Tree Homomorphic Feature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this grammar formalism defines a full abstract family of languages, and that it is capable of describing cross-serial dependencies of the type found in Swiss German.19 pages uuencodet gnu-compressed PostScript format. A previous version of this paper is printed in the proceedings from the joint ELSNET/COMPULOG-NET/EAGLES workshop Computational Logic for Natural Language Processing (CLNLP95) in Edinburgh in April 1995Computation and Languagetext