Abstract This paper tackles the usefulness of comparing L2 learners against native speakers in empirical SLA studies focusing on grammatical aspect. Adapting view that interlanguage grammars should be analysed their own right instead as a deficient form target, we show expressing perspectivity (fulfilled by aspect markers) methodologically complicates analyses Grammaticality Judgment Tasks stud...

THEOREM 1.1 (U. Sattes). Let r > 2 and g E C[O, l]\B$,‘. Then f”EB$’ is a best approximation to g, in L” (such a best approximation necessari/J) exisrs) if and only if there exists a subinterual (a, /?) c IO. 1 I and a positilse integer M > r + 1 for which the following conditions hold (i) f”l,n.ll, is a Perfect spline of degree r with exactly) M ~ r -1 knots arzd I.f”““(s)l = I a. e. on [u,pI....

Archaeologists working on plantation sites have typically ignored the role that violence played in the lives of enslaved African-Americans. By drawing together examples from archaeological publications in which violence has been mentioned, the commentary illustrates not only both the types and scale of violence endured by African-Americans, but also how archaeologists have effectively sanitized...

Learning to transform English verbs from present to past tense has been studied extensively in the connectionist literature. A recent paper describes a symbolic approach that outperforms neural networks on this task, but the new system is still constrained by propositional-level attribute-value representations. A rst-order learning method that uses a relatively natural representation is found t...

We consider the size of circuits that perfectly hash an arbitrary subset S⊂{0, 1} of cardinality 2 into {0, 1}. We observe that, in general, the size of such circuits is exponential in 2k−m, and provide a matching upper bound.

We give various reformulations of the Strong Perfect Graph Conjecture, based on a study of forced coloring procedures, uniquely colorable subgraphs and ! ? 1-cliques in minimal imperfect graphs.

The amount of at retrieval time is one of the when looking for such functioiis. evidence about the effectivensss reduce the memory requirements perfect hash function proposed