Parsing a Flexible Word Order Language
<|reference_start|>Parsing a Flexible Word Order Language: 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.<|reference_end|>
@article{pericliev1995parsing,
    title={Parsing a Flexible Word Order Language},
    author={Vladimir Pericliev and Alexander Grigorov (Institute of Mathematics,
  Sofia, Bulgaria)},
    journal={arXiv preprint arXiv:cmp-lg/9505007},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9505007},
    primaryClass={cmp-lg cs.CL}
}