| Package | Description |
|---|---|
| org.aika | |
| org.aika.corpus | |
| org.aika.lattice | |
| org.aika.neuron |
| Modifier and Type | Field and Description |
|---|---|
Node |
Activation.Key.n |
| Modifier and Type | Field and Description |
|---|---|
Map<Integer,Node> |
Model.initialNodes |
| Modifier and Type | Method and Description |
|---|---|
boolean |
Activation.filter(Node n,
Integer rid,
Range r,
Range.Operator begin,
Range.Operator end,
InterprNode o,
InterprNode.Relation or) |
static Activation |
Activation.get(Document doc,
Node n,
Activation.Key ak) |
static Activation |
Activation.get(Document doc,
Node n,
Integer rid,
Range r,
Range.Operator begin,
Range.Operator end,
InterprNode o,
InterprNode.Relation or) |
static Stream |
Activation.getActivationsByRange(Node.ThreadState th,
Node n,
Integer rid,
Range r,
Range.Operator begin,
Range.Operator end,
InterprNode o,
InterprNode.Relation or) |
static Activation |
Activation.getNextSignal(Node n,
Document doc,
int from,
Integer rid,
InterprNode o,
boolean dir,
boolean inv) |
static Stream<Activation> |
Activation.select(Document doc,
Node n,
Integer rid,
Range r,
Range.Operator begin,
Range.Operator end,
InterprNode o,
InterprNode.Relation or) |
| Constructor and Description |
|---|
Activation(int id,
Node n,
Range pos,
Integer rid,
InterprNode o) |
Key(Node n,
Range r,
Integer rid,
InterprNode o) |
| Modifier and Type | Field and Description |
|---|---|
TreeSet<Node> |
Document.activatedNodes |
TreeSet<Node> |
Document.activatedNodesForTraining |
TreeSet<Node> |
Document.addedNodes |
TreeSet<Node> |
Document.Queue.queue |
| Modifier and Type | Method and Description |
|---|---|
void |
Document.Queue.add(Node n) |
| Modifier and Type | Class and Description |
|---|---|
class |
AndNode
The
InputNode and the AndNode classes together form a pattern lattice, containing all
possible substructures of any given conjunction. |
class |
InputNode
The
InputNode class is the input layer for the boolean logic. |
class |
OrNode |
| Modifier and Type | Field and Description |
|---|---|
Node |
OrNode.OrEntry.node |
| Modifier and Type | Field and Description |
|---|---|
TreeMap<Integer,TreeSet<Node>> |
OrNode.parents |
SortedMap<AndNode.Refinement,Node> |
AndNode.parents |
| Modifier and Type | Method and Description |
|---|---|
static Node |
Node.read(DataInput in,
Document doc) |
| Modifier and Type | Method and Description |
|---|---|
static SortedMap<AndNode.Refinement,Node> |
AndNode.computeNextLevelParents(Document doc,
Node pa,
AndNode.Refinement ref,
boolean discoverPatterns) |
| Modifier and Type | Method and Description |
|---|---|
void |
OrNode.addInput(Document doc,
Integer ridOffset,
Node in) |
static int |
Node.compare(Node a,
Node b) |
int |
Node.compareTo(Node n) |
static SortedMap<AndNode.Refinement,Node> |
AndNode.computeNextLevelParents(Document doc,
Node pa,
AndNode.Refinement ref,
boolean discoverPatterns) |
static AndNode |
AndNode.createNextLevelNode(Document doc,
Node n,
AndNode.Refinement ref,
boolean discoverPatterns) |
static void |
OrNode.processCandidate(Document doc,
Node parentNode,
Activation inputAct,
boolean train) |
void |
OrNode.removeInput(Document doc,
Integer ridOffset,
Node in) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
Node.computeAndParents(Document doc,
Integer offset,
SortedSet<AndNode.Refinement> inputs,
Map<AndNode.Refinement,Node> parents,
boolean discoverPatterns,
long v) |
| Constructor and Description |
|---|
OrEntry(Integer ridOffset,
Node node) |
ReverseAndRefinement(Node n,
Integer a,
Integer b) |
RSKey(Node pa,
Integer offset) |
| Constructor and Description |
|---|
AndNode(Document doc,
int level,
SortedMap<AndNode.Refinement,Node> parents) |
| Modifier and Type | Field and Description |
|---|---|
Node |
Neuron.node |
Copyright © 2017. All rights reserved.