| Evaluation Methodology | Figure 5: Dependency path |
| Evaluation Methodology | From this dependency tree, we can extract a dependency path shown in Figure 5, which appears to be a strong clue in knowing that these proteins are mentioned as interacting. |
| Evaluation Methodology | Figure 6: Tree representation of a dependency path |
| A Sentence Trimmer with CRFs | We begin by locating terminal nodes, i.e., those which have no incoming edges, depicted as filled circles in Figure 3, and find a dependency (singly linked) path from each terminal node to the root, or a node labeled ‘E’ here, which would give us two paths p1 = ACDE and p2 = BCDE (call them terminating dependency paths , or TDPs). |
| Introduction | Later in the paper, we will introduce an approach called the ‘Dependency Path Model’ (DPM) from the previous literature (Section 4), which purports to provide a robust framework for sentence compres- |
| The Dependency Path Model | In what follows, we will describe somewhat in detail a prior approach to sentence compression in Japanese which we call the ”dependency path model,” or DPM. |
| The Dependency Path Model | Dependency path length (DL) refers to the number of (singly linked) dependency relations (or edges) that span two bunsetsa’s. |