Concept

Phrase structure grammar

Related publications (20)

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.

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

Concept Maps

Beat Adrian Schwendimann

A concept map is a node-link diagram showing the semantic relationships among concepts. The technique for constructing concept maps is called "concept mapping". A concept map consists of nodes, arrows as linking lines, and linking phrases that describe the ...

Springer2014

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

A Variational Framework for Structure from Motion in Omnidirectional Image Sequences

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

2009

Polarity of chordal graphs

Dominique de Werra, Tinaz Ekim

Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NP-complete to decide for general graphs. It has been recently proved that for cographs, th ...

2008

Concrete syntax definition for modeling languages

Frédéric Fondement

Model Driven Engineering (MDE) promotes the use of models as primary artefacts of a software development process, as an attempt to handle complexity through abstraction, e.g. to cope with the evolution of execution platforms. MDE follows a stepwise approac ...

EPFL2007

Efficient integration of automated speech recognition in the framework of dialogue-based vocal systems

In this work, we propose different strategies for efficiently integrating an automated speech recognition module in the framework of a dialogue-based vocal system. The aim is the study of different ways leading to the improvement of the quality and robustn ...

EPFL2005

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

Robustness in Variogram Estimation

In this paper we consider several estimators for the variogram: the classical estimator due to Matheron, a robust estimator proposed by Cressie & Hawkins, and two highly robust estimators introduced by Rousseeuw in the context of scale estimation. It will ...

1995

Symbolic Proof of CTL Formulae over Petri Nets

We present a method for proving properties of Petri nets expressed in the branching time temporal logic CTL. The framework of CTL formulae, viewed through the notions of predicates and predicate transformers in the context of Petri nets, is also presented. ...

1993