A Grammar Formalism and Cross-Serial Dependencies
cmp-lg
2008-02-03 v1 Computation and Language
Abstract
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.
Keywords
Cite
@article{arxiv.cmp-lg/9507012,
title = {A Grammar Formalism and Cross-Serial Dependencies},
author = {Tore Burheim},
journal= {arXiv preprint arXiv:cmp-lg/9507012},
year = {2008}
}
Comments
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 1995