Comments on: Porter Stemming algorithm for search http://www.codediesel.com/php/porter-stemming-in-search/ /* PHP & MySQL Journal */ Fri, 27 Jan 2012 16:39:42 +0000 hourly 1 http://wordpress.org/?v=3.2.1 By: Porter Stemming algorithm for search : CodeDiesel http://www.codediesel.com/php/porter-stemming-in-search/comment-page-1/#comment-1202 Porter Stemming algorithm for search : CodeDiesel Sat, 02 May 2009 12:09:10 +0000 http://www.codediesel.com/?p=724#comment-1202 [...] Read more here: Porter Stemming algorithm for search : CodeDiesel [...] [...] Read more here: Porter Stemming algorithm for search : CodeDiesel [...]

]]> By: Sameer Borate’s Blog: Porter Stemming algorithm for search : Dragonfly Networks http://www.codediesel.com/php/porter-stemming-in-search/comment-page-1/#comment-1199 Sameer Borate’s Blog: Porter Stemming algorithm for search : Dragonfly Networks Thu, 30 Apr 2009 04:50:51 +0000 http://www.codediesel.com/?p=724#comment-1199 [...] a recent post to his blog Sameer looks at implementing a Stemming algorithm to search an array of words. It uses this library (as written by Richard [...] [...] a recent post to his blog Sameer looks at implementing a Stemming algorithm to search an array of words. It uses this library (as written by Richard [...]

]]> By: Sameer Borate’s Blog: Porter Stemming algorithm for search : WebNetiques, LLC : Website Developers in Minneapolis, MN http://www.codediesel.com/php/porter-stemming-in-search/comment-page-1/#comment-1198 Sameer Borate’s Blog: Porter Stemming algorithm for search : WebNetiques, LLC : Website Developers in Minneapolis, MN Thu, 30 Apr 2009 04:48:02 +0000 http://www.codediesel.com/?p=724#comment-1198 [...] a recent post to his blog Sameer looks at implementing a Stemming algorithm to search an array of words. It uses this library (as written by Richard [...] [...] a recent post to his blog Sameer looks at implementing a Stemming algorithm to search an array of words. It uses this library (as written by Richard [...]

]]> By: Ivo Jansch http://www.codediesel.com/php/porter-stemming-in-search/comment-page-1/#comment-1197 Ivo Jansch Wed, 29 Apr 2009 22:32:32 +0000 http://www.codediesel.com/?p=724#comment-1197 This is indeed a very useful algorithm. It's one of the algo's I use in http://flackr.net to match tweets. Since tweets have only a limited amount of words, comparing them by porterstem helps combine those that belong together. @guy: there is generally no need to output them. Like sameer said it's not possible, but regardless of that you generally don't need it. You use it internally to do the search comparisons; what you display are the actual search terms as entered by the user and the search results. This is indeed a very useful algorithm. It’s one of the algo’s I use in http://flackr.net to match tweets. Since tweets have only a limited amount of words, comparing them by porterstem helps combine those that belong together.

@guy: there is generally no need to output them. Like sameer said it’s not possible, but regardless of that you generally don’t need it. You use it internally to do the search comparisons; what you display are the actual search terms as entered by the user and the search results.

]]> By: Naz http://www.codediesel.com/php/porter-stemming-in-search/comment-page-1/#comment-1194 Naz Sun, 26 Apr 2009 15:39:10 +0000 http://www.codediesel.com/?p=724#comment-1194 This algorithm has a chance to match word about 60% at least php version. For example days of the week or months This algorithm has a chance to match word about 60% at least php version.
For example days of the week or months

]]> By: sameer http://www.codediesel.com/php/porter-stemming-in-search/comment-page-1/#comment-1191 sameer Thu, 23 Apr 2009 05:03:42 +0000 http://www.codediesel.com/?p=724#comment-1191 What you are trying to achieve is the reverse of Porter Stemming. Basically you want to generate inflections from the stem word which is not possible using this algorithm, as it is a simple algorithm without any dictionary lookup. To generate the word inflections as given by you will require a stemmer with a dictionary and understanding of some grammar. One possibility I could think of is to use a plain dictionary with the above algorithm and extract those words that reduce down to a particular stem. This words would be than the inflections of the original stem. For e.g to find the inflections of the word 'work' we would pass all the words starting with 'work' (or 'w' to make it simpler) through the stemmer and only select those that reduce down to 'work'. Its a crude method though, devoid of any understanding of verbs. Or go with <a target="_blank" href="http://www.nltk.org/Home" rel="nofollow">NLTK</a>. What you are trying to achieve is the reverse of Porter Stemming. Basically you want to generate inflections from the stem word which is not possible using this algorithm, as it is a simple algorithm without any dictionary lookup. To generate the word inflections as given by you will require a stemmer with a dictionary and understanding of some grammar.

One possibility I could think of is to use a plain dictionary with the above algorithm and extract those words that reduce down to a particular stem. This words would be than the inflections of the original stem. For e.g to find the inflections of the word ‘work’ we would pass all the words starting with ‘work’ (or ‘w’ to make it simpler) through the stemmer and only select those that reduce down to ‘work’. Its a crude method though, devoid of any understanding of verbs.

Or go with NLTK.

]]> By: Guy Patterson http://www.codediesel.com/php/porter-stemming-in-search/comment-page-1/#comment-1189 Guy Patterson Wed, 22 Apr 2009 17:34:16 +0000 http://www.codediesel.com/?p=724#comment-1189 How would you output the stems? In other words, based off your example, how would I output: blog blogging blogged blogger tip tips tipped tipping tipper late later latest work worker workers working Or is this even a possibility? Thanks, Guy https://www.nullamatix.com/pubkey.txt How would you output the stems? In other words, based off your example, how would I output:

blog
blogging
blogged
blogger

tip
tips
tipped
tipping
tipper

late
later
latest

work
worker
workers
working

Or is this even a possibility?

Thanks,

Guy
https://www.nullamatix.com/pubkey.txt

]]>