<?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: Discussion of Section 3 of TextRank</title>
	<atom:link href="http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/</link>
	<description>Read. Learn. Discuss.</description>
	<lastBuildDate>Mon, 18 Jun 2007 15:05:50 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: Adriano</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-957</link>
		<dc:creator>Adriano</dc:creator>
		<pubDate>Fri, 27 Apr 2007 12:56:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-957</guid>
		<description>Thanks for the link. I wanted to ask if the algorithm TextRank can be implemented in Javascript for one extension of firefox?</description>
		<content:encoded><![CDATA[<p>Thanks for the link. I wanted to ask if the algorithm TextRank can be implemented in Javascript for one extension of firefox?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: grant.ingersoll</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-956</link>
		<dc:creator>grant.ingersoll</dc:creator>
		<pubDate>Fri, 27 Apr 2007 12:17:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-956</guid>
		<description>I have some pseudocode at http://www.paperoftheweek.com/2007/02/03/addendum-to-textrank/</description>
		<content:encoded><![CDATA[<p>I have some pseudocode at <a href="http://www.paperoftheweek.com/2007/02/03/addendum-to-textrank/" rel="nofollow">http://www.paperoftheweek.com/2007/02/03/addendum-to-textrank/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Adriano</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-955</link>
		<dc:creator>Adriano</dc:creator>
		<pubDate>Fri, 27 Apr 2007 09:48:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-955</guid>
		<description>I&#039;m a graduate student and is working on a Web Page Recommender System learning, based on user&#039;s bookmark file. I&#039;m interested in TextRank for Keyword Extraction and would highly appreciate if you could help me regarding where may find algorithm&#039;s pseudocode. Actually, I have studied this paper: &quot;TextRank: Bringing Order into Texts. In Proc. of EMNLP 2004, Barcelona, Spain, July 2004.&quot;. Thanks for answer.</description>
		<content:encoded><![CDATA[<p>I&#8217;m a graduate student and is working on a Web Page Recommender System learning, based on user&#8217;s bookmark file. I&#8217;m interested in TextRank for Keyword Extraction and would highly appreciate if you could help me regarding where may find algorithm&#8217;s pseudocode. Actually, I have studied this paper: &#8220;TextRank: Bringing Order into Texts. In Proc. of EMNLP 2004, Barcelona, Spain, July 2004.&#8221;. Thanks for answer.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: grant.ingersoll</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-253</link>
		<dc:creator>grant.ingersoll</dc:creator>
		<pubDate>Fri, 09 Mar 2007 13:30:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-253</guid>
		<description>Hi Sandeep,

I&#039;m not sure what you are asking here (http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-248).  It looks like you have successfully added the 4 vertices and edges, but I&#039;m not sure what that means.  Now you need to run them through the ranking algorithm.</description>
		<content:encoded><![CDATA[<p>Hi Sandeep,</p>
<p>I&#8217;m not sure what you are asking here (<a href="http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-248" rel="nofollow">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-248</a>).  It looks like you have successfully added the 4 vertices and edges, but I&#8217;m not sure what that means.  Now you need to run them through the ranking algorithm.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: grant.ingersoll</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-252</link>
		<dc:creator>grant.ingersoll</dc:creator>
		<pubDate>Fri, 09 Mar 2007 13:26:30 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-252</guid>
		<description>Srinivas,

I don&#039;t know what school you go to or what kind of standards they have, but I very much suggest you buckle down and figure it out.  I&#039;m more than happy to answer questions you have (and you should ask your professor, too, since that is partially what they are paid for), as I have done for others, but I am not going to blindly send you my code (which I can&#039;t anyway) just so you can get a degree.   What&#039;s the point of getting a degree if you don&#039;t actually learn anything?  I surely wouldn&#039;t want to hire you.  I know, you probably think, like so many others, if I can just get that piece of paper, I&#039;ll be all set, but in reality, people will see right through you the minute you are asked to do anything real.  The way I see it, the 16th is more than enough time for you to figure it out.  It is maybe, tops, 2-3 days worth of coding.  I suggest you re-read the paper and then start asking appropriate questions to your professor.</description>
		<content:encoded><![CDATA[<p>Srinivas,</p>
<p>I don&#8217;t know what school you go to or what kind of standards they have, but I very much suggest you buckle down and figure it out.  I&#8217;m more than happy to answer questions you have (and you should ask your professor, too, since that is partially what they are paid for), as I have done for others, but I am not going to blindly send you my code (which I can&#8217;t anyway) just so you can get a degree.   What&#8217;s the point of getting a degree if you don&#8217;t actually learn anything?  I surely wouldn&#8217;t want to hire you.  I know, you probably think, like so many others, if I can just get that piece of paper, I&#8217;ll be all set, but in reality, people will see right through you the minute you are asked to do anything real.  The way I see it, the 16th is more than enough time for you to figure it out.  It is maybe, tops, 2-3 days worth of coding.  I suggest you re-read the paper and then start asking appropriate questions to your professor.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: srinivaskurma</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-251</link>
		<dc:creator>srinivaskurma</dc:creator>
		<pubDate>Fri, 09 Mar 2007 05:55:07 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-251</guid>
		<description>hi sir,
me too imlementing same paper( TextRank: Bringing Order Into Texts). sir i am unable do it.. as i have to submit code of that paper on 16th of this month..i am doing that project using JGraphT.if i wont submit code of hat paper i cant complete my degree. sir its my humble request pls send some code to complete my degree.
as my input of my project is some text paragraph and output is important keywords..based on above input and output i need some code which will work.
sir if i wont submit some code they will fail me in this project and unable to complete my degree...
pls reply soon sir... thanking you sir</description>
		<content:encoded><![CDATA[<p>hi sir,<br />
me too imlementing same paper( TextRank: Bringing Order Into Texts). sir i am unable do it.. as i have to submit code of that paper on 16th of this month..i am doing that project using JGraphT.if i wont submit code of hat paper i cant complete my degree. sir its my humble request pls send some code to complete my degree.<br />
as my input of my project is some text paragraph and output is important keywords..based on above input and output i need some code which will work.<br />
sir if i wont submit some code they will fail me in this project and unable to complete my degree&#8230;<br />
pls reply soon sir&#8230; thanking you sir</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: redsandred</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-248</link>
		<dc:creator>redsandred</dc:creator>
		<pubDate>Fri, 09 Mar 2007 05:27:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-248</guid>
		<description>package org.jgrapht.summ;
import java.net.*;

import org.jgrapht.*;
import org.jgrapht.graph.*;

/**
 *
 * @author 03bce105
 */
public class Summ {
    
    /** Creates a new instance of Summ */
    public Summ() {
    }
    
      public static void main(String [] args)
    {
        WeightedGraph stringGraph = createStringGraph();

        // note undirected edges are printed as: {,}
        System.out.println(stringGraph.toString());

    }
    
    private static WeightedGraph createStringGraph()
    {
        WeightedGraph g =
            new WeightedGraph(Edge.class);

        String v1 = &quot;v1&quot;;
        String v2 = &quot;v2&quot;;
        String v3 = &quot;v3&quot;;
        String v4 = &quot;v4&quot;;

        // add the vertices
        g.addVertex(v1);
        g.addVertex(v2);
        g.addVertex(v3);
        g.addVertex(v4);

        // add edges to create a circuit
        Edge e1=g.addEdge(v1, v2);
       Edge e2=g.addEdge(v2, v3);
        Edge e3=g.addEdge(v3, v4);
       Edge e4=g.addEdge(v4, v1);
        
       g.setEdgeWeight(e1,3.0);
       g.setEdgeWeight(e2,5.0);
       g.setEdgeWeight(e3,7.0);
       g.setEdgeWeight(e4,8.0);
        
        

        return g;
    }
    
    
}
first i gave  4 words and their weights as input,and icoudn&#039;t get graph for it.see my code and help me.</description>
		<content:encoded><![CDATA[<p>package org.jgrapht.summ;<br />
import java.net.*;</p>
<p>import org.jgrapht.*;<br />
import org.jgrapht.graph.*;</p>
<p>/**<br />
 *<br />
 * @author 03bce105<br />
 */<br />
public class Summ {</p>
<p>    /** Creates a new instance of Summ */<br />
    public Summ() {<br />
    }</p>
<p>      public static void main(String [] args)<br />
    {<br />
        WeightedGraph stringGraph = createStringGraph();</p>
<p>        // note undirected edges are printed as: {,}<br />
        System.out.println(stringGraph.toString());</p>
<p>    }</p>
<p>    private static WeightedGraph createStringGraph()<br />
    {<br />
        WeightedGraph g =<br />
            new WeightedGraph(Edge.class);</p>
<p>        String v1 = &#8220;v1&#8243;;<br />
        String v2 = &#8220;v2&#8243;;<br />
        String v3 = &#8220;v3&#8243;;<br />
        String v4 = &#8220;v4&#8243;;</p>
<p>        // add the vertices<br />
        g.addVertex(v1);<br />
        g.addVertex(v2);<br />
        g.addVertex(v3);<br />
        g.addVertex(v4);</p>
<p>        // add edges to create a circuit<br />
        Edge e1=g.addEdge(v1, v2);<br />
       Edge e2=g.addEdge(v2, v3);<br />
        Edge e3=g.addEdge(v3, v4);<br />
       Edge e4=g.addEdge(v4, v1);</p>
<p>       g.setEdgeWeight(e1,3.0);<br />
       g.setEdgeWeight(e2,5.0);<br />
       g.setEdgeWeight(e3,7.0);<br />
       g.setEdgeWeight(e4,8.0);</p>
<p>        return g;<br />
    }</p>
<p>}<br />
first i gave  4 words and their weights as input,and icoudn&#8217;t get graph for it.see my code and help me.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: redsandred</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-247</link>
		<dc:creator>redsandred</dc:creator>
		<pubDate>Thu, 08 Mar 2007 17:33:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-247</guid>
		<description>can u send me what u had done on this key word extraction by using textrank.please help me by sending ur code.iam doing it for my class project,but i coud&#039;nt get through well.so please help me to complete it.thanku.</description>
		<content:encoded><![CDATA[<p>can u send me what u had done on this key word extraction by using textrank.please help me by sending ur code.iam doing it for my class project,but i coud&#8217;nt get through well.so please help me to complete it.thanku.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: redsandred</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-246</link>
		<dc:creator>redsandred</dc:creator>
		<pubDate>Thu, 08 Mar 2007 03:36:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-246</guid>
		<description>ok ,thank u for ur help.i will contact  u if i had a problem.</description>
		<content:encoded><![CDATA[<p>ok ,thank u for ur help.i will contact  u if i had a problem.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: grant.ingersoll</title>
		<link>http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/comment-page-1/#comment-245</link>
		<dc:creator>grant.ingersoll</dc:creator>
		<pubDate>Thu, 08 Mar 2007 02:15:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.paperoftheweek.com/2007/01/31/discussion-of-section-3-of-textrank/#comment-245</guid>
		<description>I don&#039;t have code for that, as I said, it really is up to your application.  Personally, I would try something out.  See what happens when you weight nouns twice as much as other words.  I think the Mihalcea paper does a pretty decent job of explaining the different filtering mechanisms they use.  She (Mihalcea) has also published other papers on TextRank which might give you more insight.  The weight factors are assigned as you build the graph  

If you want me to look at some specific code that you wrote, I can do that at some point.  

Good luck!</description>
		<content:encoded><![CDATA[<p>I don&#8217;t have code for that, as I said, it really is up to your application.  Personally, I would try something out.  See what happens when you weight nouns twice as much as other words.  I think the Mihalcea paper does a pretty decent job of explaining the different filtering mechanisms they use.  She (Mihalcea) has also published other papers on TextRank which might give you more insight.  The weight factors are assigned as you build the graph  </p>
<p>If you want me to look at some specific code that you wrote, I can do that at some point.  </p>
<p>Good luck!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
