<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments for dfreelon.org</title>
	<atom:link href="http://dfreelon.org/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://dfreelon.org</link>
	<description></description>
	<lastBuildDate>Fri, 30 Jul 2010 00:59:45 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>Comment on ReCal3: Reliability for 3+ Coders by Brian Louie</title>
		<link>http://dfreelon.org/utils/recalfront/recal3/#comment-749</link>
		<dc:creator>Brian Louie</dc:creator>
		<pubDate>Fri, 30 Jul 2010 00:59:45 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?page_id=18#comment-749</guid>
		<description>Is there a probability p value that is associated with Fleiss&#039; Kappa? If so, it would be great to see this integrated as a feature in future versions.</description>
		<content:encoded><![CDATA[<p>Is there a probability p value that is associated with Fleiss&#8217; Kappa? If so, it would be great to see this integrated as a feature in future versions.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ReCal2: Reliability for 2 Coders by John</title>
		<link>http://dfreelon.org/utils/recalfront/recal2/#comment-747</link>
		<dc:creator>John</dc:creator>
		<pubDate>Sun, 25 Jul 2010 21:39:45 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?page_id=17#comment-747</guid>
		<description>One word. Awesome! This program gets the job done. Good work and keep bring it.</description>
		<content:encoded><![CDATA[<p>One word. Awesome! This program gets the job done. Good work and keep bring it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ReCal3: Reliability for 3+ Coders by Fawzy</title>
		<link>http://dfreelon.org/utils/recalfront/recal3/#comment-742</link>
		<dc:creator>Fawzy</dc:creator>
		<pubDate>Mon, 28 Jun 2010 10:15:04 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?page_id=18#comment-742</guid>
		<description>wonderful, handy and very helpful</description>
		<content:encoded><![CDATA[<p>wonderful, handy and very helpful</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Intercoder Reliability Worked Examples by Toi</title>
		<link>http://dfreelon.org/2009/10/30/intercoder-reliability-worked-examples/#comment-728</link>
		<dc:creator>Toi</dc:creator>
		<pubDate>Mon, 17 May 2010 14:51:28 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?p=56#comment-728</guid>
		<description>Hi Deen,

I&#039;m a qualitative researcher for a large non-profit.  We&#039;re coding some video from kids&#039; video diaries.

Everything in ReCal seems to be working well EXCEPT when we&#039;re in near complete agreement, and there is only one divergent rating.  So for example, with three coders, we can have 10 different cases for the same variable. So out of the 30 judgments, we can have 29 1s and one 2, and the output on the Krippendorff is a fat 0.

I must admit that I am not well-versed in stats, so, this is a little out of my realm.  All of the other statisticians we have on staff have never heard of Krippendorff&#039;s alpha, so they can&#039;t really help explain why this is the case.

Can you help?

Thanks,

Toi</description>
		<content:encoded><![CDATA[<p>Hi Deen,</p>
<p>I&#8217;m a qualitative researcher for a large non-profit.  We&#8217;re coding some video from kids&#8217; video diaries.</p>
<p>Everything in ReCal seems to be working well EXCEPT when we&#8217;re in near complete agreement, and there is only one divergent rating.  So for example, with three coders, we can have 10 different cases for the same variable. So out of the 30 judgments, we can have 29 1s and one 2, and the output on the Krippendorff is a fat 0.</p>
<p>I must admit that I am not well-versed in stats, so, this is a little out of my realm.  All of the other statisticians we have on staff have never heard of Krippendorff&#8217;s alpha, so they can&#8217;t really help explain why this is the case.</p>
<p>Can you help?</p>
<p>Thanks,</p>
<p>Toi</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ReCal: reliability calculation for the masses by Ostkirchen Gabriele; Lüdecke Hildegard</title>
		<link>http://dfreelon.org/utils/recalfront/#comment-727</link>
		<dc:creator>Ostkirchen Gabriele; Lüdecke Hildegard</dc:creator>
		<pubDate>Tue, 11 May 2010 15:13:56 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?page_id=16#comment-727</guid>
		<description>Dear Mr. Freelon,
would it be possible, you send us your opinion on our
problem?
Since we calculate intercoder-reliability for different sub-studies of our project with your programme we easily get the reliabilty-results, including the amount of coder-differences.
We learnt that our coding-system ameliorated over the
time, and we started to use your programme to help us
to sharpen up our category-system by adding examples and by reformulating the rules. Hildegard did a complete analysis of the mistakes (disaggrements) found by ReCal2 and up to now 5 mistakes are remaining. In her thesis she wants to 
present the first calculation with about 60 disagreement, than a table with all commented disaggrements and then she executes a new reliability analysis and of course nearly
all categories show an aggrement of 100%. 
Can we do it like this? Or do you propose another
way? We find it very necessary to sharpen up our system through the process we explained above. 
An expert of methods like you, has he any arguments against this procedure?
Thanking you in anticipation for you soon reply
we remain with best wishes
Gaby and Hildegard</description>
		<content:encoded><![CDATA[<p>Dear Mr. Freelon,
would it be possible, you send us your opinion on our
problem?
Since we calculate intercoder-reliability for different sub-studies of our project with your programme we easily get the reliabilty-results, including the amount of coder-differences.
We learnt that our coding-system ameliorated over the
time, and we started to use your programme to help us
to sharpen up our category-system by adding examples and by reformulating the rules. Hildegard did a complete analysis of the mistakes (disaggrements) found by ReCal2 and up to now 5 mistakes are remaining. In her thesis she wants to 
present the first calculation with about 60 disagreement, than a table with all commented disaggrements and then she executes a new reliability analysis and of course nearly
all categories show an aggrement of 100%. 
Can we do it like this? Or do you propose another
way? We find it very necessary to sharpen up our system through the process we explained above. 
An expert of methods like you, has he any arguments against this procedure?
Thanking you in anticipation for you soon reply
we remain with best wishes
Gaby and Hildegard</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ReCal3: Reliability for 3+ Coders by dfreelon</title>
		<link>http://dfreelon.org/utils/recalfront/recal3/#comment-725</link>
		<dc:creator>dfreelon</dc:creator>
		<pubDate>Mon, 03 May 2010 16:11:08 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?page_id=18#comment-725</guid>
		<description>Julie,

It does not, and I suppose here is as good a place as any to explain why. The main reason is that I couldn&#039;t think of an intuitive way to do it. ReCal2 simply assumes that every adjacent column pair is a new variable, but ReCal3 can&#039;t do that since it has to be able to handle any number of coders starting with two. I briefly considered requiring users to enter the number of coders for ReCal3, which could then serve as a columnar multiple to produce that ReCal2 effect, but rejected this idea as too complicated. 

ReCal&#039;s error rate is fairly high (first-time users almost always make at least one error before completing a successful run) and I didn&#039;t want to make the system any more complicated than it had to be. Anyone who&#039;s ever designed a user interface will tell you that every extra hoop you force the user through generates more errors and inevitably increases attrition. I realize that my decision privileges new users at the expense of more savvy ones, but I would rather make ReCal more accessible than less, even if that means a bit more clicking for ReCal3 users. And isn&#039;t that what undergrad coders and research assistants are for anyway?</description>
		<content:encoded><![CDATA[<p>Julie,</p>
<p>It does not, and I suppose here is as good a place as any to explain why. The main reason is that I couldn&#8217;t think of an intuitive way to do it. ReCal2 simply assumes that every adjacent column pair is a new variable, but ReCal3 can&#8217;t do that since it has to be able to handle any number of coders starting with two. I briefly considered requiring users to enter the number of coders for ReCal3, which could then serve as a columnar multiple to produce that ReCal2 effect, but rejected this idea as too complicated. </p>
<p>ReCal&#8217;s error rate is fairly high (first-time users almost always make at least one error before completing a successful run) and I didn&#8217;t want to make the system any more complicated than it had to be. Anyone who&#8217;s ever designed a user interface will tell you that every extra hoop you force the user through generates more errors and inevitably increases attrition. I realize that my decision privileges new users at the expense of more savvy ones, but I would rather make ReCal more accessible than less, even if that means a bit more clicking for ReCal3 users. And isn&#8217;t that what undergrad coders and research assistants are for anyway?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ReCal3: Reliability for 3+ Coders by Julie</title>
		<link>http://dfreelon.org/utils/recalfront/recal3/#comment-724</link>
		<dc:creator>Julie</dc:creator>
		<pubDate>Mon, 03 May 2010 15:31:17 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?page_id=18#comment-724</guid>
		<description>Does ReCal3 allow for more than one variable, the way that ReCal2 does?  I.e., for 3 coders, can the first three columns represent one variable and the next three columns represent a second variable?</description>
		<content:encoded><![CDATA[<p>Does ReCal3 allow for more than one variable, the way that ReCal2 does?  I.e., for 3 coders, can the first three columns represent one variable and the next three columns represent a second variable?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ReCal FAQ and Troubleshooting Page by dfreelon</title>
		<link>http://dfreelon.org/2009/02/20/frequently-asked-questions-about-recal/#comment-695</link>
		<dc:creator>dfreelon</dc:creator>
		<pubDate>Wed, 14 Apr 2010 16:32:36 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?p=48#comment-695</guid>
		<description>Andrew,

Thanks for letting me know; I&#039;ll take your suggestion under advisement next time I have occasion to add features to ReCal. If anyone else is interested in weighted kappa or other features, please leave a comment so that I can gauge demand.</description>
		<content:encoded><![CDATA[<p>Andrew,</p>
<p>Thanks for letting me know; I&#8217;ll take your suggestion under advisement next time I have occasion to add features to ReCal. If anyone else is interested in weighted kappa or other features, please leave a comment so that I can gauge demand.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ReCal FAQ and Troubleshooting Page by Andrew Maxwell</title>
		<link>http://dfreelon.org/2009/02/20/frequently-asked-questions-about-recal/#comment-694</link>
		<dc:creator>Andrew Maxwell</dc:creator>
		<pubDate>Wed, 14 Apr 2010 12:48:24 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?p=48#comment-694</guid>
		<description>I am interested in the difference between analyzing the data for simple &quot;matches&quot; versus &quot;no-match&quot; and the weighted Kappa, that considers how far away are the misses.

SPSS does not calculate weighted kappa, do you?

Thanks

Andrew</description>
		<content:encoded><![CDATA[<p>I am interested in the difference between analyzing the data for simple &#8220;matches&#8221; versus &#8220;no-match&#8221; and the weighted Kappa, that considers how far away are the misses.</p>
<p>SPSS does not calculate weighted kappa, do you?</p>
<p>Thanks</p>
<p>Andrew</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ReCal: reliability calculation for the masses by Paul Lambert</title>
		<link>http://dfreelon.org/utils/recalfront/#comment-690</link>
		<dc:creator>Paul Lambert</dc:creator>
		<pubDate>Mon, 12 Apr 2010 03:54:38 +0000</pubDate>
		<guid isPermaLink="false">http://dfreelon.org/?page_id=16#comment-690</guid>
		<description>Hi There, Thanks for making this tool available as it provides a quick and easy way to work out reliability. 

Well done!

Paul, South Australia</description>
		<content:encoded><![CDATA[<p>Hi There, Thanks for making this tool available as it provides a quick and easy way to work out reliability. </p>
<p>Well done!</p>
<p>Paul, South Australia</p>
]]></content:encoded>
	</item>
</channel>
</rss>
