A logical treatment of semi-free word order and bounded discontinuous constituency

11Citations
Citations of this article
74Readers
Mendeley users who have this article in their library.

Abstract

In this paper we present a logical treatment of semifree 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 axioms about the structure of signs. This permits a natural interpretation of implicational universals in terms of theories, subtheories and implicational axioms. The accompanying linguistic analysis is eclectic, borrowing insights from many current linguistic theories.

Cite

CITATION STYLE

APA

Reape, M. (1989). A logical treatment of semi-free word order and bounded discontinuous constituency. In 4th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1989 - Proceedings (pp. 103–110). Association for Computational Linguistics (ACL). https://doi.org/10.3115/976815.976829

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free