Difference between revisions of "Who is It? Context Sensitive Named Entity and Instance Recognition by Means of Wikipedia"
(Who is It? Context Sensitive Named Entity and Instance Recognition by Means of Wikipedia - creating a new article) |
(Adding wikilinks) |
||
| Line 1: | Line 1: | ||
| − | '''Who is It? Context Sensitive Named Entity and Instance Recognition by Means of Wikipedia''' - scientific work related to Wikipedia quality published in 2008, written by Ulli Waltinger and Alexander Mehler. | + | '''Who is It? Context Sensitive Named Entity and Instance Recognition by Means of Wikipedia''' - scientific work related to [[Wikipedia quality]] published in 2008, written by [[Ulli Waltinger]] and [[Alexander Mehler]]. |
== Overview == | == Overview == | ||
This paper presents an approach for predicting context sensitive entities exemplified in the domain of person names. Authors approach is based on building a weighted context but also a weighted people graph and predicting the context entity by extracting the best fitting sub graph using a spreading activation technique. The results of the experiments show a quite promising F-Measure of 0.99. | This paper presents an approach for predicting context sensitive entities exemplified in the domain of person names. Authors approach is based on building a weighted context but also a weighted people graph and predicting the context entity by extracting the best fitting sub graph using a spreading activation technique. The results of the experiments show a quite promising F-Measure of 0.99. | ||
Revision as of 11:15, 30 June 2019
Who is It? Context Sensitive Named Entity and Instance Recognition by Means of Wikipedia - scientific work related to Wikipedia quality published in 2008, written by Ulli Waltinger and Alexander Mehler.
Overview
This paper presents an approach for predicting context sensitive entities exemplified in the domain of person names. Authors approach is based on building a weighted context but also a weighted people graph and predicting the context entity by extracting the best fitting sub graph using a spreading activation technique. The results of the experiments show a quite promising F-Measure of 0.99.
