<?xml version='1.0' encoding='utf-8'?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:thr="http://purl.org/syndication/thread/1.0"><updated>2008-05-04T13:39:41Z</updated><id>tag:blog.limedaley.com,2018:/isso/thread/post/releaseforge-for-sourceforge</id><title>Comments for blog.limedaley.com/post/releaseforge-for-sourceforge</title><entry><id>tag:blog.limedaley.com,2018:/isso/526/2317</id><title>Comment #2317</title><updated>2008-05-04T13:39:41Z</updated><author><name>reto</name></author><link href="https://blog.limedaley.com/post/releaseforge-for-sourceforge#isso-2317" /><content type="html">&lt;p&gt;Hi Jon&lt;/p&gt;
&lt;p&gt;Thanks for pointing us to that handy piece of software! I'm uploading release 1.2.8 as I'm writing this. Had no login issues with the version 1.1 I installed from the repositories (apt-get install releaseforge on Ubuntu 7.10 universe)&lt;/p&gt;
&lt;p&gt;cheers, reto&lt;/p&gt;</content></entry><entry><id>tag:blog.limedaley.com,2018:/isso/526/2316</id><title>Comment #2316</title><updated>2008-05-02T15:33:30Z</updated><author><name>Peter V</name></author><link href="https://blog.limedaley.com/post/releaseforge-for-sourceforge#isso-2316" /><content type="html">&lt;p&gt;I spent one year at CMU working on cross-lingual information retrieval, where the query was in a different language from the documents being searched.  It basically worked by translating the query but with probability weights attached to each term (how likely the word is to translate the one you typed) and carrying those weights through to the language model for each document.  It was pretty similar to the vector approach but used a weighted &amp;quot;bag of words&amp;quot; instead.&lt;/p&gt;</content></entry><entry><id>tag:blog.limedaley.com,2018:/isso/526/2315</id><title>Comment #2315</title><updated>2008-05-02T10:43:54Z</updated><author><name>SursumCorda</name></author><link href="https://blog.limedaley.com/post/releaseforge-for-sourceforge#isso-2315" /><content type="html">&lt;p&gt;I think you can teach an old dog new tricks.  I don't know half of what you are talking about here, but I have discovered that I am better than many people at finding things through Google.  I don't know why though -- I don't have a particular scheme; I just type in what seems logical to me.&lt;/p&gt;</content></entry><entry><id>tag:blog.limedaley.com,2018:/isso/526/2314</id><title>Comment #2314</title><updated>2008-05-02T04:54:21Z</updated><author><name>jondaley</name></author><link href="https://blog.limedaley.com/post/releaseforge-for-sourceforge#isso-2314" /><content type="html">&lt;p&gt;And yes, re-reading your post more carefully I see what you are saying.  I saw the &amp;quot;All the Boolean operators in the world won't help if the words you use are vague or you don't use enough words&amp;quot;, to mean natural language searching, since that is the sort of thing a former employer would have said.  Their idea was interesting enough - if you have a document and you want to find another one like it, just copy and paste the whole paragraph into the search engine.  It then calculates vectors of different terms in the paragraph (or whole article) to decide what things you are really looking for.  The typical example that they would use to explain why their search was better than keyword searching is maybe you want articles about dogs and not about cats, so you type in &amp;quot;dogs -cats&amp;quot;, but then you wouldn't get the article that has pages and pages about dogs, and in one place it says, &amp;quot;dogs are completely different than cats&amp;quot; in a keyword search, but in a vector search, the cat vector would be quite small in those sorts of documents, and so could still possibly match a search where you typed: &amp;quot;I want to learn about dogs, but I don't care about cats&amp;quot; or pasting in your research paper about dogs, etc, etc.&lt;/p&gt;
&lt;p&gt;They had one customer, and lasted for a while as a CMU startup, but the funding went away at some point, and I haven't heard of anything particularly similar.  Peter has some stuff sort of related, but not for search engines, I think.  The &lt;a href="http://clusty.com/" rel="nofollow noopener"&gt;Vivisimo&lt;/a&gt; search engine is sort of like that, though it is more like clustered keywords.  I have used it in the past (and like the name vivisimo better than clusty, though it is harder to spell) and it has always been too slow, though I suspect that it might be better for people who have a harder time typing the right keywords.&lt;/p&gt;</content></entry><entry><id>tag:blog.limedaley.com,2018:/isso/526/2313</id><title>Comment #2313</title><updated>2008-05-02T04:46:38Z</updated><author><name>jondaley</name></author><link href="https://blog.limedaley.com/post/releaseforge-for-sourceforge#isso-2313" /><content type="html">&lt;p&gt;The only way I found it was that I remembered I had saved my Firefox bookmarks from the computer at my last job, and haven't gotten around to copying it to my current computers.  I probably should have an online bookmark page instead of copying when I move between computers, though the moving happens so infrequently that I haven't looked into a better solution.&lt;/p&gt;</content></entry><entry><id>tag:blog.limedaley.com,2018:/isso/526/2312</id><title>Comment #2312</title><updated>2008-05-02T01:40:02Z</updated><author><name>Chip</name></author><link href="https://blog.limedaley.com/post/releaseforge-for-sourceforge#isso-2312" /><content type="html">&lt;p&gt;Heh.  I wasn't trying to say that search engines needed to change, as much I was saying that people need to learn how to use search engines more effectively  (I was approaching the problem as someone with a degree in English, not as a programmer) I remember reading your various posts about the funny things people type into a search engine that brings them to your site.&lt;/p&gt;
&lt;p&gt;If it was me looking for &amp;quot;Release Forge&amp;quot; without remembering the exact title, I probably would have used combinations of key words similar to what you did. How did you find it, or re-find it, in the end?&lt;/p&gt;</content></entry></feed>