The following tree pattern matching problem is considered: Given two unordered labeled trees P and T , find all occurrences of P in T . Here P and T are called a pattern tree and a target tree, respectively. We first introduce a new problem called the pseudo-tree pattern matching problem. Then we show two efficient bit-parallel algorithms for the pseudo-tree pattern matching problem. One runs i...

We consider the construction of part-of-speech taggers for resource-poor languages. Recently, manually constructed tag dictionaries from Wiktionary and dictionaries projected via bitext have been used as type constraints to overcome the scarcity of annotated data in this setting. In this paper, we show that additional token constraints can be projected from a resourcerich source language to a r...

We introduce the first grammar-compressed representation of a sequence that supports searches in time that depends only logarithmically on the size of the grammar. Given a text T [1..u] that is represented by a (context-free) grammar of n (terminal and nonterminal) symbols and size N (measured as the sum of the lengths of the right hands of the rules), a basic grammar-based representation of T ...

We present a method to expand a linguistic resource with paraphrases, which combines two techniques whose drawbacks neutralise reciprocally. The first step over-generates sentences by using analogy, while the second step overeliminates erroneous sentences which do not meet a criterion on N -gram occurrences. In a practical experiment, we added 17,862 paraphrases to a linguistic resource of 97,7...

We propose a new language for writing programs with dependent types which can be elaborated into partial Coq terms. This language permits to establish a phase distinction between writing and proving algorithms in the Coq environment. Concretely, this means allowing to write algorithms as easily as in a practical functional programming language whilst giving them as rich a specification as desir...

Cognitive science and evolutionary psychology show great potential as explanatory paradigms for a wide array of cultural products and activities, including literature. In some scholars’ minds these two fields are emerging as the cornerstones of a major ‘‘new interdisciplinarity’’ that may well displace the relativistic interpretive paradigms that have dominated the humanities for the last few d...

It has often been argued that the (type or token) frequency of an affix in the lexicon cannot be used to predict the degree to which that affix is productive. Affix type frequency refers to the number of different words which contain an affix, token frequency refers to the summed lexical frequency of those words. The observation that neither of these counts relates straightforwardly to producti...

We propose a method for automatically identifying individual instances of English verb-particle constructions (VPCs) in raw text. Our method employs the RASP parser and analysis of the sentential context of each VPC candidate to differentiate VPCs from simple combinations of a verb and prepositional phrase. We show that our proposed method has an F-score of 0.974 at VPC identification over the ...

A partially ordered (generalized) pattern (POP) is a generalized pattern some of whose letters are incomparable, an extension of generalized permutation patterns introduced by Babson and Steingŕımsson. POPs were introduced in the symmetric group by Kitaev [19, 21], and studied in the set of k-ary words by Kitaev and Mansour [22]. Moreover, Kitaev et al. [23] introduced segmented POPs in composi...

SUMMARY The present paper describes a computational solution to the problem of locating words that are zeroed under conjunction. In this solution, which is based on general properties 3f conjunctional constructions, a mechanism locates zeroed elements in the conjunction strings and cross-references them d t h respect to elements in the h e a d construction. Constraints can then be a p p l i e d...