Kocher, M.; Savoy, J.: ¬A simple and efficient algorithm for authorship verification (2017)
0.00
0.0026849252 = product of:
0.0053698504 = sum of:
0.0053698504 = product of:
0.010739701 = sum of:
0.010739701 = weight(_text_:a in 3330) [ClassicSimilarity], result of:
0.010739701 = score(doc=3330,freq=14.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.20223314 = fieldWeight in 3330, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=3330)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- This paper describes and evaluates an unsupervised and effective authorship verification model called Spatium-L1. As features, we suggest using the 200 most frequent terms of the disputed text (isolated words and punctuation symbols). Applying a simple distance measure and a set of impostors, we can determine whether or not the disputed text was written by the proposed author. Moreover, based on a simple rule we can define when there is enough evidence to propose an answer or when the attribution scheme is unable to make a decision with a high degree of certainty. Evaluations based on 6 test collections (PAN CLEF 2014 evaluation campaign) indicate that Spatium-L1 usually appears in the top 3 best verification systems, and on an aggregate measure, presents the best performance. The suggested strategy can be adapted without any problem to different Indo-European languages (such as English, Dutch, Spanish, and Greek) or genres (essay, novel, review, and newspaper article).
- Type
- a
