Concept

Probabilistic context-free grammar

Related publications (49)

Synthesizing Java Expressions from Free-Form Queries

We present a new code assistance tool for integrated development environments. Our system accepts as input free-form queries containing a mixture of English and Java, and produces Java code expressions that take the query into account and respect syntax, t ...

Assoc Computing Machinery2015

Search Techniques for Code Generation

Tihomir Gvero

This dissertation explores techniques that synthesize and generate program fragments and test inputs. The main goal of these techniques is to improve and support automation in program synthesis and test input generation. This is important because performin ...

EPFL2015

Joint Speaker Verification and Anti-Spoofing in the i-Vector Space

Sébastien Marcel

Any biometric recognizer is vulnerable to spoofing attacks and hence voice biometric, also called automatic speaker verification (ASV), is no exception; replay, synthesis, and conversion attacks all provoke false acceptances unless countermeasures are used ...

2015

On Synthesizing Code from Free-Form Queries

Viktor Kuncak, Tihomir Gvero

We present a new code assistance tool for integrated development environments. Our system accepts free-form queries allowing a mixture of English and Java as an input, and produces Java code fragments that take the query into account and respect syntax, ty ...

2014

Acoustic and Lexical Resource Constrained ASR using Language-Independent Acoustic Model and Language-Dependent Probabilistic Lexical Model

Ramya Rasipuram

One of the key challenge involved in building a statistical automatic speech recognition (ASR) system is modeling the relationship between lexical units (that are based on subword units in the pronunciation lexicon) and acoustic feature observations. To mo ...

Idiap2014

Articulatory Feature based Continuous Speech Recognition using Probabilistic Lexical Modeling

Ramya Rasipuram

Phonological studies suggest that the typical subword units such as phones or phonemes used in automatic speech recognition systems can be decomposed into a set of features based on the articulators used to produce the sound. Most of the current approaches ...

Idiap2014

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

DynaProg for Scala

Thierry Coppey

Dynamic programming is an algorithmic technique to solve problems that follow the Bellman’s principle: optimal solutions depends on optimal sub-problem solutions. The core idea behind dynamic programming is to memoize intermediate results into matrices to ...

2013

A Variational Framework for Structure from Motion in Omnidirectional Image Sequences

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

We address the problem of depth and ego-motion estimation from omnidirectional images. We propose a correspondence-free structure from motion problem for images mapped on the 2-sphere. A novel graph-based variational framework is proposed for depth estimat ...

Springer Verlag2011

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.