Parser evaluation traditionally relies on evaluation metrics which deliver a single aggregate score over all sentences in the parser output, such as PARSEVAL. However, for the evaluation of parser performance concerning a particular phenomenon, a test suite of sentences is needed in which this phenomenon has been identified. In recent years, the parsing of discontinuous structures has received ...

Most of our applications of harmonic analysis to computer science will involve only Parseval’s identity. Theorem 4.1 (Parseval’s Identity). ‖f‖2 = ‖f̂‖2 Corollary 4.2. 〈f, g〉 = 〈f̂ , ĝ〉. Proof. Note that 〈f + g, f + g〉 = ‖f + g‖2 = ‖f̂ + g‖2 = ‖f̂ + ĝ‖2. Now as 〈f + g, f + g〉 = ‖f‖2 + ‖g‖2 + 2〈f, g〉, and similarly ‖f̂ + ĝ‖2 = ‖f̂‖2 + ‖ĝ‖2 + 2〈f̂ , ĝ〉, applying Parseval to ‖f‖2 and ‖g‖2 and equating fi...

As of yet, there is no statistical parser for Modern Hebrew (MH). Current practice in building parsing models is not immediately applicable to languages that exhibit strong interaction between syntax and morphology, e.g. Modern Hebrew, Arabic and other Semitic languages. We suggest that incorporating morphological and morphosyntactic information into the parsing model is essential for parsing S...

Soft errors are the most common problems faced now days. They could be corrected using software functions .Communications and signal processing systems are no exceptions to this trend. For some applications, an interesting option is to use algorithmic-based fault tolerance (ABFT) techniques that try to exploit the algorithmic properties to detect and correct errors. Signal processing and commun...

This paper describes a human-like natural language parser called Plink. It works by parsing left-to-right through a sentence and keeping a complete representation of the partially read sentence. It does this by combining a sophisticated unification-based grammar and grammar rule selection heuristics. Plink also functions in real world applications. To do this, it must process texts that are not...

We present a novel corpus-driven approach towards grammar approximation for a linguistically deep Head-driven Phrase Structure Grammar. With an unlexicalized probabilistic context-free grammar obtained by Maximum Likelihood Estimate on a largescale automatically annotated corpus, we are able to achieve parsing accuracy higher than the original HPSG-based model. Different ways of enriching the a...

We present a two stage parser that recovers Penn Treebank style syntactic analyses of new sentences including skeletal syntactic structure, and, for the first time, both function tags and empty categories. The accuracy of the first-stage parser on the standard Parseval metric matches that of the (Collins, 2003) parser on which it is based, despite the data fragmentation caused by the greatly en...

It has recently been shown that different NLP models can be effectively combined using dual decomposition. In this paper we demonstrate that PCFG-LA parsing models are suitable for combination in this way. We experiment with the different models which result from alternative methods of extracting a grammar from a treebank (retaining or discarding function labels, left binarization versus right ...

We use the recent comprehensive research [17, 19] on the manifolds of square roots of −1 in real Clifford’s geometric algebras Cl(p,q) in order to construct the Clifford Fourier transform. Basically in the kernel of the complex Fourier transform the imaginary unit j ∈ C is replaced by a square root of−1 in Cl(p,q). The Clifford Fourier transform (CFT) thus obtained generalizes previously known ...