<?xml version="1.0"?><?xml-stylesheet type="text/xsl" href="http://code.msdn.microsoft.com/rss.xsl"?><rss version="2.0"><channel><title>Directed Acyclic Word Graph C#</title><link>http://code.msdn.microsoft.com/dawg1/Project/ProjectRss.aspx</link><description>&amp;#33; Introduction      I have written code in C&amp;#35; that implements various string&amp;#47;word-storage algorithms, such as Directed Acyclic Word Graphs. These algorithms are used to design word games such as Scrabb...</description><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=25</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Anagram Program
&lt;/h1&gt; &lt;br /&gt;The DAWG is used in my anagram program. See my article &lt;a href="http://dotnetperls.com/Content/Anagram-Windows.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Anagram-Windows.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Big Update
&lt;/h1&gt; &lt;br /&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data structure. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. &lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Mon, 21 Jul 2008 00:19:00 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080721A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=24</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Big Update
&lt;/h1&gt; &lt;br /&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data structure. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. &lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Mon, 21 Jul 2008 00:16:56 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080721A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=23</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
New Application for DAWG
&lt;/h1&gt;I have developed an anagram finder program called Anagram Free Finder that uses this code. It contains about 400 lines of code and has a useful GUI. It will find all anagrams of equal or lesser length to the word you type in. It displays results instantly when you type a key.&lt;br /&gt;Please visit it at &lt;a href="http://code.msdn.microsoft.com/anagrams" class="externalLink"&gt;http://code.msdn.microsoft.com/anagrams&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. It is the best way to actually see a demonstration of this 1985 technology.&lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=2325" alt="anagram2.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Big Update May 2008!
&lt;/h1&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. &lt;br /&gt; &lt;br /&gt;I will be optimizing/enhancing this software in a series. Read the series by looking at the first link to Directed-Acyclic-Word-Graph.aspx. There is a series you can continue reading from there. Finally there is a page with benchmarks and a conclusion. Here are a couple of the results graphs. The DAWG and the Dictionary are the two on the left. The Bloom filter is another structure but it doesn't store all the same data, which is why it is smaller.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1979" alt="TimeChart1.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1980" alt="MemoryChart1.png" /&gt;&lt;br /&gt; &lt;br /&gt;My series also includes a list of things I have learned about writing fast C# code. I hope to add more to this page and organize this stuff better. Other methods I used in implementing DawgKit include Enumerable.Range in LINQ&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;and also a TextBox trick to improve the UI.&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;It is my goal to keep improving this software occasionally, as well as the articles I have written about it. It is fairly complex but I believe it can greatly benefit some software out there.&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 12 Jun 2008 03:30:13 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080612A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=22</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Big Update May 2008!
&lt;/h1&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. &lt;br /&gt; &lt;br /&gt;I will be optimizing/enhancing this software in a series. Read the series by looking at the first link to Directed-Acyclic-Word-Graph.aspx. There is a series you can continue reading from there. Finally there is a page with benchmarks and a conclusion. Here are a couple of the results graphs. The DAWG and the Dictionary are the two on the left. The Bloom filter is another structure but it doesn't store all the same data, which is why it is smaller.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1979" alt="TimeChart1.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1980" alt="MemoryChart1.png" /&gt;&lt;br /&gt; &lt;br /&gt;My series also includes a list of things I have learned about writing fast C# code. I hope to add more to this page and organize this stuff better. Other methods I used in implementing DawgKit include Enumerable.Range in LINQ&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;and also a TextBox trick to improve the UI.&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;It is my goal to keep improving this software occasionally, as well as the articles I have written about it. It is fairly complex but I believe it can greatly benefit some software out there.&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Sat, 17 May 2008 03:09:37 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080517A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=21</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Big Update May 2008!
&lt;/h1&gt; &lt;br /&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. &lt;br /&gt; &lt;br /&gt;I will be optimizing/enhancing this software in a series. Read the series by looking at the first link to Directed-Acyclic-Word-Graph.aspx. There is a series you can continue reading from there. Finally there is a page with benchmarks and a conclusion. Here are a couple of the results graphs. The DAWG and the Dictionary are the two on the left. The Bloom filter is another structure but it doesn't store all the same data, which is why it is smaller.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1979" alt="TimeChart1.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1980" alt="MemoryChart1.png" /&gt;&lt;br /&gt; &lt;br /&gt;My series also includes a list of things I have learned about writing fast C# code. I hope to add more to this page and organize this stuff better. Other methods I used in implementing DawgKit include Enumerable.Range in LINQ&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;and also a TextBox trick to improve the UI.&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;It is my goal to keep improving this software occasionally, as well as the articles I have written about it. It is fairly complex but I believe it can greatly benefit some software out there.&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:53:24 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=20</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Big Update May 2008!
&lt;/h1&gt; &lt;br /&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. &lt;br /&gt; &lt;br /&gt;I will be optimizing/enhancing this software in a series. Read the series by looking at the first link to Directed-Acyclic-Word-Graph.aspx. There is a series you can continue reading from there. Finally there is a page with benchmarks and a conclusion. Here are a couple of the results graphs. The DAWG and the Dictionary are the two on the left. The Bloom filter is another structure but it doesn't store all the same data, which is why it is smaller.&lt;br /&gt; &lt;br /&gt;&lt;a href="http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=img%3aTimeChart1.png&amp;amp;referringTitle=Home"&gt;img:TimeChart1.png&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;&lt;a href="http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=img%3aMemoryChart1.png&amp;amp;referringTitle=Home"&gt;img:MemoryChart1.png&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;My series also includes a list of things I have learned about writing fast C# code. I hope to add more to this page and organize this stuff better. Other methods I used in implementing DawgKit include Enumerable.Range in LINQ&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;and also a TextBox trick to improve the UI.&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;It is my goal to keep improving this software occasionally, as well as the articles I have written about it. It is fairly complex but I believe it can greatly benefit some software out there.&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:53:04 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=19</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Big Update May 2008!
&lt;/h1&gt; &lt;br /&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. &lt;br /&gt; &lt;br /&gt;I will be optimizing/enhancing this software in a series. Read the series by looking at the first link to Directed-Acyclic-Word-Graph.aspx. There is a series you can continue reading from there. Finally there is a page with benchmarks and a conclusion.&lt;br /&gt; &lt;br /&gt;It also includes a list of things I have learned about writing fast C# code. I hope to add more to this page and organize this stuff better. Other methods I used in implementing DawgKit include Enumerable.Range in LINQ&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;and also a TextBox trick to improve the UI.&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;It is my goal to keep improving this software occasionally, as well as the articles I have written about it. It is fairly complex but I believe it can greatly benefit some software out there.&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:50:06 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=18</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Big Update May 2008!
&lt;/h1&gt; &lt;br /&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. &lt;br /&gt; &lt;br /&gt;I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;.&lt;br /&gt; &lt;br /&gt;Read the series by looking at the first link to Directed-Acyclic-Word-Graph.aspx. There is a series you can continue reading from there.&lt;br /&gt;Finally there is a page with benchmarks and a conclusion. It also includes a list of things I have learned about writing fast C# code. I hope to add more to this page and organize this stuff better.&lt;br /&gt; &lt;br /&gt;Other methods I used in implementing DawgKit include Enumerable.Range in LINQ&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;and also a TextBox trick to improve the UI.&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;It is my goal to keep improving this software occasionally, as well as the articles I have written about it. It is fairly complex but I believe it can greatly benefit some software out there.&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:49:29 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=17</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Big Update
&lt;/h1&gt; &lt;br /&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. &lt;br /&gt; &lt;br /&gt;I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;.&lt;br /&gt; &lt;br /&gt;Read the series by looking at the first link to Directed-Acyclic-Word-Graph.aspx. There is a series you can continue reading from there.&lt;br /&gt;Finally there is a page with benchmarks and a conclusion. It also includes a list of things I have learned about writing fast C# code. I hope to add more to this page and organize this stuff better.&lt;br /&gt; &lt;br /&gt;Other methods I used in implementing DawgKit include Enumerable.Range in LINQ&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;and also a TextBox trick to improve the UI.&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;It is my goal to keep improving this software occasionally, as well as the articles I have written about it. It is fairly complex but I believe it can greatly benefit some software out there.&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:48:53 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=16</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Big Update
&lt;/h1&gt; &lt;br /&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;.&lt;br /&gt; &lt;br /&gt;Read the series by looking at the first link to Directed-Acyclic-Word-Graph.aspx. There is a series you can continue reading from there.&lt;br /&gt;Finally there is a page with benchmarks and a conclusion:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-Results.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-Results.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;Other methods I used in implementing DawgKit include Enumerable.Range in LINQ&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/LINQ-Enumerable-Range.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;and also a TextBox trick to improve the UI.&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/TextBox-AppendText-Tip.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;It is my goal to keep improving this software occasionally, as well as the articles I have written about it. It is fairly complex but I believe it can greatly benefit some software out there.&lt;br /&gt; &lt;br /&gt; &lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:47:53 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>CREATED RELEASE: DawgKit May 2008 (May 14, 2008)</title><link>http://code.msdn.microsoft.com/dawg1/Release/ProjectReleases.aspx?ReleaseId=1016</link><description>Lots of cleanups and improvements. It uses interfaces in the code, and has more logical and clear supporting code. Some complexity was removed in many parts, including critical parts. No big performance improvements, but a worthwhile update. Also uses LINQ for simplicity in some non-critical code.</description><author></author><pubDate>Thu, 15 May 2008 04:42:05 GMT</pubDate><guid isPermaLink="false">CREATED RELEASE: DawgKit May 2008 (May 14, 2008) 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=15</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Big Update
&lt;/h1&gt; &lt;br /&gt;The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better&lt;br /&gt;and more factored. It uses more interfaces and some of the supporting code is much better.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. Here are the articles I write about DawgKit in:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-1.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-1.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-2.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-2.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-3.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-3.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-4.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-4.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-5.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-5.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;Finally, a page with benchmarks and a conclusion:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-Results.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-Results.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:38:43 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=14</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977" alt="DawgKitScreen.png" /&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. Here are the articles I write about DawgKit in:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-1.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-1.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-2.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-2.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-3.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-3.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-4.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-4.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-5.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-5.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;Finally, a page with benchmarks and a conclusion:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-Results.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-Results.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:37:18 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=13</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;a href="javascript:window.location.href='http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=dawg1&amp;amp;DownloadId=1977';"&gt;DawgKitScreen.png&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. Here are the articles I write about DawgKit in:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-1.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-1.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-2.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-2.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-3.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-3.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-4.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-4.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-5.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-5.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;Finally, a page with benchmarks and a conclusion:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-Results.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-Results.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:37:01 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dawg1/Wiki/View.aspx?title=Home&amp;version=12</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic &lt;b&gt;performance advantage&lt;/b&gt; over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;span class="unresolved"&gt;Cannot resolve link: &lt;/span&gt;[file:DawgKitScreen.png]&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. Here are the articles I write about DawgKit in:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-1.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-1.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-2.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-2.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-3.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-3.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-4.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-4.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-5.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-5.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;Finally, a page with benchmarks and a conclusion:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-Results.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-Results.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Thu, 15 May 2008 04:36:39 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080515A</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dotnetwordgraphs/Wiki/View.aspx?title=Home&amp;version=11</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic performance advantage over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. Here are the articles I write about DawgKit in:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-1.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-1.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-2.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-2.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-3.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-3.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-4.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-4.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-5.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-5.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;Finally, a page with benchmarks and a conclusion:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-Results.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-Results.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Sat, 03 May 2008 22:53:06 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080503P</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dotnetwordgraphs/Wiki/View.aspx?title=Home&amp;version=10</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic performance advantage over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;.&lt;br /&gt; &lt;br /&gt;My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series.&lt;br /&gt; &lt;br /&gt;Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. Here are the articles I write about DawgKit in:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-1.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-1.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-2.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-2.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-3.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-3.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-4.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-4.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-5.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-5.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;Finally, a page with benchmarks and a conclusion:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-Results.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-Results.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Sat, 03 May 2008 22:52:50 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080503P</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dotnetwordgraphs/Wiki/View.aspx?title=Home&amp;version=9</link><description>&lt;div class="wikidoc"&gt;
&lt;h1&gt;
Introduction
&lt;/h1&gt; &lt;br /&gt;I have written code in C# that implements the &lt;b&gt;Directed Acyclic Word Graph&lt;/b&gt; algorithm and data stucture. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in &lt;b&gt;scientific&lt;/b&gt; pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C# and C&lt;u&gt;+, in Visual Studio for both and GCC for the C/C+&lt;/u&gt;.&lt;br /&gt; &lt;br /&gt;The DAWG algorithms have a dramatic performance advantage over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;&lt;h1&gt;
Important Resources
&lt;/h1&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;.&lt;br /&gt; &lt;br /&gt;My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series.&lt;br /&gt; &lt;br /&gt;Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;. Here are the articles I write about DawgKit in:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-1.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-1.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-2.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-2.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-3.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-3.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-4.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-4.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-5.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-5.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;Finally, a page with benchmarks and a conclusion:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-Results.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-Results.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Sat, 03 May 2008 22:52:07 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080503P</guid></item><item><title>UPDATED WIKI: Home</title><link>http://code.msdn.microsoft.com/dotnetwordgraphs/Wiki/View.aspx?title=Home&amp;version=8</link><description>&lt;div class="wikidoc"&gt;
I have written code in C#, C, C++, and Perl that implements various string/word-storage algorithms, such as Directed Acyclic Word Graphs. These algorithms are used to design word games such as Scrabble or anagrams and also have usage in scientific pursuits in biology and genetics.&lt;br /&gt; &lt;br /&gt;This code page is meant to serve as an outpost for this code. I have a complete implementation in C# and C&lt;u&gt;+, in Visual Studio for both and GCC for the C/C+&lt;/u&gt;.&lt;br /&gt; &lt;br /&gt;The DAWG algorithms have a dramatic performance advantage over hash tables, sometimes occupying 25% of the memory and also having faster performance.&lt;br /&gt; &lt;br /&gt;I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.&lt;br /&gt; &lt;br /&gt;Implementation details can be found at &lt;a href="http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;.&lt;br /&gt; &lt;br /&gt;My website is at &lt;a href="http://dotnetperls.com/" class="externalLink"&gt;http://dotnetperls.com/&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt; and I will be optimizing/enhancing this software in a series.&lt;br /&gt; &lt;br /&gt;Additional sources are available at Google Code &lt;a href="http://code.google.com/p/dotnetperls-controls/downloads/list" class="externalLink"&gt;http://code.google.com/p/dotnetperls-controls/downloads/list&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;.&lt;br /&gt; &lt;br /&gt;Here are the articles I write about DawgKit in:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-1.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-1.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-2.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-2.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-3.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-3.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-4.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-4.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-5.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-5.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;Finally, a page with benchmarks and a conclusion:&lt;br /&gt; &lt;br /&gt;&lt;a href="http://dotnetperls.com/Content/Word-Algorithm-Results.aspx" class="externalLink"&gt;http://dotnetperls.com/Content/Word-Algorithm-Results.aspx&lt;span class="externalLinkIcon"&gt;&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;br /&gt;
&lt;/div&gt;</description><author>smallenucd</author><pubDate>Sat, 22 Mar 2008 22:39:30 GMT</pubDate><guid isPermaLink="false">UPDATED WIKI: Home 20080322P</guid></item><item><title>CREATED RELEASE: Dawg Kit Optimized (Mar 22, 2008)</title><link>http://code.msdn.microsoft.com/dotnetwordgraphs/Release/ProjectReleases.aspx?ReleaseId=705</link><description>This version includes many optimizations, improving many benchmarks up to 30&amp;#37;. Includes UI enhancements, cleaner code, more comments &amp;#40;XML&amp;#41;, and also release and debug binaries for .NET 3.5. No installer. Also on Google Code.</description><author></author><pubDate>Sat, 22 Mar 2008 22:37:37 GMT</pubDate><guid isPermaLink="false">CREATED RELEASE: Dawg Kit Optimized (Mar 22, 2008) 20080322P</guid></item></channel></rss>