File:Almost-fully-connected-weighted-directed-graph-for-edmonds-algorithm-input-German-Momo-waves-Beppo.svg
Summary
| Description |
English: Almost fully connected edge-weighted directed graph with words from the German sentence „Momo winkt Beppo“ (Momo waves Beppo) as nodes plus a special root node.
Inspired by the English example (John saw Mary) in section 2.2.1 on page 526 from McDonald, Pereira, Ribarov, Hajič (2005) Non-Projective Dependency Parsing using Spanning Tree Algorithms. HLT-EMNLP 2005. https://aclanthology.org/H05-1066.pdf where it is used as an example input to the Chu-Liu-Edmonds-Algorithm and to illustrate graph-based syntactic dependency parsing. |
| Date | |
| Source | Own work |
| Author | PlusMinuscule |
The file has been generated using LaTeX and TikZ.
The depicted graph contains 9 edges and corresponds to the following set of (start node, edge weight, end node) triples:
(root, 5, Momo), (root, 10, winkt), (root, 5, Beppo), (winkt, 25, Momo), (winkt, 25, Beppo), (Momo, 11, winkt), (Momo, 2, Beppo), (Beppo, 3, winkt), (Beppo, 7, Momo)
Related to: File:Example-after-edmonds-algorithm-spanning-aborescene-German-Momo-waves-Beppo-dependency-tree-edgescored.svg showing the graph after the Chu-Liu-Edmonds-Algorithm (note that in this example, it is about the maximum spanning tree, not the minimum spanning tree).
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
