Recent Submissions

  • Limited logical belief analysis 

    Moreno Ribas, Antonio (1996-02-02)
    External research report
    Open Access
    The process of rational inquiry can be defined as the evolution of the beliefs of a rational agent as a consequence of its internal inference procedures and its interaction with the environment. These beliefs can be ...
  • POS tagging using relaxation techniques 

    Padró, Lluís (1996-02)
    External research report
    Open Access
    Relaxation labelling is an optimization technique used in many fields to solve constraint satisfaction problems. The algorithm finds a combination of values for a set of variables such that satisfies - to the maximum ...
  • Word sense disambiguation using conceptual density 

    Agirre, Eneko; Rigau Claramunt, German (1996-01)
    External research report
    Open Access
    This paper presents a method for the resolution of lexical ambiguity and its automatic evaluation over the Brown Corpus. The method relies on the use of the wide-coverage noun taxonomy of WordNet and the notion of ...
  • A Proposal for word sense disambiguation using conceptual distance 

    Agirre, Eneko; Rigau Claramunt, German (1996-02-01)
    External research report
    Open Access
    This paper presents a method for the resolution of lexical ambiguity and its automatic evaluation over the Brown Corpus. The method relies on the use of the wide-coverage noun taxonomy of WordNet and the notion of ...
  • Using bidirectional chart parsing for corpus analysis 

    Ageno Pulido, Alicia; Rodríguez Hontoria, Horacio (1996-02)
    External research report
    Open Access
    Several experiments have been developed around a bidirectional island-driven chart parser. The system follows basically the approach of Stock, Satta and Corazza, and the experiments have been designed and performed with ...
  • Towards learning a constraint grammar from annotated corpora using decision trees 

    Màrquez Villodre, Lluís; Rodríguez Hontoria, Horacio (1996-02)
    External research report
    Open Access
    Inside the framework of robust parsers for the syntactic analysis of unrestricted text, the aim of this work is the construction of a system capable of automatically learning Constraint Grammar rules from a POS annotated ...
  • Compressibility of infinite binary sequences 

    Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Hermo Huguet, Montserrat (1996-02-06)
    External research report
    Open Access
    It is known that infinite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might ...
  • Change of belief in SKL model frames (automatization based on analytic tableaux) 

    Alvarado, G.; Núñez Esquer, Gustavo (1996-01-01)
    External research report
    Open Access
    A recent major approach to deal, formally and computationally, with knowledge and belief is the AGM. We will show the adequate representation of this paradigm using three-valued model frames. AGM expansion, contraction, ...
  • Skip trees, an alternative data structure to skip-lists in a concurrent approach 

    Messeguer Peypoch, Xavier (1996-01)
    External research report
    Open Access
    We present a new type of search trees isomorphic to Skip-lists, i.e., there is a one-to-one mapping that commutes with the update algorithms. Moreover, as Skip-trees inherit all the race properties from Skip-lists, they ...
  • (Pure) logic out of probability 

    Sales Porta, Ton (1996-01)
    External research report
    Open Access
    Logic and Probability are seen today as independent fields, but they share a considerable common ground, which historically underlies both disciplines and has prompted Reichenbach, Carnap or Popper to consider connection-building ...

View more