Parsing a Flexible Word Order Language
classification
cmp-lg
cs.CL
keywords
orderwordallowsapplicationconcisedeclarativedomainenlarging
read the original abstract
A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their application to non-siblings. This allows a concise, modular and declarative statement of intricate word order regularities.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.