Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
Filip Ginter, Sampo Pyysalo, Jorma Boberg, Tapio S...
We present a novel approach to recognizing Textual nt. Structural features are constructed from abstract tree descriptions, which are automatically extracted from syntactic depend...
Abstract. In previous work, we presented an RDFS ontology, based on the Argument Interchange Format (AIF), for describing arguments and argument schemes. We also implemented a pilo...
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...