Publication

The Wall Street Journal experiment (and useful programs)

Publications associées (32)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Phrase-based Image Captioning

Rémi Philippe Lebret, Ronan Collobert, Pedro Henrique Oliveira Pinheiro

Generating a novel textual description of an image is an interesting problem that connects computer vision and natural language processing. In this paper, we present a simple model that is able to generate descriptive sentences given a sample image. This m ...

JMLR2015

Accelerating parser combinators with macros

Manohar Jonnalagedda, Eric Beguet

Parser combinators provide an elegant way of writing parsers: parser implementations closely follow the structure of the underlying grammar, while accommodating interleaved host language code for data processing. However, the host language features used fo ...

ACM Press2014

Discourse-level Features for Statistical Machine Translation

Thomas Meyer

Machine Translation (MT) has progressed tremendously in the past two decades. The rule-based and interlingua approaches have been superseded by statistical models, which learn the most likely translations from large parallel corpora. System design does not ...

École Polytechnique Fédérale de Lausanne (EPFL)2014

Staged parser combinators for efficient data processing

Martin Odersky, Tiark Rompf, Sandro Stucki, Manohar Jonnalagedda, Thierry Coppey

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to b ...

ACM Press2014

Staged Parser Combinators for Efficient Data Processing

Martin Odersky, Tiark Rompf, Sandro Stucki, Manohar Jonnalagedda, Thierry Coppey

Assoc Computing Machinery2014

Constraint Solving for Software Reliability and Text Analysis

Viktor Kuncak

We will develop and implement new algorithms for constraint solving and apply them to construct two classes of tools: 1) bug finding and verification tools building on tools such as Java PathFinder and Jahob; 2) tools for deep semantic analysis of texts co ...

2008

Two approaches to Robust Stochastic Parsing

Marita Ailomaa

NLP applications in all domains require more than a formal grammar to process the input in a practical way, because natural language contains phenomena that a formal grammar is usually not able to describe. Such phenomena are typically disfluencies and ext ...

2004

Pseudo-Syntactic Language Modeling for Disfluent Speech Recognition

Language models for speech recognition are generally trained on text corpora. Since these corpora do not contain the disfluencies found in natural speech, there is a train/test mismatch when these models are applied to conversational speech. In this work w ...

IDIAP2004

Pseudo-Syntactic Language Modeling for Disfluent Speech Recognition

2004

Grammar-Based Tree Compression

Grammar-based compression means to find a small grammar that generates a given object. Such a grammar reveals the structure of the object (according to the grammar formalism used); the main advantage of this compression method is that the resulting grammar ...

2004