Labelled network subgraphs reveal stylistic subtleties in written texts
نویسندگان
چکیده
منابع مشابه
Labelled network subgraphs reveal stylistic subtleties in written texts
The vast amount of data and increase of computational capacity have allowed the analysis of texts from several perspectives, including the representation of texts as complex networks. Nodes of the network represent the words, and edges represent some relationship, usually word co-occurrence. Even though networked representations have been applied to study some tasks, such approaches are not usu...
متن کاملNetwork analysis of named entity interactions in written texts
The use of methods borrowed from statistics and physics has allowed for the discovery of unprecedent patterns of human behavior and cognition by establishing links between models features and language structure. While current models have been useful to identify patterns via analysis of syntactical and semantical networks, only a few works have probed the relevance of investigating the structure...
متن کاملAutomatic Structuring of Written Texts
This paper deals with automatic structuring and sentence boundary labelling in natural language texts. We describe the implemented structure tagging algorithm and heuristic rules that are used for automatic or semiautomatic labelling. Inside the detected sentence the algorithm performs a decomposition to clauses and then marks the parts of text which do not form a sentence, i.e. headings, signa...
متن کاملLiterary Texts and Teaching of Language : A Pedagogic- Stylistic Approach
This paper might be described as an attempt to discuss a practical methodology based on Pedagogic Stylistic approach for the teaching of literature as subject in undergraduate /Post graduate classes in India. It is also significant that we need to examine how a stylistic approach for the teaching of literature is of particular value for the study of literature as a subject in India's ESL situat...
متن کاملA note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . . , n − 1}. Each edge (the straight segment that joins two points) is labelled with the sum of the labels of its endpoints. In this note we investigate the maximum size of noncrossing matchings and paths on S, under the requirement that no two edges have the same weight.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2017
ISSN: 2051-1310,2051-1329
DOI: 10.1093/comnet/cnx047