{"id":9901,"date":"2012-12-18T08:30:36","date_gmt":"2012-12-18T13:30:36","guid":{"rendered":"http:\/\/mith.umd.edu\/?p=9901"},"modified":"2020-10-08T16:00:49","modified_gmt":"2020-10-08T20:00:49","slug":"asking-questions-of-lots-of-text-with-weka","status":"publish","type":"post","link":"https:\/\/mith.umd.edu\/asking-questions-of-lots-of-text-with-weka\/","title":{"rendered":"Asking Questions of Lots of Text with Weka"},"content":{"rendered":"

Adrian Hamins-Puertolas and Adam Elrafei are students in Team POLITIC<\/a>, an undergraduate research team in the University of Maryland\u2019s GEMSTONE honors research-focused honors college, mentored by MITH Faculty Fellow Peter Mallios.<\/em><\/p>\n

Our undergraduate research team uses newly developed technology to understand and quantify how American audiences received Russian authors in the early 1920s. One of the tools we\u2019re exploring is Weka, a collection of machine-learning algorithms that can be used to mine data-sets. MITH has helped us design and construct our database, which contains thousands of articles about Russian authors featured in American literary magazines written during the 1920s). Each article in the database is associated with values indicating the frequency of words in the text, so we can trace how often a single word (unigram) like \u201crevolution\u201d appears throughout our articles, or how often two words appear next to each other (a bigram), such as \u201cRussian revolution\u201d. Both these features offer us paths to think about our dataset in terms of describing and quantifying word proximity.<\/p>\n

MITH’s Travis Brown demonstrated how we could use Weka to train a machine learning classifier that could assign labels to articles in the dataset we had not ever read. To test this, we created a smaller training dataset of just 150 articles, a number small enough that we could actually read through the entire texts and manually describe by answering questions ranging from \u201cIs a given literary author a subject of debate in this article?\u201d to \u201cIs radical politics an issue in the article?\u201d. Given these measures, Weka has the ability to classify every other article in our dataset with some degree of accuracy.<\/p>\n

Weka provided us with a decision tree that classifies answers to the question \u201cIs literary style and artistry an issue in this article\u201d appropriately for approximately 67% of our training set. This success rate can be improved as we add new measures for classifying and quantifying the text. One direction we can go is to attempt to use MALLET\u2014\u201can integrated collection of Java code useful for statistical natural language processing

[and] document classification\u201d\u2014in order to create topics\u2014groups of words that MALLET finds to be significantly thematically related. Topic modeling is fascinating because a preliminary examination of generated topics has already provided us with a variety of distinct themes and vocabulary appearing in our dataset, ranging from religion to specific Russian authors. We\u2019re in the process of running Weka\u2019s classification system on those generated topics that include religious language in order to answer another of our questions\u2014\u201dIs religion an issue in the article?\u201d.<\/p>\n

Our current Weka experiments, using a smaller training set of 46 articles, have already acquired promising results. For example, when using the J48 decision tree algorithm on our textual data filtered into unigrams, Weka correctly classifies 76% of our documents when answering the \u201cIs politics an issue?\u201d question. If we filter our data into both unigrams and bigrams, the correct classification rate decreases to 67%. However, if we filter our data into unigrams and apply a stemmer (which breaks down words into their root forms and ignores prefixes and suffixes), our correct classification rate increases to 77%.<\/p>\n

We are looking forward to expanding our experiments to apply to an even larger subset of our data, as we continue to learn more about natural language processing tools in the coming weeks.

<\/div><\/div><\/div><\/div>