Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>There is no such function in standard SPARQL. However, SPARQL is extensible, so you can add your own functions if you want (of course, at the price of losing portability of your query). For example, see this <a href="http://rivuli-development.com/further-reading/sesame-cookbook/creating-custom-sparql-functions/" rel="nofollow">tutorial on how to do this in Sesame's SPARQL engine</a>. </p> <p>I also imagine that some triplestores with extended support for full-text search (like OWLIM, or Virtuoso) may have some built-in support for this kind of thing, but I do not know this for sure.</p> <p><strong>Edit</strong> </p> <p>Assuming you want something like Levenshtein distance, you could have a function <code>ex:ldistance(?string1, ?string2)</code> that given two strings outputs the distance. So <code>ex:ldistance("room", "root")</code> would return 1, <code>ex:ldistance("room", "door")</code> would return 2, and so on. You could then use this to query for a given distance, e.g. to get all strings that are closer than 2 to "room":</p> <pre><code>SELECT ?x ?string1 WHERE { ?x rdfsl:abel ?string1 FILTER(ex:ldistance("room", ?string1) &lt; 2) } </code></pre> <p>or returning all matching strings ordered by their distance:</p> <pre><code>SELECT ?x ?string1 ?ldistance WHERE { ?x rdfsl:abel ?string1 BIND ( ex:ldistance("room", ?string1) as ?ldistance) } ORDER BY ?ldistance </code></pre> <p>However, as said, the function <code>ex:ldistance</code> does not actually exist in SPARQL, so you will need to create it yourself, as an extension. </p>
    singulars
    1. This table or related slice is empty.
    1. POComparing two strings with SPARQL
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USJeen Broekstra
    1. USJeen Broekstra
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POComparing two strings with SPARQL
      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. VTUpMod
    1. COI didn't say that i'm using SPARQL in a OWLIM repository. I want a function that receiving 2 variables it say if those are close enough. When i say close i mean that a word needs the least number of changes to become as the second one so 2 words have to be similar as much as possible. Like when you use regex (e.g regex(?x, ?y, "i")) but with a different comparation.
      singulars
      1. PO
      1. USgiogix
    2. COYes. I understood that. Presumably you want something like Levenshtein or Jaro-Winkler. To repeat: there is no such function in standard SPARQL, but some triplestores may have some extensions for it - or you can create your own extension.
      singulars
      1. PO
      1. USJeen Broekstra
    3. COI've updated my answer with an example of how such a function might be used in SPARQL.
      singulars
      1. PO
      1. USJeen Broekstra
 

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