A Grammar Formalism and Cross-Serial Dependencies
<|reference_start|>A Grammar Formalism and Cross-Serial Dependencies: First 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.<|reference_end|>
@article{burheim1995a,
    title={A Grammar Formalism and Cross-Serial Dependencies},
    author={Tore Burheim (University of Bergen)},
    journal={arXiv preprint arXiv:cmp-lg/9507012},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9507012},
    primaryClass={cmp-lg cs.CL}
}