1995/07/24 by Tore Burheim, Burheim, Tore
Biochemistry, Genetics and Molecular Biology · Computer Science · #Biomedical Text Mining and Ontologies #Computation and Language (cs.CL) #FOS: Computer and information sciences #Natural Language Processing Techniques #Semantic Web and Ontologies #cmp-lg #cs.CL
paper · pdf · doi:10.48550/arxiv.cmp-lg/9507012
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
arxiv created 1995/07/24 · openalex publication_date 1995/07/24 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.