[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/docs/papers/harbusch-2002-quantitative-model-word-order-movement/) [home](https://md.mova.elamur.ai/free/en/) / [docs](https://md.mova.elamur.ai/free/en/docs/) / [papers](https://md.mova.elamur.ai/free/en/docs/papers/) / [English](https://md.mova.elamur.ai/free/en/docs/papers/en/) / A Quantitative Model of Word Order and Movement in English, Dutch and German Complement Constructions # A Quantitative Model of Word Order and Movement in English, Dutch and German Complement Constructions **Authors:** Karin Harbusch, Gerard Kempen · **Year:** 2002 · **Venue:** COLING 2002: The 19th International Conference on Computational Linguistics **Link:** [aclanthology.org/C02-1034](https://aclanthology.org/C02-1034/) · **Licence:** [CC BY-NC-SA 3.0](https://creativecommons.org/licenses/by-nc-sa/3.0/) (ACL Anthology, before 2016) — summary only [**2** citations in our library](https://md.mova.elamur.ai/free/en/docs/papers/cited-by/harbusch-2002-quantitative-model-word-order-movement/) of the 140673 papers whose bibliographies we read[COLING 2002: The 19th International Conference on Computational Linguistics](https://aclanthology.org/volumes/C02-1/)[licence](https://creativecommons.org/licenses/by-nc-sa/3.0/) - [Publisher's page](https://aclanthology.org/C02-1034/) - [PDF](https://aclanthology.org/C02-1034.pdf) **Authors (2)** 1. Karin Harbusch 2. Gerard Kempen Citations and author metrics from OpenAlex (); authors with the same name are not always told apart. ## What it is about The paper describes word order and movement in complement clauses of English, Dutch and German within Performance Grammar (PG), a psycholinguistically motivated formalism. A clause has a topology of fixed slots: nine for English (F1 to E2) and nine for Dutch and German (F1, M1 to M6, E1, E2). Movement of a phrase out of an embedded clause is "lateral topology sharing": two adjacent slots of the matrix and embedded clause are unified. How many slots are shared is set by two numeric parameters, LS and RS, which the lexical entry of the governing verb supplies. The paper gives these settings for five complement types (interrogative LS=0; finite declaratives LS=1; non-finite VP extraposition LS=3 in English) and derives island effects such as the contrast between "claim that" and "make the claim that". No corpus or measurement is reported. ## Ideas - I1. `en/src/lin.rs`: add a small English table of LS and RS per complement type (interrogative 0, finite declarative 1, non-finite extraposition 3), with the value taken from the governing verb's entry. Measure the linearisation of wh-extracted complements on UD EWT, with a control that forces LS=0 for declaratives, which must lower the score. - I2. Make the island rule deterministic: no slot sharing when the governor is a noun ("the claim that"), as in the paper's (4a) and (4b). Build a minimal-pair list and report that the gate blocks exactly the noun cases. - I3. [25. Relative clauses](https://md.mova.elamur.ai/free/en/docs/languages/en/25-relative-clauses/) and `26-questions.md`: wh-promotion out of a finite complement is the same operation as the English relative and question cases; a single promotion rule in `lin.rs` can be tested on both. ## For Mova The English chapters are [23. Complementation](https://md.mova.elamur.ai/free/en/docs/languages/en/23-complementation/) and `21-clause-structure.md`. The code is `en/src/lin.rs` (linearisation from the tree), with `prag` for the question readings. The measure is linearisation accuracy on UD EWT plus the minimal-pair list. The paper's Dutch and German tables do not apply to English, but the parameter idea does. ## Cite The paper itself, not this card. BibTeX from the library's record of the work. ``` @inproceedings{harbusch2002quantitative, title = {{A Quantitative Model of Word Order and Movement in English, Dutch and German Complement Constructions}}, author = {Harbusch, Karin and Kempen, Gerard}, booktitle = {COLING 2002: The 19th International Conference on Computational Linguistics}, year = {2002}, url = {https://aclanthology.org/C02-1034/} } ``` - [← previous Exploring Difficulties in Parsing Imperatives and Questions](https://md.mova.elamur.ai/free/en/docs/papers/hara-2011-exploring-difficulties-parsing-imperatives-questions/) - [next → Verb-third phenomena in Germanic verb-second languages: Historical and variational perspectives](https://md.mova.elamur.ai/free/en/docs/papers/harchaoui-2025-verb-third-phenomena-germanic/) - [↑ back to English](https://md.mova.elamur.ai/free/en/docs/papers/en/) ## References 6 references, 0 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet. 1. G ORN , S. (1967). Explicit Definition and Linguistic Dominoes. Systems and Computer Science. Toronto: University of Toronto Press. [find](https://scholar.google.com/scholar?q=G+ORN+%2C+S%2E+%281967%29%2E+Explicit+Definition+and+Linguistic+Dominoes%2E+Systems+and+Computer+Science%2E+Toronto%3A+University+of+Toronto+Press%2E) 2. H ARBUSCH , K. & KEMPEN , G. (2000). Complexity of linear order computation in Performance Grammar, TAG and HPSG. In: Proceedings of Fifth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), University of Paris 7, May 2000. [find](https://scholar.google.com/scholar?q=H+ARBUSCH+%2C+K%2E+%26+KEMPEN+%2C+G%2E+%282000%29%2E+Complexity+of+linear+order+computation+in+Performance+Grammar%2C+TAG+and+HPSG%2E+In%3A+Proceedings+of+Fifth+International+Workshop+on+Tree+Adjoining+Grammars+and+Related) 3. J OSHI , A.K. & S CHABES , Y. (1997). Tree Adjoining Grammars. In: Rozenberg, G. & Salomaa, A. (Eds.), Handbook of formal languages (Vol. 3). Berlin: Springer. [find](https://scholar.google.com/scholar?q=J+OSHI+%2C+A%2EK%2E+%26+S+CHABES+%2C+Y%2E+%281997%29%2E+Tree+Adjoining+Grammars%2E+In%3A+Rozenberg%2C+G%2E+%26+Salomaa%2C+A%2E+%28Eds%2E%29%2C+Handbook+of+formal+languages+%28Vol%2E+3%29%2E+Berlin%3A+Springer%2E) 4. K ATHOL , A. (2000). Linear Syntax. New York: Oxford University Press. [find](https://scholar.google.com/scholar?q=K+ATHOL+%2C+A%2E+%282000%29%2E+Linear+Syntax%2E+New+York%3A+Oxford+University+Press%2E) 5. S AG , I.A. & W ASOW , T. (1999). Syntactic theory: a formal introduction. Stanford CA: CSLI Publications. [find](https://scholar.google.com/scholar?q=S+AG+%2C+I%2EA%2E+%26+W+ASOW+%2C+T%2E+%281999%29%2E+Syntactic+theory%3A+a+formal+introduction%2E+Stanford+CA%3A+CSLI+Publications%2E) 6. V OSSE , T. & K EMPEN , G. (2000). Syntactic structure assembly in human parsing: A computational model based on competitive inhibition and a lexicalist grammar. Cognition, 75, 105-143. [find](https://scholar.google.com/scholar?q=V+OSSE+%2C+T%2E+%26+K+EMPEN+%2C+G%2E+%282000%29%2E+Syntactic+structure+assembly+in+human+parsing%3A+A+computational+model+based+on+competitive+inhibition+and+a+lexicalist+grammar%2E+Cognition%2C+75%2C+105%2D143%2E)