20.02.2013 Views

Qualitative_data_analysis

Qualitative_data_analysis

Qualitative_data_analysis

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

our reasons for making decisions and not simply putting them into effect without<br />

explanation. Justice must not only be done—it must be seen to be done.<br />

Assigning links<br />

• Look out for link words in the <strong>data</strong><br />

• Only identify links pertinent to the <strong>analysis</strong><br />

• Stay as close as possible to the <strong>data</strong><br />

• Use caution in inferring links<br />

• Specify ‘rules’ governing link decisions<br />

The mechanics of linking <strong>data</strong> should be as straightforward as those of<br />

categorizing. Once each bit of <strong>data</strong> has been selected and a link chosen, the<br />

computer should be able to do the rest. It should be possible to link <strong>data</strong> prior to<br />

categorizing, while categorizing or after categorizing. What do we produce through<br />

linking <strong>data</strong>bits? In practical terms, the computer can store for each <strong>data</strong>bit any<br />

information about links we have made between it and other <strong>data</strong>bits, and what<br />

those links are called. The particular format used does not matter, so long as the<br />

computer stores the relevant information in a practical way. This should allow us,<br />

on analysing our <strong>data</strong>bits, to go directly from a <strong>data</strong>bit to any other <strong>data</strong>bit linked to<br />

it. When we come to analysing <strong>data</strong>bits, therefore, we can display information not<br />

just about the categories to which they belong, or the context from which they are<br />

drawn, but also the other <strong>data</strong>bits to which they relate.<br />

Earlier we looked at an example of the information which might be held by the<br />

computer for our first <strong>data</strong>bit. We can now extend this to include information<br />

about the links with other <strong>data</strong>bits (Illustration 11.2). It doesn’t matter how the<br />

<strong>data</strong>bit is indexed—I have just taken the first three words of each <strong>data</strong>bit as an index<br />

—so long as the computer can use the index to locate any linked <strong>data</strong>bits. There<br />

should be no practical limit to how many links we can record for any particular<br />

<strong>data</strong>bit.<br />

ILLUSTRATION 11.2<br />

INFORMATION HELD ON LINKED DATABITS<br />

Index Mrs Sol Schwimmer<br />

Databit Mrs Sol Schwimmer is suing me<br />

Categories Transposing Occupation<br />

Case Letter01<br />

LINKING DATA 173

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!