TDL--- A Type Description Language for Constraint-Based Grammars

This paper presents \tdl, a typed feature-based representation language and inference system. Type definitions in \tdl\ consist of type and feature constraints over the boolean connectives. \tdl\ supports open- and closed-world reasoning over types and allows for partitions and incompatible types. Working with partially as well as with fully expanded types is possible. Efficient reasoning in \tdl\ is accomplished through specialized modules.Comment: Will Appear in Proc. COLING-9

An efficient Algorithm to partition a Sequence of Integers into Subsets with equal Sums

To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add up to the same sum.Comment: 12 page

The stability of simulation based estimation of the multiperiod multinominal probit model with individual specific covariates

The multi-period multinomial Probit model (MMPM) is seen as a flexible tool to explain individual choices among several alternatives over time. There are two versions of this model: a) for each individual the covariates for all alternatives are known and b) for each individual only the parameters of the alternative which was chosen is known. The main difficulty with the MMPM was the calculation of the probability for the individual sequence of chosen alternatives, which requires the computation of the integral over a high dimensional multivariate Normal density. This remedy was removed by the Smooth Recursive Conditional (SRC) simulator. Several simulation studies have investigated the stability of the MMPM estimates with special emphasis to the number of replications of the SRC routine. In contrast to these studies, which use the case of alternative specific covariates, we use the case of the individual specific covariates. We conclude that the MMPM with individual specific covariates is only weakly identified, generalizing Keane's (1992) result for the one period case. As a consequence the maximization of the simulated likelihood often converges to a singular covariance structure so that the SRC-routine stops iterating. This feature cannot be avoided by increasing the number of replications in the SRC-routine. The percentage of these failures rapidly increases with the number of alternatives. --discrete choice models,multi-period multinomial,probit models,simulated maximum likelihood method,smooth recursive conditional simulator,panel data

The DeepThought Core Architecture Framework

The research performed in the DeepThought project aims at demonstrating the potential of deep linguistic processing if combined with shallow methods for robustness. Classical information retrieval is extended by high precision concept indexing and relation detection. On the basis of this approach, the feasibility of three ambitious applications will be demonstrated, namely: precise information extraction for business intelligence; email response management for customer relationship management; creativity support for document production and collective brainstorming. Common to these applications, and the basis for their development is the XML-based, RMRS-enabled core architecture framework that will be described in detail in this paper. The framework is not limited to the applications envisaged in the DeepThought project, but can also be employed e.g. to generate and make use of XML standoff annotation of documents and linguistic corpora, and in general for a wide range of NLP-based applications and research purposes

The Hodge conjecture for self-products of certain K3 surfaces

We use a result of van Geemen to determine the endomorphism algebra of the Kuga--Satake variety of a K3 surface with real multiplication. This is applied to prove the Hodge conjecture for self-products of double covers of \PP^2 which are ramified along six lines.Comment: 24 page