Authorship Attribution through Function Word Adjacency Networks

Abstract

A method for authorship attribution based on function word adjacency networks (WANs) is introduced. Function words are parts of speech that express grammatical relationships between other words but do not carry lexical meaning on their own. In the WANs in this paper, nodes are function words and directed edges stand in for the likelihood of finding the sink word in the ordered vicinity of the source word. WANs of different authors can be interpreted as transition probabilities of a Markov chain and are therefore compared in terms of their relative entropies. Optimal selection of WAN parameters is studied and attribution accuracy is benchmarked across a diverse pool of authors and varying text lengths. This analysis shows that, since function words are independent of content, their use tends to be specific to an author and that the relational data captured by function WANs is a good summary of stylometric fingerprints. Attribution accuracy is observed to exceed the one achieved by methods that rely on word frequencies alone. Further combining WANs with methods that rely on word frequencies alone, results in larger attribution accuracy, indicating that both sources of information encode different aspects of authorial styles.

Cited by in corpus (15)

• Convolutional Neural Network Architectures for Signals Supported on Graphs
• Word sense disambiguation: a complex network approach
• Invariance-Preserving Localized Activation Functions for Graph Neural Networks
• Using word embeddings to improve the discriminability of co-occurrence text networks
• Authorship Attribution Based on Life-Like Network Automata
• Paragraph-based complex networks: application to document classification and authenticity verification
• On the role of words in the network structure of texts: application to authorship attribution
• Stability of Graph Scattering Transforms
• Representation of texts as complex networks: a mesoscopic approach
• Semantic flow in language networks
• Sampling random graph homomorphisms and applications to network data analysis
• An Image Analysis Approach to the Calligraphy of Books
• Language Networks: a Practical Approach
• Average shortest-path length in word-adjacency networks: Chinese versus English
• A Linear-complexity Multi-biometric Forensic Document Analysis System, by Fusing the Stylome and Signature Modalities