A shortest path dependency kernel for relation extraction
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
| Hi-index | 0.00 |
The application of the operations of the grammar in the computational space provides the geometrical basis (phrase marker) upon which paths in natural language configurations can be identified. A path between two nodes in a phrase marker provides a measure of the trajectory of a moved constituent and the distance between bound elements. I propose that the properties of paths in phrase markers are determined by interface conditions (Full Interpretation) and Economy. The Minimal Path reduces derivational complexity and contributes to make complex systems such as natural languages usable by humans.