Author
Listed:
- Monica Patrut
("Vasile Alecsandri" University of Bacau, Romania)
- Bogdan Patrut
("Vasile Alecsandri" University of Bacau, Romania)
- Camelia Cmeciu
("Danubius" University of Galati, Romania)
Abstract
In this article, we show how, using graph theory, we can make a content analysis of political discourse. Assumptions of this analysis are: • we have a corpus of speech of each party or candidate; • we consider that speech conveys economic, political, socio-cultural values, these taking the form of words or word families; • we consider that there are interdependences between the values of a political discourse; they are given by the co-occurrence of two values, as words in the text, within a well defined fragment, or they are determined by the internal logic of political discourse; • established links between values in a political speech have associated positive numbers indicating the "power" of those links; these "powers" are defined according to both the number of co-occurrences of values, and the internal logic of the discourse where they occur. In this context we intend to highlight the following: a) which is the dominant value in a political speech; b) which groups of values have ties between them and have no connection with the rest; c) which is the order in which political values should be set in order to obtain an equivalent but more synthetic speech compared to the already given one; d) which are the links between values that form the "core" political speech. To solve these problems, we shall use the Political Analyst program. After that, we shall present the concepts necessary to the understanding of the introductory graph theory, useful in understanding the analysis of the software and then the operation of the program. This paper extends the previous paper [6]
Suggested Citation
Monica Patrut & Bogdan Patrut & Camelia Cmeciu, 2010.
"Political Discourse Analysis through Solving Problems of Graph Theory,"
BRAND. Broad Research in Accounting, Negotiation, and Distribution, EduSoft Publishing, vol. 1(1), pages 35-51, September.
Handle:
RePEc:bra:journl:v:1:y:2010:i:1:p:35-51
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bra:journl:v:1:y:2010:i:1:p:35-51. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Bogdan Patrut (email available below). General contact details of provider: http://brand.edusoft.ro .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.