View source for WNA

'''Word-Network Analysis''' ('''WNA''') extracts a network from a text by interpreting the text as a chain of words and connecting ''relevant'' words within a certain ''interval''.

Consider the following text example and take a closer look at the WNA procedure.
<blockquote> The two planes crashed into the towers of the World Trade Center in New York </blockquote>
First of all the WNA identifies the relevant words of the text. This preprocessing step includes:
<ul><dd>
<li> [http://en.wikipedia.org/wiki/Stemming Stemming]
<li> Filtering words with a length less than a preset word length
<li> Filtering [http://en.wikipedia.org/wiki/Stop_words stop words]
<li> Filtering part of speech
</ul>
The preprocessed text example could look like this:
<blockquote>plane crash tower world trade center new york</blockquote>
In the second and final step the network is constructed. Every word of the preprocessed text constitutes a node of the network, where equal words are represented by solely one node. The connections are created by using one of the following methods:
<ul><dd>
<li>Co-occurrence: Every word within in the same sentence is connected
<li>k-Windowing: Every word is connected to the k-1 subsequent words
</ul>
The following figures show the final network depending on the utilized method.
<table>
<td>[[File:CoOccurence.png|thumb|300px|<div align="center">Co-Occurence</div>]]</td>
<td>[[File:3Windowing.png|thumb|823px|<div align="center">3-Windowing</div>]]</td>
</table>