Discussion | Sentences like this have very long (and thus rare) lexical features, but relatively short dependency paths . |
Features | For each sentence we extract a dependency path between each pair of entities. |
Features | A dependency path consists of a series of dependencies, directions and words/chunks representing a traversal of the parse. |
Features | Part-of-speech tags are not included in the dependency path . |
Pattern Combination Method for Relation Extraction | We define dependency patterns as sub-paths of the shortest dependency path between a concept pair for two reasons. |
Pattern Combination Method for Relation Extraction | Shortest dependency path inducement. |
Pattern Combination Method for Relation Extraction | From the original dependency tree structure by parsing the selected sentence for each concept pair, we first induce the shortest dependency path with the entitled concept and related concept. |