The standard ParsEval metrics alone are often not sufficient for evaluating parsers integrated in natural language understanding systems. We propose to augment intrinsic parser evaluations by extrinsic measures in the context of human-robot interaction using a corpus from a human cooperative search task. We compare a constituent with a dependency parser on both intrinsic and extrinsic measures ...

The present paper for the first time constructs a frame/dual frame pair of shearlet type such that both frames possess the distinctive time-frequency localization properties needed in establishing their desirable approximation properties. Our construction is based on a careful pasting together of two bandlimited shearlet Parseval frames associated with two different frequency cones, inspired by...

This lecture note describes an iterative optimization algorithm, ‘SALSA’, for solving L1-norm penalized least squares problems. We describe the use of SALSA for sparse signal representation and approximation, especially with overcomplete Parseval transforms. We also illustrate the use of SALSA to perform basis pursuit (BP), basis pursuit denoising (BPD), and morphological component analysis (MC...

This paper presents a statistical parser for a wide-coverage Combinatory Categorial Grammar (CCG) derived from the Penn Treebank. The Treebank is translated to a corpus of canonical CCG derivations. We de ne a generative statistical model over CCG derivations and train it on the transformed Treebank. This model is evaluated using Parseval measures and the accuracy of recovery of word-word depen...

This paper considers group reconstruction systems (GRS’s), for finite dimensional real or complex Hilbert spaces H, that are associated with unitary representations of finite abelian groups. The relation between these GRS’s and the generalized Fourier matrix is established. A special type of Parseval GRS, called harmonic reconstruction system (HRS), is defined. It is shown that there exist HRS’...

Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying many AI uncertainty formalisms to this situation, as their representation of the underlying logic, either as a mutually exclusive and exhaustive set of possibilities, or with a propositional or a predicate logic, is inappropriate (or at leas...

In this series of lectures the basic ideas of the 1/mQ expansion in QCD (mQ is the mass of a heavy quark) are outlined. Applications to exclusive and inclusive decays are given.