This paper presents SFST-PL, a programming language for finite state transducers which is based on extended regular expressions with variables. The programming language is both si...
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
David Cachera, Thomas P. Jensen, Arnaud Jobin, Pas...
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
We present a limited prototype of the CLARIN Language Technology Infrastructure (LTI) node, which provides several types of web services for Polish. The functionality encompasses ...