Update entities

IBO_to_XML.py

@@ -75,61 +75,61 @@ def IBO_to_XML(temp):
     return xml_output.strip()
 
 
-def sortTags(entities):    
+def sortTags(entities):
+    temp_entities = entities
     temp_counter = 0
     # For each entity, this loop will sort each tag of entitiy, first it will check if the
     # previous tags has same count of this tag, second will sort the tags and check if this tags is correct
-    for temp_entities in entities:
-        for entity in temp_entities[1]:
-            tags = entity.split()
-            for tag in tags:
-                # if the counter is not 0 then, will complete
-                if temp_counter != 0:
-                    # Check if this tag is equal I-, if yes then it will count how many tag in this tags and
-                    # count how many tag in previous tags
-                    if "I-" == tag[0:2]:
-                        counter_of_this_tag = 0
-                        counter_of_previous_tag = 0
-                        for word in tags:
-                            if tag.split("-")[1] in word:
-                                counter_of_this_tag+=1
-                        for word in entity[temp_counter-1][1].split():
-                            if tag.split("-")[1] in word:
-                                counter_of_previous_tag+=1
-                        # if the counter of previous tag is bigger than counter of this tag, then we
-                        # need to add I-tag in this tags
-                        if counter_of_previous_tag > counter_of_this_tag:
-                            tags.append("I-"+tag.split("-")[1])
-            # Sort the tags
-            tags.sort()
-            # Need to revers the tags because it should begins with I
-            tags.reverse()
-            # If the counter is not 0 then we can complete
+    for entity in temp_entities:
+        tags = entity[1].split()
+        for tag in tags:
+            # if the counter is not 0 then, will complete
             if temp_counter != 0:
-                this_tags = tags
-                previous_tags = entity[temp_counter - 1][1].split()
-                sorted_tags = list()
+                # Check if this tag is equal I-, if yes then it will count how many tag in this tags and
+                # count how many tag in previous tags
+                if "I-" == tag[0:2]:
+                    counter_of_this_tag = 0
+                    counter_of_previous_tag = 0
+                    for word in tags:
+                        if tag.split("-")[1] in word:
+                            counter_of_this_tag+=1
+                    for word in temp_entities[temp_counter-1][1].split():
+                        if tag.split("-")[1] in word:
+                            counter_of_previous_tag+=1
+                    # if the counter of previous tag is bigger than counter of this tag, then we
+                    # need to add I-tag in this tags
+                    if counter_of_previous_tag > counter_of_this_tag:
+                        tags.append("I-"+tag.split("-")[1])
+        # Sort the tags
+        tags.sort()
+        # Need to revers the tags because it should begins with I
+        tags.reverse()
+        # If the counter is not 0 then we can complete
+        if temp_counter != 0:
+            this_tags = tags
+            previous_tags = temp_entities[temp_counter - 1][1].split()
+            sorted_tags = list()
 
-                # Check if the this tag is not O and previous tags is not O, then will complete,
-                # if not then it will ignor this tag
-                if "O" not in this_tags and "O" not in previous_tags:
-                    index = 0
-                    #For each previous tags, need sort this tag by previous tags if its I, B we can ignor
-                    for i in previous_tags:
-                        j = 0
-                        while this_tags and j < len(this_tags):
-                            if this_tags[j][0:2] == "I-" and this_tags[j][2:] == i[2:]:
-                                sorted_tags.insert(index, this_tags.pop(j))
-                                break
-                            elif this_tags[j][0:2] == "B-":
-                                break
-                            j += 1
-                        index += 1
-                sorted_tags += this_tags
-                tags = sorted_tags
-            str_tag = " "
-            str_tag = str_tag.join(tags)
-            str_tag = str_tag.strip()
-            temp_entities[temp_counter][1] = str_tag
-            temp_counter += 1
+            # Check if the this tag is not O and previous tags is not O, then will complete,
+            # if not then it will ignor this tag
+            if "O" not in this_tags and "O" not in previous_tags:
+                index = 0
+                #For each previous tags, need sort this tag by previous tags if its I, B we can ignor
+                for i in previous_tags:
+                    j = 0
+                    while this_tags and j < len(this_tags):
+                        if this_tags[j][0:2] == "I-" and this_tags[j][2:] == i[2:]:
+                            sorted_tags.insert(index, this_tags.pop(j))
+                            break
+                        elif this_tags[j][0:2] == "B-":
+                            break
+                        j += 1
+                    index += 1
+            sorted_tags += this_tags
+            tags = sorted_tags
+        str_tag = " "
+        str_tag = str_tag.join(tags)
+        str_tag = str_tag.strip()
+        temp_entities[temp_counter][1] = str_tag
+        temp_counter += 1
     return temp_entities

app.py

@@ -148,9 +148,9 @@ def extract(sentence):
             list_of_tags = [i for i in list_of_tags if i not in ("O", " ", "")]
 
             if not list_of_tags:
-                item["tags"] = ["O"]
+                item["tags"] = "O"
             else:
-                item["tags"] = list_of_tags
+                item["tags"] = " ".join(list_of_tags)
             lists.append(item)
     return lists