Parsing a Flexible Word Order Language

Simple item page
dc.creatorPericliev, Vladimir
dc.creatorGrigorov, Alexander
dc.date1995-05-03
dc.date.accessioned2026-07-07T09:09:48Z
dc.date.available2026-07-07T09:09:48Z
dc.descriptionA 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.
dc.description6 pages, LaTeX, in proceedings of COLING-94
dc.identifierhttps://arxiv.org/abs/cmp-lg/9505007
dc.identifierhttp://arxiv.org/abs/cmp-lg/9505007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151167
dc.subjectComputation and Language
dc.titleParsing a Flexible Word Order Language
dc.typetext

Files

Collections

arXiv