aboutsummaryrefslogtreecommitdiff
path: root/Plan.md
diff options
context:
space:
mode:
authorxPaulienx2017-09-29 11:41:33 +0200
committerGitHub2017-09-29 11:41:33 +0200
commit59fc6107ae33532e573b002ec1e94a21cd37d6eb (patch)
tree53c3e405cdf44927b18424566c4c3c3a9dfff98f /Plan.md
parentMerge branch 'gh-pages' of github.com:rubigdata/IR-2017-4 into gh-pages (diff)
Update Plan.md
Diffstat (limited to 'Plan.md')
-rw-r--r--Plan.md6
1 files changed, 3 insertions, 3 deletions
diff --git a/Plan.md b/Plan.md
index ba5b9b6..30e0e46 100644
--- a/Plan.md
+++ b/Plan.md
@@ -34,9 +34,9 @@ As such, our idea is to use some kind of Hill-Climbing algorithm to determine ju
## Nordlys
Nordlyss is a toolkit for entity-oriented and semantic search. It currently supports four entity-oriented tasks, which could be useful for our project. These entity-oriented tasks are:
- `Entity cataloging`
-- `Entity retrieval`
-- `Entity linking in queries`
-- `Target type identification`
+- `Entity retrieval` Returns a ranked list of entities in response to a query
+- `Entity linking in queries` Identifies entities in a query and links them to the corresponding entry in the Knowledge base
+- `Target type identification` Detects the target types (or categories) of a query
The Nordlys toolkit was used to create the results described above, as such, it provides us with the means to reproduce these results.
In addition, Nordlys provides a Python interface that can be used to implement the Hill Climbing algorithm.