A Processing Model for Free Word Order Languages

Like many verb-final languages, Germn displays considerable word-order freedom: there is no syntactic constraint on the ordering of the nominal arguments of a verb, as long as the verb remains in final position. This effect is referred to as ``scrambling'', and is interpreted in transformational frameworks as leftward movement of the arguments. Furthermore, arguments from an embedded clause may move out of their clause; this effect is referred to as ``long-distance scrambling''. While scrambling has recently received considerable attention in the syntactic literature, the status of long-distance scrambling has only rarely been addressed. The reason for this is the problematic status of the data: not only is long-distance scrambling highly dependent on pragmatic context, it also is strongly subject to degradation due to processing constraints. As in the case of center-embedding, it is not immediately clear whether to assume that observed unacceptability of highly complex sentences is due to grammatical restrictions, or whether we should assume that the competence grammar does not place any restrictions on scrambling (and that, therefore, all such sentences are in fact grammatical), and the unacceptability of some (or most) of the grammatically possible word orders is due to processing limitations. In this paper, we will argue for the second view by presenting a processing model for German.Comment: 23 pages, uuencoded compressed ps file. In {\em Perspectives on Sentence Processing}, C. Clifton, Jr., L. Frazier and K. Rayner, editors. Lawrence Erlbaum Associates, 199

Best conventional solutions to the King's Problem

In the King's Problem, a physicist is asked to prepare a d-state quantum system in any state of her choosing and give it to a king who measures one of (d+1) sets of mutually unbiased observables on it. The physicist is then allowed to make a control measurement on the system, following which the king reveals which set of observables he measured and challenges the physicist to predict correctly all the eigenvalues he found. This paper obtains an upper bound on the physicist's probability of success at this task if she is allowed to make measurements only on the system itself (the "conventional" solution) and not on the system as well as any ancillary systems it may have been coupled to in the preparation phase, as in the perfect solutions proposed recently. An optimal conventional solution, with a success probability of 0.7, is constructed in d = 4; this is to be contrasted with the success probability of 0.902 for the optimal conventional solution in d = 2. The gap between the best conventional solution and the perfect solution grows quite rapidly with increasing d.Comment: 17 pages, 5 tables. Parts of Sec.2 and the appendix have been rewritten to improve the clarity of the presentatio

Quantum Kaleidoscopes and Bell's theorem

A quantum kaleidoscope is defined as a set of observables, or states, consisting of many different subsets that provide closely related proofs of the Bell-Kochen-Specker (BKS) and Bell nonlocality theorems. The kaleidoscopes prove the BKS theorem through a simple parity argument, which also doubles as a proof of Bell's nonlocality theorem if use is made of the right sort of entanglement. Three closely related kaleidoscopes are introduced and discussed in this paper: a 15-observable kaleidoscope, a 24-state kaleidoscope and a 60-state kaleidoscope. The close relationship of these kaleidoscopes to a configuration of 12 points and 16 lines known as Reye's configuration is pointed out. The "rotations" needed to make each kaleidoscope yield all its apparitions are laid out. The 60-state kaleidoscope, whose underlying geometrical structure is that of ten interlinked Reye's configurations (together with their duals), possesses a total of 1120 apparitions that provide proofs of the two Bell theorems. Some applications of these kaleidoscopes to problems in quantum tomography and quantum state estimation are discussed.Comment: Two new references (No. 21 and 22) to related work have been adde

Solution to the King's Problem in prime power dimensions

It is shown how to ascertain the values of a complete set of mutually complementary observables of a prime power degree of freedom by generalizing the solution in prime dimensions given by Englert and Aharonov [Phys. Lett. A284, 1-5 (2001)].Comment: 16 pages, 6 tables. A typo in an inequality on the line preceding Eqn.(4)has been correcte

Factoring Predicate Argument and Scope Semantics : underspecified Semantics with LTAG

In this paper we propose a compositional semantics for lexicalized tree-adjoining grammar (LTAG). Tree-local multicomponent derivations allow separation of the semantic contribution of a lexical item into one component contributing to the predicate argument structure and a second component contributing to scope semantics. Based on this idea a syntax-semantics interface is presented where the compositional semantics depends only on the derivation structure. It is shown that the derivation structure (and indirectly the locality of derivations) allows an appropriate amount of underspecification. This is illustrated by investigating underspecified representations for quantifier scope ambiguities and related phenomena such as adjunct scope and island constraints