A Grammar Formalism and Cross-Serial Dependencies

Details A Grammar Formalism and Cross-Serial Dependencies A Grammar Formalism and Cross-Serial Dependencies

1995-07-24

arxiv.org/abs/cmp-lg/9507012v1

Computer Science

Computation and Language

19 pages uuencodet gnu-compressed PostScript format. A previous version of this paper is printed in the proceedings from the j

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Grammar Formalism and Cross-Serial Dependencies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Grammar Formalism and Cross-Serial Dependencies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Grammar Formalism and Cross-Serial Dependencies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102973