Parsing a Flexible Word Order Language
cmp-lg
2008-02-03 v1 Computation and Language
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.
Cite
@article{arxiv.cmp-lg/9505007,
title = {Parsing a Flexible Word Order Language},
author = {Vladimir Pericliev and Alexander Grigorov},
journal= {arXiv preprint arXiv:cmp-lg/9505007},
year = {2008}
}
Comments
6 pages, LaTeX, in proceedings of COLING-94