Concept
Probabilistic context-free grammar
Related publications (49)
Harmonic Syntax in Time: Rhythm Improves Grammatical Models of Harmony
Martin Alois Rohrmeier, Daniel Harasim
Music is hierarchically structured, both in how it is perceived by listeners and how it is composed. Such structure can be elegantly captured using probabilistic grammatical models similar to those used to study natural language. They address the complexit ...
ISMIR2019Segment-level training of ANNs based on acoustic confidence measures for hybrid HMM/ANN Speech Recognition
Subrahmanya Pavankumar Dubagunta
We show that confidence measures estimated from local posterior probabilities can serve as objective functions for training ANNs in hybrid HMM based speech recognition systems. This leads to a segment-level training paradigm that overcomes the limitation o ...
IEEE2019A comparison of network embedding approaches
Thành Tâm Nguyên, Chi Thang Duong
Network embedding automatically learns to encode a graph into multi-dimensional vectors. The embedded representation appears to outperform hand-crafted features in many downstream machine learning tasks. There are a plethora of network embedding approaches ...
2018Visualization, Adaptation, and Transformation of Procedural Grammars
Procedural shape grammars are powerful tools for the automatic generation of highly detailed 3D content from a set of descriptive rules. It is easy to encode variations in stochastic and parametric grammars, and an uncountable number of models can be gener ...
EPFL2017Annotated References in the Historiography on Venice: 19th–21st centuries
Matteo Romanello, Giovanni Colavizza
We publish a dataset containing more than 40’000 manually annotated references from a broad corpus of books and journal articles on the history of Venice. References were considered from both reference lists and footnotes, include primary and secondary sou ...
2017Articulatory feature based continuous speech recognition using probabilistic lexical modeling
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 ...
Elsevier2016Automating 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 ...
2015Automating 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 ...
Assoc Computing Machinery2015Towards 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 ...
2015Interactive Synthesis using Free-Form Queries
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 ...
2015