Paper: A Logical Treatment Of Semi-Free Word Order And Bounded Discontinuous Constituency

ACL ID E89-1014
Title A Logical Treatment Of Semi-Free Word Order And Bounded Discontinuous Constituency
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1989
Authors
  • Mike Reape (University of Edinburgh, Edinburgh UK)

In this paper we present a logical treatment of semi- free word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single formalism with a rigorous semantics without phrase structure rules. The elimination of phrase structure rules allows a natural generalisation of the approach to nonconfigurational word order and bounded discontinuous continuency via sequence union. Sequence union formalises the notions of clause union and scrambling by providing a mechanism for describing word order domains larger than the local tree. The formalism incorporates the distinction between bounded and unbounded forms of discontinuous constituency. Grammars are organised as algebraic theories. This means that linguistic generalisations are stated as ...