com.articulate.sigma

Class DependencyConverter

java.lang.Object

com.articulate.sigma.DependencyConverter

public class DependencyConverter
extends java.lang.Object

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
class	DependencyConverter.Node

Field Summary

Fields

Modifier and Type	Field and Description
static java.util.HashSet<java.lang.String>	femaleNames
static KB	kb
static java.util.HashSet<java.lang.String>	maleNames
static java.util.List<java.lang.String>	MONTHS
static java.lang.StringBuffer	output

Constructor Summary

Constructors

Constructor and Description
DependencyConverter()

Method Summary

Modifier and Type	Method and Description
void	addNode(java.lang.String dep, java.util.HashMap<java.lang.String,DependencyConverter.Node> index)
DependencyConverter.Node	createGraph(java.util.ArrayList<java.lang.String> deps)
DependencyConverter.Node	findRoot(java.util.HashMap<java.lang.String,DependencyConverter.Node> index)
static java.lang.String	formatSUMO(java.util.HashSet<java.lang.String> SUMO)
static java.lang.String	getArg(int argnum, java.lang.String line)
static java.util.ArrayList<java.lang.String>	getDependencies(java.lang.String input) Get the output of the Stanford Dependency Parser for the given input file.
static boolean	isModal(java.lang.String arg)
static void	main(java.lang.String[] args)
static java.util.HashMap<java.lang.String,java.lang.String>	processDependency(DependencyConverter.Node n) Process one grammatical dependency statements from the Stanford parser into a logical expression using SUMO terms.
static void	readFirstNames() Read the FirstNames.cvs file into maleName and femaleNames
static java.util.ArrayList<java.lang.String>	splitSentences(java.lang.String infile) Run the Stanford NLP tools on the given text file to split a text into sentences.
static void	test(java.lang.String input) Take in a single quoted sentence from the command line and print out its dependency parse.
void	traverseNodes(DependencyConverter.Node root)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

MONTHS

public static final java.util.List<java.lang.String> MONTHS

kb

public static KB kb

output

public static java.lang.StringBuffer output

maleNames

public static java.util.HashSet<java.lang.String> maleNames

femaleNames

public static java.util.HashSet<java.lang.String> femaleNames

Constructor Detail

DependencyConverter

public DependencyConverter()

Method Detail

isModal

public static boolean isModal(java.lang.String arg)

getArg

public static java.lang.String getArg(int argnum,
                                      java.lang.String line)

getDependencies

public static java.util.ArrayList<java.lang.String> getDependencies(java.lang.String input)
                                                             throws java.io.IOException

Get the output of the Stanford Dependency Parser for the given input file.

Throws:

java.io.IOException

splitSentences

public static java.util.ArrayList<java.lang.String> splitSentences(java.lang.String infile)
                                                            throws java.io.IOException

Run the Stanford NLP tools on the given text file to split a text into sentences.

Parameters:

infile - the fully qualified filename of the input file

Throws:

java.io.IOException

readFirstNames

public static void readFirstNames()

Read the FirstNames.cvs file into maleName and femaleNames

processDependency

public static java.util.HashMap<java.lang.String,java.lang.String> processDependency(DependencyConverter.Node n)

Process one grammatical dependency statements from the Stanford parser into a logical expression using SUMO terms. Use the context parameter from the given Node as needed to interpret the context of the individual relation. Generate and return a new context to be inherited by child nodes.

traverseNodes

public void traverseNodes(DependencyConverter.Node root)

addNode

public void addNode(java.lang.String dep,
                    java.util.HashMap<java.lang.String,DependencyConverter.Node> index)

findRoot

public DependencyConverter.Node findRoot(java.util.HashMap<java.lang.String,DependencyConverter.Node> index)

createGraph

public DependencyConverter.Node createGraph(java.util.ArrayList<java.lang.String> deps)

formatSUMO

public static java.lang.String formatSUMO(java.util.HashSet<java.lang.String> SUMO)

test

public static void test(java.lang.String input)

Take in a single quoted sentence from the command line and print out its dependency parse.

main

public static void main(java.lang.String[] args)