• Projective dependency parsing with perceptron 

      Carreras Pérez, Xavier; Surdeanu, Mihai; Màrquez Villodre, Lluís (2010)
      Text en actes de congrés
      Accés obert
      We describe an online learning dependency parser for the CoNLL-X Shared Task, based on the bottom-up projective algorithm of Eisner (2000). We experiment with a large feature set that models: the tokens involved in ...
    • SVMs for the temporal expression chunking problem 

      Poveda Poveda, Jordi; Surdeanu, Mihai (2006-11)
      Report de recerca
      Accés obert
      This technical report provides a description of the Temporal Expression Chunking problem, which consists in finding the mentions of temporal expressions in free text documents, and reports on the results obtained using SVM ...
    • TALP-UPC at TREC 2005: Experiments using voting scheme among three heterogeneous QA systems 

      Ferrés Domènech, Daniel; Kanaan Izquierdo, Samir; González Pellicer, Edgar; Ageno Pulido, Alicia; Fuentes Fort, Maria; Rodríguez Hontoria, Horacio; Surdeanu, Mihai; Turmo Borras, Jorge (2005)
      Text en actes de congrés
      Accés obert
      This paper describes the experiments of the TALP-UPC group for factoid and ’other’ (definitional) questions at TREC 2005 Main Question Answering (QA)task. Our current approach for factoid questions is based on a voting ...
    • Using Evolutive Summary Counters for Efficient Cooperative Caching in Search Engines 

      Domínguez Sal, David; Aguilar Saborit, Josep; Surdeanu, Mihai; Larriba Pey, Josep (2012-04)
      Article
      Accés obert