In this paper, we introduce admissible vectors of covariant representations of a dynamical system which are extensions of the usual ones, and compare them with each other. Also, we give some sufficient conditions for a vector to be admissible vector of a covariant pair of a dynamical system.  In addition, we show the existence of Parseval frames for some special subspaces of $L^2(G)$ related to...

This paper describes an experiment in grammar engineering for a shallow syntactic parser using Genetic Programming and a treebank. The goal of the experiment is to improve the Parseval score of a previously manually created seed grammar. We illustrate the adaptation of the Genetic Programming paradigm to the problem of grammar engineering. The used genetic operators are described. The performan...

This paper introduces a new parser evaluation corpus containing around 700 sentences annotated with unbounded dependencies, from seven different grammatical constructions. We run a series of off-theshelf parsers on the corpus to evaluate how well state-of-the-art parsing technology is able to recover such dependencies. The overall results range from 25% accuracy to 59%. These low scores call in...

In this paper we propose a general method to estimate periodic unknown input signals of finitedimensional linear time-varying systems. We present an infinite-dimensional observer that reconstructs the coefficients of the Fourier decomposition of such systems. Although the overall system is infinite dimensional, convergence of the observer can be proven using a standard Lyapunov approach along w...

We consider a new subproblem of unsupervised parsing from raw text, unsupervised partial parsing—the unsupervised version of text chunking. We show that addressing this task directly, using probabilistic finite-state methods, produces better results than relying on the local predictions of a current best unsupervised parser, Seginer’s (2007) CCL. These finite-state models are combined in a casc...

We compare the use of edited text in the form of newswire and unedited text in the form of discussion forum posts as sources for training material in a self-training experiment involving the Brown reranking parser and a test set of sentences from an online sports discussion forum. We find that grammars induced from the two automatically parsed corpora achieve similar Parseval fscores, with the ...

|We analyze the representation of periodic signals in a scaling function basis. This representation is suÆciently general to include the widely used approximation schemes like wavelets, splines and Fourier series representation. We derive a closed form expression for the approximation error in the scaling function representation. The error formula takes the simple form of a Parseval like sum, w...

Conditional Random Fields (CRFs) are the state-of-the-art models for sequential labeling problems. A critical step is to select optimal feature template subset before employing CRFs, which is a tedious task. To improve the efficienc y of t his step, we propose a new method that adopts the maximum entropy (ME) model and maximum entropy Markov models (MEMMs) instead of CRFs considering the homolo...

We give a discussion of harmonic analysis on finite abelian groups, emphasizing various ways in which the structure of the group is encoded on various spaces of functions, ways in which the Fourier transform detects and preserves these structures. We discuss the major tools, like convolutions and Fourier transforms, along with some fundamental theorems, like the Plancheral, Parseval, Fourier in...