ArneBinder

Descriptions:

• Relations type: typed dictionary with sources (list of source node ids), targets (list of target node ids), and relation (relation node id)
• get_relations method that returns all Relations for a certain relation_type (either S, TA, or YA). We use the following constraints (format: REL-NODE-TYPES: SRC-TYPES -> TRG-TYPES):
  • TA: [TA]: [L] -> [L]
  • S: [RA, CA, MA]: [I] -> [I]
  • YA: [YA]: [L, TA] -> [I, L, RA, CA, MA] (Note: relations L -> YA -> L encode (in-)direct speech)
• get_relation_statistics: collect the following statistics for a given nodeset by using get_relations:
  • "missed_edges": A list of edges not participating in any of the above relations, format: nodeset_id node_src:node_trg src_type:trg_type
  • "covered_edges": The number of covered edges, int.
• "empty_sources": A list of relations with no source nodes when following above constraints, format: nodeset_id node_id node_type

ArneBinder

Notes:

• we consider relation_nodes as nodes with the following types: TA, S (={MA, RA, CA}), and YA (Illocutionary connections)
• we create relations (source_node, target_node, relation_node) as all triples of nodes where edges (source_node, relation_node) and (relation_node, target_node) exist
• we filter relations by "allowed" argument types (according to the IAT annotation guidelines) to construct the table:

relation_type2arg_types = {
    "TA": [("L", "L")],
    "S": [("I", "I")],
    "YA": [("L", "I"), ("TA", "S"), ("TA", "I")],
}

ArneBinder

ArneBinder

Keybase proof

I hereby claim:

• I am arnebinder on github.
• I am arnebinder (https://keybase.io/arnebinder) on keybase.
• I have a public key ASCwFs0mI2BCoecHZzg_D-MnmywQavQrdiy5kbuQQkxRMAo

To claim this, I am signing this object: