bigram.network: Network graph of most frequent bigrams found throughout the...

In JSmith146/CoRpEx: CorpEx is Designed for the Exploration and Mining of Large Textual Corpuses of Documents

Description

This function visualizes the most frequent words that co-occur throughout a corpus.

Usage

bigram.network(data.td, freq)

Arguments

data.td	A tidy dataset
freq	A user defined numeric vector containing an user defined limit of most frequent bigrams to include

Details

This function identifies all of the bigrams (two word co-occurrences in a sequence of text) in a corpus, sums the frequency of occurrence for each bigram, and sorts the list in descending order. The function then generates an undirected network graph connecting each word (node) in the bigram. These words are connected by edges (lines) whose thickness varies based on the frequency of occurrence for each bigram.

Value

A network graph of the most frequent bigrams down to a user defined freq

Examples

bigram.network(Articles, 200)

JSmith146/CoRpEx documentation built on May 17, 2019, 10:11 p.m.