Difference between revisions of "Vulcan/SystemPrototype"

From Knowitall
Jump to: navigation, search
(Status)
(Status)
Line 10: Line 10:
  
 
== Status ==  
 
== Status ==  
* <b>Score</b> The system outputs scores for each query predicate. If query is not in output then score is zero.
+
The MLN programs and output from Tuffy can be found here.
 +
 
 +
* <b>Knowledge:</b> Worked out the facts and rules required.
 +
* <b>Score: </b> The system outputs scores for each query predicate. If query is not in output then score is zero.
 +
* <b>Does it work?</b>
 
<blockquote>
 
<blockquote>
* <span style="background-color:yellow">Unable to materialize Nested tuples. Skipping this until this becomes necessary. The main reason we'd need this is to score the nested tuple. For now we can compute this from the score of its components: Score(nested_tuple) = Score(top tuple) * Score (nested)</span>
+
* In all three examples the correct answer is assigned higher score compared to the incorrect ones.
 +
* Facts inferred by larger number of steps have a lower score compared to those inferred by a smaller number of steps.
 
</blockquote>
 
</blockquote>
* <b>Knowledge:</b> Worked out the facts and rules required.
+
* <b>What other diagnostics do we have?</b>
<blockquote>
 
* Have a stub for evidence selection.
 
 
<blockquote>
 
<blockquote>
* Run with baseline implementation.  
+
* List inferred facts along with their probabilities.
* Output debug information.
+
* List the rules (first-order clauses in MLN lingo) that are reachable from the query fact.  
</blockquote>
 
 
</blockquote>
 
</blockquote>
* <b>Debug information</b> Tuffy doesn't have much diagnostics built in.
+
* <b> What diagnostics do we NOT have?</b>
 
<blockquote>
 
<blockquote>
* Need to know how the score is computed. <b>[To Do]</b>
+
* A reconstruction/visualization of the MLN network.
* Can compute ground facts (tuples) (including "hidden" i.e., new facts and their associated probabilites).
 
* We can currently print clauses (first-order rules) that are reachable from the query (KBMC style).
 
* Re-constructing exact instantiations of rules will take some additional work.  
 
 
</blockquote>
 
</blockquote>
* <b>Proposition generator</b> Check the output of Open IE 4.0 on the input sentence.
+
 
 +
* <b>What does this exercise suggest?</b>
 +
 
 
<blockquote>
 
<blockquote>
* Run as is.  
+
* <span style="background-color:yellow">Unable to materialize Nested tuples. Skipping this until this becomes necessary. The main reason we'd need this is to score the nested tuple. For now we can compute this from the score of its components: Score(nested_tuple) = Score(top tuple) * Score (nested)</span>
* Run with modified tuple.
 
 
</blockquote>
 
</blockquote>

Revision as of 19:17, 27 August 2013

Overview

The prototype is designed to work on three questions. We want the system to output the following:

  • Score for the input proposition.
  • New facts inferred.
  • Facts and rules used in scoring.

Status

The MLN programs and output from Tuffy can be found here.

  • Knowledge: Worked out the facts and rules required.
  • Score: The system outputs scores for each query predicate. If query is not in output then score is zero.
  • Does it work?
  • In all three examples the correct answer is assigned higher score compared to the incorrect ones.
  • Facts inferred by larger number of steps have a lower score compared to those inferred by a smaller number of steps.
  • What other diagnostics do we have?
  • List inferred facts along with their probabilities.
  • List the rules (first-order clauses in MLN lingo) that are reachable from the query fact.
  • What diagnostics do we NOT have?
  • A reconstruction/visualization of the MLN network.
  • What does this exercise suggest?
  • Unable to materialize Nested tuples. Skipping this until this becomes necessary. The main reason we'd need this is to score the nested tuple. For now we can compute this from the score of its components: Score(nested_tuple) = Score(top tuple) * Score (nested)