Concept

Parse tree

Related publications (33)

Word Sequence Modeling using Deep Learning

For a long time, natural language processing (NLP) has relied on generative models with task specific and manually engineered features. Recently, there has been a resurgence of interest for neural networks in the machine learning community, obtaining state ...

EPFL2016

A TASTY Alternative

Martin Odersky, Eugene Burmako, Dmytro Petrashko

This document proposes a new serialization format for typed syntax trees of Scala programs. It aims to be ● compact: All numbers and references are length encoded, trees are inlined by default but may be shared. ● lazy: Trees can be explored from the top, ...

2016

Automating Grammar Comparison

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

We consider from a practical perspective the problem of checking equivalence of context-free grammars. We present techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalence. Among the key building ...

2015

Automating Grammar Comparison

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

Assoc Computing Machinery2015

Towards Automating Grammar Equivalence Checking

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

We consider from practical perspective the (generally undecidable) problem of checking equivalence of context-free grammars. We present both techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalen ...

2015

Scala AST Persistence

Adrien Ghosn, Eugene Burmako, Mathieu Baptiste Demarne

The Scala compiler uses ASTs (abstract syntax trees) as an intermediate representation before generating bytecode. With the development of Scala macros which expand trees at compile time, being able to access, modify and recompose ASTs within the compilati ...

2014

Cyme: A Library Maximizing SIMD Computation on User-Defined Containers

Felix Schürmann, Timothée Ewart

This paper presents Cyme, a C++ library aiming at abstracting the usage of SIMD instructions while maximizing the usage of the underlying hardware. Unlike similar efforts such as Boost.simd or VC, Cyme provides generic high level containers to the users wh ...

Springer International Publishing2014

Towards a standard for dialogue act annotation

Andrei Popescu-Belis

This paper describes an ISO project which aims at developing a standard for annotating spoken and multimodal dialogue with semantic information concerning the communicative functions of utterances, the kind of semantic content they address, and their relat ...

2010

Distributed top-k aggregation queries at large

Sebastian Michel

Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a central issue, especially for distributed settings, when the data is spread across different nodes in a network. This paper intr ...

2009

Correctly defined concrete syntax

Due to their complexity, the syntax of modern modeling languages is preferably defined in two steps. The abstract syntax identifies all modeling concepts whereas the concrete syntax should clarify how these concepts are rendered by graphical and/or textual ...

Springer-Verlag2008

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.