getting close to done with persona crap

FultonBrowne · Feb 2, 2020 · d0e01cb · d0e01cb
1 parent 5a510e1
commit d0e01cb
Show file tree

Hide file tree

Showing 2 changed files with 40 additions and 1 deletion.
diff --git a/src/main/java/com/andromeda/araserver/persona/Main.kt b/src/main/java/com/andromeda/araserver/persona/Main.kt
@@ -13,7 +13,7 @@ class Main {
         val pairs =
             ArrayList(listOf(*mainVal.split("&").toTypedArray()))
         term = pairs[0].replace("dial ", "")
-        val topics = graph?.let { SortWords(keyWord, term).getTopics(it) }
+        val topics = graph?.let { SortWords(keyWord, term).getNN(it) }
         println(topics)
         return ""
     }

diff --git a/src/main/java/com/andromeda/araserver/util/SortWords.kt b/src/main/java/com/andromeda/araserver/util/SortWords.kt
@@ -191,6 +191,16 @@ class SortWords(keyWord: KeyWord, mainVal: String) {
         }
         return toReturn
     }
+    private fun sortForNN(graph: Parse): ArrayList<WordGraph> {
+        var toReturn = ArrayList<WordGraph>()
+        for (i in graph.children!!) {
+            if (i.type == "NN" ) {
+                toReturn.add(WordGraph(i.coveredText, "NN"))
+            }
+            if (i.childCount > 0) toReturn.addAll(sortForNN(i))
+        }
+        return toReturn
+    }
     private fun sorter(graph: Parse, type:String): Boolean {
         var toReturn = false
         for (i in graph.children){
@@ -212,5 +222,34 @@ class SortWords(keyWord: KeyWord, mainVal: String) {
         return toReturn
     }
 
+    fun getNN(parse: Parser): ArrayList<WordGraph> {
+        val toReturn = ArrayList<WordGraph>()
+
+        var graph = key.getKeyWords(mainText,parse)?.get(0)
+
+
+        var working = true
+        if (graph != null) {
+            while (working) {
+                graph?.show()
+                when (graph?.childCount) {
+                    1 -> graph = graph.children?.get(0)
+                    0 -> working = false
+                    else -> {
+                        if (graph != null) {
+                            val toTest = sortForNN(graph)
+                            toReturn.addAll(toTest)
+                        }
+                        working = false
+                    }
+                }
+            }
+        } else {
+            print("null")
+            println("fail")
+        }
+        return toReturn
+    }
+
 
 }