<?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 on: Word frequencies in human and computer languages</title>
	<atom:link href="http://www.johndcook.com/blog/2009/12/07/word-frequencies/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johndcook.com/blog/2009/12/07/word-frequencies/</link>
	<description>The blog of John D. Cook</description>
	<lastBuildDate>Sat, 11 Feb 2012 01:10:06 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Derek Jones</title>
		<link>http://www.johndcook.com/blog/2009/12/07/word-frequencies/comment-page-1/#comment-44476</link>
		<dc:creator>Derek Jones</dc:creator>
		<pubDate>Wed, 25 Aug 2010 01:15:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3859#comment-44476</guid>
		<description>The information you are after is available, &lt;a href=&quot;http://www.knosof.co.uk/cbook/usefigtab.pdf&quot; rel=&quot;nofollow&quot;&gt;at least for C&lt;/a&gt;.  I would advocate teaching students the 2..4 most commonly occurring instances of a construct.  It would simplify code a lot, making life a lot easy for subsequent maintainers of the code and making life a lot easier for optimizing compilers and static analyzers.</description>
		<content:encoded><![CDATA[<p>The information you are after is available, <a href="http://www.knosof.co.uk/cbook/usefigtab.pdf" rel="nofollow">at least for C</a>.  I would advocate teaching students the 2..4 most commonly occurring instances of a construct.  It would simplify code a lot, making life a lot easy for subsequent maintainers of the code and making life a lot easier for optimizing compilers and static analyzers.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: gwern</title>
		<link>http://www.johndcook.com/blog/2009/12/07/word-frequencies/comment-page-1/#comment-28740</link>
		<dc:creator>gwern</dc:creator>
		<pubDate>Sat, 12 Dec 2009 21:23:53 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3859#comment-28740</guid>
		<description>You might find http://jtauber.com/blog/2008/02/10/a_new_kind_of_graded_reader/
and http://jtauber.com/blog/2004/11/26/programmed_vocabulary_learning_as_a_travelling_salesman_problem/
interesting.

The idea is to figure out what new word will bring as many sentences as possible closer to being understood. Repeat and in exchange for learning a few words, you can read many sentences. (I have a Haskell implementation I work on every so often, but since I&#039;m not actively learning any languages, and it&#039;s not at all obvious how to do this for a programming language, I haven&#039;t looked at it in a long time.)</description>
		<content:encoded><![CDATA[<p>You might find <a href="http://jtauber.com/blog/2008/02/10/a_new_kind_of_graded_reader/" rel="nofollow">http://jtauber.com/blog/2008/02/10/a_new_kind_of_graded_reader/</a><br />
and <a href="http://jtauber.com/blog/2004/11/26/programmed_vocabulary_learning_as_a_travelling_salesman_problem/" rel="nofollow">http://jtauber.com/blog/2004/11/26/programmed_vocabulary_learning_as_a_travelling_salesman_problem/</a><br />
interesting.</p>
<p>The idea is to figure out what new word will bring as many sentences as possible closer to being understood. Repeat and in exchange for learning a few words, you can read many sentences. (I have a Haskell implementation I work on every so often, but since I&#8217;m not actively learning any languages, and it&#8217;s not at all obvious how to do this for a programming language, I haven&#8217;t looked at it in a long time.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Times Series Methods versus Recurrence Relations &#124; John Myles White: Die Sudelbücher</title>
		<link>http://www.johndcook.com/blog/2009/12/07/word-frequencies/comment-page-1/#comment-28657</link>
		<dc:creator>Times Series Methods versus Recurrence Relations &#124; John Myles White: Die Sudelbücher</dc:creator>
		<pubDate>Fri, 11 Dec 2009 03:41:56 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3859#comment-28657</guid>
		<description>[...] hope John D. Cook will forgive me for using the Fibonacci sequence as my example. While I totally agree with John [...]</description>
		<content:encoded><![CDATA[<p>[...] hope John D. Cook will forgive me for using the Fibonacci sequence as my example. While I totally agree with John [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://www.johndcook.com/blog/2009/12/07/word-frequencies/comment-page-1/#comment-28432</link>
		<dc:creator>John</dc:creator>
		<pubDate>Mon, 07 Dec 2009 18:23:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3859#comment-28432</guid>
		<description>Thanks, Greg. That looks like a good paper.</description>
		<content:encoded><![CDATA[<p>Thanks, Greg. That looks like a good paper.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Greg Wilson</title>
		<link>http://www.johndcook.com/blog/2009/12/07/word-frequencies/comment-page-1/#comment-28431</link>
		<dc:creator>Greg Wilson</dc:creator>
		<pubDate>Mon, 07 Dec 2009 18:19:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3859#comment-28431</guid>
		<description>You might enjoy Todd Veldhuizen&#039;s &quot;Software Libraries and Their Reuse: Entropy, Kolmogorov Complexity, and Zipf&#039;s Law&quot;, available at http://arxiv.org/abs/cs/0508023.</description>
		<content:encoded><![CDATA[<p>You might enjoy Todd Veldhuizen&#8217;s &#8220;Software Libraries and Their Reuse: Entropy, Kolmogorov Complexity, and Zipf&#8217;s Law&#8221;, available at <a href="http://arxiv.org/abs/cs/0508023." rel="nofollow">http://arxiv.org/abs/cs/0508023.</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: David Wolever</title>
		<link>http://www.johndcook.com/blog/2009/12/07/word-frequencies/comment-page-1/#comment-28429</link>
		<dc:creator>David Wolever</dc:creator>
		<pubDate>Mon, 07 Dec 2009 18:04:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3859#comment-28429</guid>
		<description>&quot;It would be interesting to write a programming language tutorial that introduces the keywords in the approximately the order of their frequency. Such a book might be quite unorthodox, and quite useful.&quot;

Interesting idea.

Also, interesting that you mention this… Just yesterday I got around to analyzing the first round of data from &lt;a href=&quot;http://wolever.net/~wolever/wiki/vim-logging&quot; rel=&quot;nofollow&quot;&gt;vim-logging&lt;/a&gt;, a patched version of Vim which records which commands I use most. The analysis of that is here: http://blog.codekills.net/archives/67-You-and-Your-Editor-Data-from-vim-logging-2-of-N.html</description>
		<content:encoded><![CDATA[<p>&#8220;It would be interesting to write a programming language tutorial that introduces the keywords in the approximately the order of their frequency. Such a book might be quite unorthodox, and quite useful.&#8221;</p>
<p>Interesting idea.</p>
<p>Also, interesting that you mention this… Just yesterday I got around to analyzing the first round of data from <a href="http://wolever.net/~wolever/wiki/vim-logging" rel="nofollow">vim-logging</a>, a patched version of Vim which records which commands I use most. The analysis of that is here: <a href="http://blog.codekills.net/archives/67-You-and-Your-Editor-Data-from-vim-logging-2-of-N.html" rel="nofollow">http://blog.codekills.net/archives/67-You-and-Your-Editor-Data-from-vim-logging-2-of-N.html</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.333 seconds -->

