A Grammar Formalism and Cross-Serial Dependencies
| dc.creator | Burheim, Tore | |
| dc.date | 1995-07-24 | |
| dc.date.accessioned | 2026-07-07T09:09:57Z | |
| dc.date.available | 2026-07-07T09:09:57Z | |
| dc.description | 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. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9507012 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9507012 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151220 | |
| dc.subject | Computation and Language | |
| dc.title | A Grammar Formalism and Cross-Serial Dependencies | |
| dc.type | text |