Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>I would start here: <a href="http://en.wikipedia.org/wiki/Longest_common_substring_problem" rel="noreferrer">http://en.wikipedia.org/wiki/Longest_common_substring_problem</a></p> <p>There are links to supplemental information in the external links, including Perl implementations of the two algorithms explained in the article.</p> <p>Edited to add:</p> <p>Based on the discussion, I still think Longest Common Substring could be at the heart of this problem. Even in the Journal example you reference in your comment, the defining characteristic of that set is the substring 'Journal'.</p> <p>I would first consider what defines a set as separate from the other sets. That gives you your partition to divide up the data, and then the problem is in measuring how much commonality exists within a set. If the defining characteristic is a common substring, then Longest Common Substring would be a logical starting point.</p> <p>To automate the process of set detection, in general, you will need a pairwise measure of commonality which you can use to measure the 'difference' between all possible pairs. Then you need an algorithm to compute the partition that results in the overall lowest total difference. If the difference measure is not Longest Common Substring, that's fine, but then you need to determine what it will be. Obviously it needs to be something concrete that you can measure.</p> <p>Bear in mind also that the properties of your difference measurement will bear on the algorithms that can be used to make the partition. For example, assume diff(X,Y) gives the measure of difference between X and Y. Then it would probably be useful if your measure of distance was such that diff(A,C) &lt;= diff(A,B) + diff(B,C). And obviously diff(A,C) should be the same as diff(C,A).</p> <p>In thinking about this, I also begin to wonder whether we could conceive of the 'difference' as a distance between any two strings, and, with a rigorous definition of the distance, could we then attempt some kind of <a href="http://en.wikipedia.org/wiki/Cluster_analysis" rel="noreferrer">cluster analysis</a> on the input strings. Just a thought.</p>
    singulars
    1. This table or related slice is empty.
    1. POHow can I detect common substrings in a list of strings
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USJeremy Bourque
    1. USJeremy Bourque
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POHow can I detect common substrings in a list of strings
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    1. COThis is helpful, but I think I'm closer to the Longest common subsequence problem as I may have several substrings (e.g. the Journal example)
      singulars
      1. PO
      1. USdanio
    2. COYes, possibly. When I first read your question I thought the 'sets' would be restricted to a single sub-string root, with various appendages. But I see now that you're looking for something more involved.
      singulars
      1. PO
      1. USJeremy Bourque
    3. COI will experiment to see how LCS works with multiple common substrings. Your new points about distance & clustering also looks like a good approach to try - thanks.
      singulars
      1. PO
      1. USdanio
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload