suffix-tree

Wikipedia defines a lot of possible emoticons people can use. I want to match this list to words in a string. I now have this: $string = "Lorem ipsum :-) dolor :-| samet"; $emoticons = array( '[HAPPY]' => array(' :-) ', ' :) ', ' :o) '), //etc... '[SAD]' => array(' :-( ', ' :( ', ' :-| ') ); foreach ($emoticons as $emotion => $icons) { $string = str_replace($icons, " $emotion ", $string); } echo $string; Output: Lorem ipsum [HAPPY] dolor [SAD] samet so in principle this works. However, I have two questions: As you can see, I'm putting spaces around each emoticon in the array, such as ' :-) '

I was trying to find the longest palindrome in a string. The brute force solution takes O(n^3) time. I read that there is a linear time algorithm for it using suffix trees. I am familiar with suffix trees and am comfortable building them. How do you use the built suffix tree to find the longest palindrome. I believe you need to proceed this way: Let y 1 y 2 ... y n be your string (where y i are letters). Create the generalized suffix tree of S f = y 1 y 2 ... y n $ and S r = y n y n - 1 ... y 1 # (reverse the letters and choose different ending characters for S f ($) and S r (#))... where S f

What would be the best approach (performance-wise) in solving this problem? I was recommended to use suffix trees. Is this the best approach? Have a look at http://en.wikipedia.org/wiki/Suffix_array as well - they are quite space-efficient and have some reasonably programmable algorithms to produce them, such as "Simple Linear Work Suffix Array Construction" by Karkkainen and Sanders user1071840 Check out this link: http://introcs.cs.princeton.edu/java/42sort/LRS.java.html /************************************************************************* * Compilation: javac LRS.java * Execution: java

From Section 15.2 of Programming Pearls The C codes can be viewed here: http://www.cs.bell-labs.com/cm/cs/pearls/longdup.c When I implement it in Python using suffix-array: example = open("iliad10.txt").read() def comlen(p, q): i = 0 for x in zip(p, q): if x[0] == x[1]: i += 1 else: break return i suffix_list = [] example_len = len(example) idx = list(range(example_len)) idx.sort(cmp = lambda a, b: cmp(example[a:], example[b:])) #VERY VERY SLOW max_len = -1 for i in range(example_len - 1): this_len = comlen(example[idx[i]:], example[idx[i+1]:]) print this_len if this_len > max_len: max_len =

I am looking for a Java implementation of the Generalized Suffix Tree (GST) with the following features: After the creation of the GST from say 1000 strings I would like find out how many of these 1000 strings contains some other string 's'. The search must be quiet fast, as I need to apply the search on about 100'000 candidate strings of average length 10. Try The Semantic Discovery Toolkit . It has an implementation on text/src/java/org/sd/text/radixtree There is a Java implementation of a Non-General Suffix Tree is available at: http://illya-keeplearning.blogspot.com/2009/04/suffix-trees

I need python library that can construct suffix trees and especially generalised suffix trees. Could you suggest me some libraries. Thanks. See the following libraries. suffixtree Python-Suffix-Tree SuffixTree SuffixTree (same name different project, supports generalized suffix trees) pysuffix (This is suffix arrays) 来源： https://stackoverflow.com/questions/9347078/python-library-for-generalized-suffix-trees