A frustratingly easy way of extracting political networks from text.
This study demonstrates the use of GPT-4 and variants, advanced language models readily accessible to many social scientists, in extracting political networks from text. This approach showcases the novel integration of GPT-4's capabilities in entity recognition, relation extraction, entity link...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2025-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://doi.org/10.1371/journal.pone.0313149 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832540207967109120 |
|---|---|
| author | Naim Bro |
| author_facet | Naim Bro |
| author_sort | Naim Bro |
| collection | DOAJ |
| description | This study demonstrates the use of GPT-4 and variants, advanced language models readily accessible to many social scientists, in extracting political networks from text. This approach showcases the novel integration of GPT-4's capabilities in entity recognition, relation extraction, entity linking, and sentiment analysis into a single cohesive process. Based on a corpus of 1009 Chilean political news articles, the study validates the graph extraction method using 'legislative agreement', i.e., the proportion of times two politicians vote the same way. It finds that sentiments identified by GPT-4 align with how frequently parliamentarians vote together in roll calls. Comprising two parts, the first involves a linear regression analysis indicating that negative relationships predicted by GPT-4 correspond with reduced legislative agreement between two parliamentarians. The second part employs node embeddings to analyze the impact of network distance, considering both with and without sentiment, on legislative agreements. This analysis reveals a notably stronger predictive power when sentiments are included. The findings underscore GPT-4's versatility in political network analysis. |
| format | Article |
| id | doaj-art-c0f3ca1a892b40358be9466a1ffc7ef4 |
| institution | Kabale University |
| issn | 1932-6203 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj-art-c0f3ca1a892b40358be9466a1ffc7ef42025-02-05T05:32:06ZengPublic Library of Science (PLoS)PLoS ONE1932-62032025-01-01201e031314910.1371/journal.pone.0313149A frustratingly easy way of extracting political networks from text.Naim BroThis study demonstrates the use of GPT-4 and variants, advanced language models readily accessible to many social scientists, in extracting political networks from text. This approach showcases the novel integration of GPT-4's capabilities in entity recognition, relation extraction, entity linking, and sentiment analysis into a single cohesive process. Based on a corpus of 1009 Chilean political news articles, the study validates the graph extraction method using 'legislative agreement', i.e., the proportion of times two politicians vote the same way. It finds that sentiments identified by GPT-4 align with how frequently parliamentarians vote together in roll calls. Comprising two parts, the first involves a linear regression analysis indicating that negative relationships predicted by GPT-4 correspond with reduced legislative agreement between two parliamentarians. The second part employs node embeddings to analyze the impact of network distance, considering both with and without sentiment, on legislative agreements. This analysis reveals a notably stronger predictive power when sentiments are included. The findings underscore GPT-4's versatility in political network analysis.https://doi.org/10.1371/journal.pone.0313149 |
| spellingShingle | Naim Bro A frustratingly easy way of extracting political networks from text. PLoS ONE |
| title | A frustratingly easy way of extracting political networks from text. |
| title_full | A frustratingly easy way of extracting political networks from text. |
| title_fullStr | A frustratingly easy way of extracting political networks from text. |
| title_full_unstemmed | A frustratingly easy way of extracting political networks from text. |
| title_short | A frustratingly easy way of extracting political networks from text. |
| title_sort | frustratingly easy way of extracting political networks from text |
| url | https://doi.org/10.1371/journal.pone.0313149 |
| work_keys_str_mv | AT naimbro afrustratinglyeasywayofextractingpoliticalnetworksfromtext AT naimbro frustratinglyeasywayofextractingpoliticalnetworksfromtext |