Ideally, what one then wants is to learn a function h : where X E n is the domain of instances representing a collection of EDUs for each dialogue and Y G is the set of all possible SDRT graphs.
given the complexity of this task and the fact that it would require an amount of training data that we currently lack in the community, we aim at the more modest goal of learning a function where the domain of instances X E 2 represents features for a pair of EDUs and Y R represents the set of SDRT relations.