In questo lavoro illustriamo un metodo matematico per affrontare iproblemi di attribuzione di autore, sviluppato in vista della nuova "Edizione Nazionale degli scritti di Antonio Gramsci". Il metodo è basato su alcune importanti idee della matematica moderna, che offrono interessanti prospettive nell'analisi dei testi.
Referenze Bibliografiche
[1]
C. BASILE -
D. BENEDETTO -
E. CAGLIOTI -
M. DEGLI ESPOSTI,
An example of mathematical authorship attribution,
Journal of Mathematical Physics,
49, 1-20 (
2008). |
fulltext (doi) |
MR 2484342 |
Zbl 1159.81302[2] D. BENEDETTO - E. CAGLIOTI - V. LORETO, Language Trees and Zipping, Phys. Rev. Lett. 88, n. 4, 048702-1, 048702-4 (2002).
[3] W. R. BENNETT, Scientific and engineering problem-solving with the computer, Prentice-Hall, Inc. Englewood Cliffs, New Jersey (1976).
[4] L. L. CAVALLI-SFORZA - P. MENOZZI - A. PIAZZA, Storia e geografia dei geni umani, Milano, Adelphi 2000.
[5] R. CLEMENT - D. SHARP, Ngram and Bayesian Classification of Documents for Topic and Authorship, Lit. Ling. Comp. 18, n. 4 423 (2003).
[6] A. DE MORGAN, in Memoirs of Augustus de Morgan by his wife Sophia Elizabeth de Morgan with Selections from his Letters, (Longman's Green and Co., London, 1851/1882).
[7] P. GRASSBERGER, Data compression and entropy estimates by non-sequential recursive pair substitution, ArXiv:physics/0207023
[8] J. W. GRIEVE, Quantitative Authorship Attribution: a History and an Evaluation of Techniques. http://hdl.handle.net/1892/2055, Lit. Ling. Comp. 22, 251 (2007).
[9] P. JUOLA, Cross-entropy and linguistic typology, Proceeding of New Methods in Language Processing 3, Sidney, 1998.
[10] P. JUOLA, Authorship Attribution, Foundations and Trends in Information Retrieval, vol. 1, no. 3, 233-334 (2006).
[11]
D. V. KHMELEV -
O. V. KUKUSHKINA -
A. A. POLIKARPOV -
D. V. KHMELEV,
Using literal and grammatical statistics for authorship attribution,
Problemy Peredachi Informatsii,
37 (2),
2000, pagg. 96-108, translated in English in
Problems of Information Transmission,
37 (
2001) 172-184. |
fulltext (doi) |
MR 2099901 |
Zbl 1008.62118[12] V. KESELJ - F. PENG - N. CERCONE - C. THOMAS, N-gram-based Author Profiles for Authorship Attribution, Proceedings of the Conference Pacific Association for Computational Linguistics, PACLING'03, Dalhousie University, Halifax, Nova Scotia, Canada, August 2003, pagg. 255-264.
[13] V. KESELJ - N. CERCONE, CNG Method with Weighted Voting Ad-hoc Authorship Attribution Competition (AAAC), June 2004. Part of ALLC/ACH 2004 conference.
[14] D. V. KHMELEV - F. J. TWEEDIE, Using Markov Chains for Identification of Writers, Lit. Ling. Comp. 16, 3: 299-307 (2001).
[15] A. A. MARKOV, Primer statisticheskogo issledovanija nad tekstom "Evgenija Onegina" illjustrirujuschij svjaz' ispytanij v tsep. (An example of statistical study on the text of "Eugene Onegin" illustrating the linking of events to a chain.), Izvestija Imp. Akademii nauk VI, 153-162 (1913).
[16] A. A. MARKOV, Ob odnom primeneni statisticheskogo metoda. (On some application of statistical method), Izvestija Imp. Akademii nauk serija VI, 4: 239-42 (1916).
[17] T. C. MENDENHALL, The characteristic curves of composition, Science, vol. IX, 237-249 (1887).
[18] J. R. PIERCE, La Teoria dell'Informazione, Milano, Mondadori, 1963.
[19]
A. PUGLISI -
D. BENEDETTO -
E. CAGLIOTI -
V. LORETO -
A. VULPIANI,
Data compression and learning in time sequences analysis,
Phys. D 180, no. 1-2, 92-107 (
2003). |
fulltext (doi) |
MR 1984306 |
Zbl 1094.68567[20]
C. E. SHANNON,
A Mathematical Theory of Communication,
The Bell System Technical Journal 27,
1948, p. 623. |
fulltext (doi) |
MR 26286[21] W. J. TEAHAN, Text classification and segmentation using minimum cross-entropy, Proceedings of the International Conference on Content-based Multimedia Information Access (RIAO 2000), pages 943-961. C.I.D.-C.A.S.I.S, Paris, 2000.
[22] I. H. WITTEN - A. MOFFAT - T. C. BELL, Managing Gigabytes, second edition, Morgan Kaufmann Publishers, 1999.
[23] A. D. WYNER, Typical sequences and all that: Entropy, Pattern Matching and Data Compression, 1994 Shannon Lecture, IEEE Information Theory Society Newsletter, July 1995.
[24]
J. ZIV -
A. LEMPEL,
A universal algorithm for sequential data compression,
IEEE Transactions on Information Theory, IT-
23 no. 3, pagg. 337-343 (
1977). |
fulltext (doi) |
MR 530215 |
Zbl 0379.94010[25]
J. ZIV -
N. MERHAV,
A measure of relative entropy between individual sequences with application to universal classification,
IEEE Transactions of Information Theory,
39 (4),
1993, pagg. 1270-1279. |
fulltext (doi) |
MR 1267157 |
Zbl 0801.94004
Con il contributo del Ministero per i Beni e le Attività Culturali