{"id":1068,"date":"2018-09-16T07:14:22","date_gmt":"2018-09-16T01:44:22","guid":{"rendered":"http:\/\/www.rangakrish.com\/?p=1068"},"modified":"2018-09-16T07:24:49","modified_gmt":"2018-09-16T01:54:49","slug":"dependency-graph-to-rdf","status":"publish","type":"post","link":"https:\/\/www.rangakrish.com\/index.php\/2018\/09\/16\/dependency-graph-to-rdf\/","title":{"rendered":"Dependency Graph to RDF"},"content":{"rendered":"

Dependency parsing<\/strong><\/em><\/a> is widely used these days, and many NLP tools give a dependency graph as the parsed representation of the input text. See for example, SpacY<\/strong><\/em><\/a> and TextRazor<\/strong><\/em><\/a>.\u00a0 <\/span>The following is the dependency tree corresponding to the sentence Mary is drinking cold water<\/strong><\/em>:<\/p>\n

\"Dependency<\/a>
Dependency Graph<\/strong><\/figcaption><\/figure>\n

The above tree was generated using SpacY<\/em><\/a><\/strong>. You can see that the arrow points from the dependent word to its head word, and each arrow has a label denoting the relationship between the head word and its dependent (some use the opposite convention, where the arrow points from head word to dependent). The above graph (actually, a tree) can be represented as a collection of triples as follows (not a formal RDF):<\/p>\n

(drinking aux is)<\/span><\/p>\n

(drinking nubj Mary)<\/span><\/p>\n

(water dobj drinking)<\/span><\/p>\n

(water amod cold)<\/span><\/p><\/blockquote>\n

This is not the only way, but you get the idea. Expressed this way, we can immediately see the similarities between the dependency graph and RDF<\/strong><\/em><\/a>\u00a0used in Semantic Web<\/strong><\/em><\/a>. If we are able to convert the dependency graph to RDF, we can then take advantage of a large number of tools that are available to operate on the RDF graph. Tools such as Jena <\/strong><\/em><\/a>and AllegroGraph<\/strong><\/em><\/a> are known for handling very large data sets, and come bundled with support for SPARQL<\/strong><\/em><\/a> query language and efficient Reasoners<\/strong><\/em><\/a>.<\/p>\n

Before attempting the conversion, we have to be clear about what information needs to be carried over from the dependency representation. Here is my list:<\/p>\n

1) We should have some unique IDs for the different sentences. So if someone wants to know which sentences contain, for example, the word “likes”, this information should be available. To take an even simpler example, we should be able to answer the question “How many sentences are there in the given text?”.<\/span><\/p>\n

2) Each occurrence of a word must have a unique ID. To amplify, if the same word occurs multiple times in the same sentence, its IDs must be different.<\/span><\/p>\n

3) Obviously, we need to capture the <head-word, dependency, dependent-word> relationship.<\/span><\/p>\n

4) I feel it is useful to keep track of the part-of-speech (POS<\/strong><\/em>) of each occurrence of a word. Remember that a word such as “sleep” could act as a Noun<\/strong><\/em> in one place and Verb<\/strong><\/em> in another.\u00a0<\/span><\/span><\/p>\n

5) The lemma (root form) of each word could also prove useful. This way, we can search for sentences that have the lemma “be”, without worrying about whether it is “is” or “was”.<\/span><\/p><\/blockquote>\n

When converting to RDF, we have to remember that there are many serialization formats<\/strong><\/em>, not just one. Common formats are Turtle, N-triples, N-Quads, N3, RDF\/XML, and RDF\/JSON<\/strong><\/em>. I chose Turtle<\/strong><\/em><\/a> as my output format.<\/p>\n

Another design decision is to use an appropriate Namespace<\/strong><\/em> for qualifying the different URIs. Again, to simplify my work and to get started quickly, I have used my own namespace for the URIs. Although not critical at this point, I feel this aspect has to be addressed eventually.<\/p>\n

Let us consider the simple sentence: John loves Mary.<\/strong><\/em><\/p>\n

Here is the Turtle representation generated by my converter:<\/p>\n

\n
# Dependency Graph Representation in Turtle Format.<\/span><\/div>\n
<\/div>\n
@prefix m: <http:\/\/mmsindia\/depgraph\/example\/> .<\/span><\/div>\n
<\/div>\n
m:sent-1 m:word m:word-250 .<\/span><\/div>\n
m:word-250 m:pos “NNP” .<\/span><\/div>\n
m:word-250 m:lemma “john” .<\/span><\/div>\n
m:word-251 m:nsubj m:word-250 .<\/span><\/div>\n
<\/div>\n
m:sent-1 m:word m:word-251 .<\/span><\/div>\n
m:word-251 m:pos “VBZ” .<\/span><\/div>\n
m:word-251 m:lemma “love” .<\/span><\/div>\n
m:word-251 m:ROOT m:word-251 .<\/span><\/div>\n
<\/div>\n
m:sent-1 m:word m:word-252 .<\/span><\/div>\n
m:word-252 m:pos “NNP” .<\/span><\/div>\n
m:word-252 m:lemma “mary” .<\/span><\/div>\n
m:word-251 m:dobj m:word-252 .<\/span><\/div>\n
<\/div>\n
m:sent-1 m:word m:word-253 .<\/span><\/div>\n
m:word-253 m:pos “.” .<\/span><\/div>\n
m:word-253 m:lemma “.” .<\/span><\/div>\n
m:word-251 m:punct m:word-253 .<\/span><\/div>\n
<\/div>\n
m:word-250 m:label “John” .<\/span><\/div>\n
m:word-251 m:label “loves” .<\/span><\/div>\n
m:word-252 m:label “Mary” .<\/span><\/div>\n
m:word-253 m:label “.” .<\/span><\/div>\n<\/blockquote>\n

There is a triple of the form {m:sent-<id> m:word m:word-<id>}<\/strong><\/em> for each word in the text. The word-<id><\/strong><\/em> has a unique value for every occurrence of a word. Hence for each word-<id><\/strong><\/em>, we also have the corresponding lemma<\/strong><\/em> of the word and its POS<\/strong><\/em>. You will also notice that the last section enumerates all the word instances as triples of the form {m:word-<id> m:label <literal>}<\/strong><\/em>.\u00a0<\/span><\/p>\n

I think the conversion logic is easy to understand.\u00a0As I mentioned earlier, once we obtain the RDF representation, we can do many interesting things with it.<\/span><\/p>\n

In the next post, I will show how we can import this data into a graph database (AllegroGraph<\/strong><\/em><\/a>) and query the graph.<\/p>\n

I implemented the conversion logic in Python<\/strong><\/em>. The program uses SpacY<\/strong><\/em><\/a> to parse input text and convert the corresponding dependency graph to Turtle<\/strong><\/em> format. The input file and output files are passed as command line parameters to the program. You can download the python program here<\/strong><\/em><\/a>. A sample input file<\/strong><\/em><\/a>\u00a0containing multiple sentences and the corresponding TTL file<\/strong><\/em><\/a> are also available for download.<\/p>\n

Have a nice weekend!<\/p>\n","protected":false},"excerpt":{"rendered":"

Dependency parsing is widely used these days, and many NLP tools give a dependency graph as the parsed representation of the input text. See for example, SpacY and TextRazor.\u00a0 The following is the dependency tree corresponding to the sentence Mary is drinking cold water: The above tree was generated using SpacY. You can see that […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[107,17,103],"tags":[156,74,153,154,155],"class_list":["post-1068","post","type-post","status-publish","format-standard","hentry","category-natural-language-processing","category-programming","category-python","tag-dependency-graph","tag-nlp","tag-rdf","tag-semantic-web","tag-turtle"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p9OLnF-he","jetpack-related-posts":[{"id":1078,"url":"https:\/\/www.rangakrish.com\/index.php\/2018\/09\/30\/dependency-graph-to-rdf-part-2\/","url_meta":{"origin":1068,"position":0},"title":"Dependency Graph to RDF – Part 2","author":"admin","date":"September 30, 2018","format":false,"excerpt":"In the last post, I outlined an approach to convert a dependency graph (the result of dependency parsing) to RDF. The particular RDF format I used is Turtle, which is widely supported. Today, I would like to show how to load this RDF data in a Semantic\u00a0 Graph database and\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"Browser View","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/09\/Checking-the-server.png?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/09\/Checking-the-server.png?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/09\/Checking-the-server.png?resize=525%2C300&ssl=1 1.5x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/09\/Checking-the-server.png?resize=700%2C400&ssl=1 2x"},"classes":[]},{"id":328,"url":"https:\/\/www.rangakrish.com\/index.php\/2016\/09\/11\/natural-language-processing-in-mathematica\/","url_meta":{"origin":1068,"position":1},"title":"Natural Language Processing in Mathematica","author":"admin","date":"September 11, 2016","format":false,"excerpt":"Welcome back. Today I am going to share with you some of the nice capabilities of Mathematica in the area of Natural Language Processing (NLP). Let us start with words. What if we wish to know\u00a0the various definitions of the word image?\u00a0Here is the answer. Mathematica gives the various senses\u2026","rel":"","context":"In "Mathematica"","block_context":{"text":"Mathematica","link":"https:\/\/www.rangakrish.com\/index.php\/category\/mathematica\/"},"img":{"alt_text":"Word Definition","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2016\/09\/word-data1-1024x238.png?resize=350%2C200","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2016\/09\/word-data1-1024x238.png?resize=350%2C200 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2016\/09\/word-data1-1024x238.png?resize=525%2C300 1.5x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2016\/09\/word-data1-1024x238.png?resize=700%2C400 2x"},"classes":[]},{"id":912,"url":"https:\/\/www.rangakrish.com\/index.php\/2018\/04\/22\/question-answering-using-dependency-trees\/","url_meta":{"origin":1068,"position":2},"title":"Question Answering\u00a0Using Dependency Trees","author":"admin","date":"April 22, 2018","format":false,"excerpt":"A few weeks ago I had written about my brief experiment with Mathematica's new feature, which provides answers to questions based on given text. After that post, I spent some time thinking about how to implement something similar. In today's post, I want to show you what I have been\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"Dependency Tree","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/04\/Deptree-example.png?resize=350%2C200","width":350,"height":200},"classes":[]},{"id":3660,"url":"https:\/\/www.rangakrish.com\/index.php\/2025\/04\/11\/using-claude-to-generate-rdf-triples\/","url_meta":{"origin":1068,"position":3},"title":"Using Claude to Generate RDF Triples","author":"admin","date":"April 11, 2025","format":false,"excerpt":"We all know that LLMs are now capable of generating structured data. I have used OpenAI models earlier to generate Tables and JSON data, but this time I wanted to try a more complex example.\u00a0 As someone interested in Homeopathy, I wanted to generate remedy descriptions as RDF triples, in\u2026","rel":"","context":"In "Homeopathy"","block_context":{"text":"Homeopathy","link":"https:\/\/www.rangakrish.com\/index.php\/category\/homeopathy\/"},"img":{"alt_text":"Lycopodium TTL Format","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2025\/04\/Lyco-300x232.png?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2025\/04\/Lyco-300x232.png?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2025\/04\/Lyco-300x232.png?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":1863,"url":"https:\/\/www.rangakrish.com\/index.php\/2020\/01\/02\/book-review-automatic-text-simplification\/","url_meta":{"origin":1068,"position":4},"title":"Book Review – Automatic Text Simplification","author":"admin","date":"January 2, 2020","format":false,"excerpt":"Title: Automatic Text Simplification Author: Horacio Saggino Publisher: Morgan & Claypool Publishers Year: 2017 Automatic Text Simplification is an active area of research in NLP and has been going on for over 20 years. The idea is to transform a given text T1 into text T2 such that T2 is\u2026","rel":"","context":"In "Book Review"","block_context":{"text":"Book Review","link":"https:\/\/www.rangakrish.com\/index.php\/category\/book-review\/"},"img":{"alt_text":"Automatic Text Simplification","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2020\/01\/IMG_1496-edited-225x300.jpeg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":285,"url":"https:\/\/www.rangakrish.com\/index.php\/2016\/07\/22\/using-julia-to-interact-with-mathematica\/","url_meta":{"origin":1068,"position":5},"title":"Using Julia to Interact with Mathematica","author":"admin","date":"July 22, 2016","format":false,"excerpt":"Mathematica is a powerful environment for symbolic and numerical computation. I have been using it for many years now. In this post\u00a0I had explained how we can use Mathematica bundled with Raspberry distribution to control littleBits devices. When I saw that there is support in Julia for interacting with Mathematica,\u2026","rel":"","context":"In "Julia"","block_context":{"text":"Julia","link":"https:\/\/www.rangakrish.com\/index.php\/category\/julia\/"},"img":{"alt_text":"Julia Session","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2016\/07\/Julia-1.png?resize=350%2C200","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2016\/07\/Julia-1.png?resize=350%2C200 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2016\/07\/Julia-1.png?resize=525%2C300 1.5x"},"classes":[]}],"_links":{"self":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/1068","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/comments?post=1068"}],"version-history":[{"count":0,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/1068\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/media?parent=1068"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/categories?post=1068"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/tags?post=1068"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}