Publications associées à Combinateur d'analyseurs

Interpreting Rhythm as Parsing: Syntactic-Processing Operations Predict the Migration of Visual Flashes as Perceived During Listening to Musical Rhythms

Martin Alois Rohrmeier, Steffen Alexander Herff, Gabriele Cecchetti

Music can be interpreted by attributing syntactic relationships to sequential musical events, and, computationally, such musical interpretation represents an analogous combinatorial task to syntactic processing in language. While this perspective has been ...

Hoboken2023

Musical Garden Paths: Evidence for Syntactic Revision Beyond the Linguistic Domain

Martin Alois Rohrmeier, Steffen Alexander Herff, Gabriele Cecchetti

While theoretical and empirical insights suggest that the capacity to represent and process complex syntax is crucial in language as well as other domains, it is still unclear whether specific parsing mechanisms are also shared across domains. Focusing on ...

Wiley2022

Uniform parsing for hyperedge replacement grammars

Petter Harald Ericson

It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even under seemingly harsh restrictions. This means that the parsing problem is difficult even in the non-uniform setting, in which the grammar is considered to b ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

Gramatron: Effective Grammar-Aware Fuzzing

Mathias Josef Payer

Fuzzers aware of the input grammar can explore deeper program states using grammar-aware mutations. Existing grammar-aware fuzzers are ineffective at synthesizing complex bug triggers due to: (i) grammars introducing a sampling bias during input generation ...

ASSOC COMPUTING MACHINERY2021

Neural Parts: Learning Expressive 3D Shape Abstractions with Invertible Neural Networks

Angelos Katharopoulos, Andreas Geiger, Despoina Paschalidou

Impressive progress in 3D shape extraction led to representations that can capture object geometries with high fidelity. In parallel, primitive-based methods seek to represent objects as semantically consistent part arrangements. However, due to the simpli ...

IEEE COMPUTER SOC2021

Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement

James Henderson, Alireza Mohammadshahi

We propose the Recursive Non-autoregressive Graph-to-graph Transformer architecture (RNG-Tr) for the iterative refinement of arbitrary graphs through the recursive application of a non-autoregressive Graph-to-Graph Transformer and apply it to syntactic dep ...

2020

LMS-Verify: Abstraction without Regret for Verified Systems Programming’

Tiark Rompf, Nada Amin

Performance critical software is almost always developed in C, as programmers do not trust high-level languages to deliver the same reliable performance. This is bad because low-level code in unsafe languages attracts security vulnerabilities and because d ...

Assoc Computing Machinery2017

The SUMMA Platform Prototype

Hervé Bourlard, Philip Neil Garner, Andrei Popescu-Belis, Nikolaos Pappas, Sibo Tong, Yang Wang, Ahmed Ali, Steve Renals, Lesly Sadiht Miculicich Werlen, Marco Damonte, Hassan Sajjad

We present the first prototype of the SUMMA Platform: an integrated platform for multilingual media monitoring. The platform contains a rich suite of low-level and high-level natural language processing technologies: automatic speech recognition of broadca ...

Association for Computational Linguistics2017

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.

Combinateur d'analyseurs

Hearing structure in music: An empirical inquiry into listening as representation and processing

Interpreting Rhythm as Parsing: Syntactic-Processing Operations Predict the Migration of Visual Flashes as Perceived During Listening to Musical Rhythms

Musical Garden Paths: Evidence for Syntactic Revision Beyond the Linguistic Domain

Uniform parsing for hyperedge replacement grammars

Efficient Parsing with Derivatives and Zippers

Gramatron: Effective Grammar-Aware Fuzzing

Neural Parts: Learning Expressive 3D Shape Abstractions with Invertible Neural Networks

Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement

LMS-Verify: Abstraction without Regret for Verified Systems Programming’

The SUMMA Platform Prototype

Graph Chatbot

Chattez avec Graph Search

Neural Parts: Learning Expressive 3D Shape Abstractions with Invertible Neural Networks

Interpreting Rhythm as Parsing: Syntactic-Processing Operations Predict the Migration of Visual Flashes as Perceived During Listening to Musical Rhythms

Musical Garden Paths: Evidence for Syntactic Revision Beyond the Linguistic Domain

Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement

The SUMMA Platform Prototype

LMS-Verify: Abstraction without Regret for Verified Systems Programming’

Uniform parsing for hyperedge replacement grammars

Efficient Parsing with Derivatives and Zippers

Gramatron: Effective Grammar-Aware Fuzzing

Hearing structure in music: An empirical inquiry into listening as representation and processing