GE awards winners of Flight Quest 2!

GE has revealed the private leaderboard on Flight Quest 2 -- and four outstanding winners! The competition has been running since August as the second part of GE's Industrial Internet Flight Quest with a challenge to develop algorithms that increase flight efficiencies in real time, reducing delays and maximizing a flight's profitability. Using national airspace data provided by FlightStats, the winning algorithms determine the most efficient flight routes, speeds, and altitudes by taking into account variables such as weather, wind, and airspace restraints. The 1st place model by José Fonollosa proved to be up to 12 percent more efficient when compared to data from actual flights.

Read more: GE awards winners of Flight Quest 2!

25/04/1014 - Miguel Ballesteros - Going to the Roots of Dependency Parsing

Title Going to the Roots of Dependency Parsing
Speaker Miguel Ballesteros
Room Omega-S208 Campus Nord - UPC
Date Fri Apr 25, 2014
Time 11:00h

In this seminar I will first introduce transition-based dependency parsing and present the conclusions extracted from a journal paper that I have never had the chance to present in public, besides I'm going to sum up my current, past and future research collaboration projects with some new results and developments.

Dependency trees used in syntactic parsing often include a root node representing a dummy word prefixed or suffixed to the sentence, a device that is generally considered a mere technical convenience and is tacitly assumed to have no impact on empirical results. We demonstrate that this assumption is false and that the accuracy of data-driven dependency parsers can in fact be sensitive to the existence and placement of the dummy root node. In particular, we show that a greedy, left-to-right, arc-eager transition-based parser consistently performs worse when the dummy root node is placed at the beginning of the sentence (following the current convention in data-driven dependency parsing) than when it is placed at the end or omitted completely. Control experiments with an arc-standard transition-based parser and an arc-factored graph- based parser reveal no consistent preferences but nevertheless exhibit considerable variation in results depending on root placement. We conclude that the treatment of dummy root nodes in data-driven dependency parsing is an underestimated source of variation in experiments and may also be a parameter worth tuning for some parsers.


We are organizing the 30th SEPLN conference in Girona


Important Dates


  • Papers, posters and demos deadline: April 10 2014.
  • Notification of acceptance/rejection: May 26 2014.
  • Camera ready: June 7 2014.
  • Call for Workshop Proposals: February 17 2014.
  • Deadline for Workshops Proposals: March 17 2014.
  • Workshops Notification: March 24 2014.
  • Conference: September 17, 18, and 19 2014.
  • Workshops: September 19 2014.


  • Join us

    Job Offers and Research Positions

  • Awards

    Scientific awards Best: Publications, Thesis, Demos, ...

  • Seminars

    Framework to promote research related with Natural Language Processing or Speech Processing.

  • Thesis

    TALP PhD dissertation

  • Events

    Information about Courses, Conferences, workshops, talks, ...

  • Call For Papers

    Relevant Conference, workshops or special issues call for papers announcement

  • Relevant Publications
  • Members

    Professors, students and colaborators visiting TALP.

    New members incorporation and former members carreer.

  • Projects

    TALP research and innovation projects

  • Press

    Selected articles and reports about the TALP Research Center taken from the international press

  • Formation

Additional information