Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
We studied a method using support vector machines (SVMs) with walk-based graph kernels for the high-level feature extraction (HLF) task. In this method, each image is first segmen...
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
Brian Roark, Murat Saraclar, Michael Collins, Mark...
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
We present sppc, a high-performance system for intelligent text extraction and navigation from German free text documents. sppc consists of a set of domainindependent shallow core...