Dependency Parse

digraph dep {
  rankdir=LR;
  graph [bgcolor=transparent];
  node [shape=plain, fontname=Inter, fontsize=11];
  edge [fontname=Inter, fontsize=9];

  ROOT [label="ROOT"];
  presented [label="presented (V)"];
  scientist [label="scientist (N)"];
  The [label="The (DET)"];
  paper [label="paper (N)"];
  a [label="a (DET)"];
  conference [label="conference (N)"];
  the [label="the (DET)"];
  at [label="at (P)"];

  ROOT -> presented [label="root"];
  presented -> scientist [label="nsubj"];
  scientist -> The [label="det"];
  presented -> paper [label="obj"];
  paper -> a [label="det"];
  presented -> conference [label="obl"];
  conference -> at [label="case"];
  conference -> the [label="det"];
}