We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Using the subband technique, an LTI system can be implemented by the composition of an analysis filterbank, followed by a transfer matrix (subband model) and a synthesis filterbank...
Abstract. As potential candidates for human cognition, connectionist models of sentence processing must learn to behave systematically by generalizing from a small traning set. It ...