Papers by Jijnasa Nayak
UHop: An Unrestricted-Hop Relation Extraction Framework for Knowledge-Based Question Answering (N19-1)
Copied to clipboard
| Challenge: | Existing work restricts search from one entity to another to the maximum number of hops . a knowledge graph is a powerful graph structure that encodes knowledge to save and organize it . |
| Approach: | They propose an unrestricted-hop framework which relaxes the restriction by using a transition-based search framework. |
| Outcome: | The proposed framework performs well with state-of-the-art models and is competitive without exhaustive searches. |