| Package | Description |
|---|---|
| org.aika | |
| org.aika.corpus | |
| org.aika.lattice | |
| org.aika.neuron |
| Modifier and Type | Field and Description |
|---|---|
InterprNode |
Activation.Key.o |
| 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,
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 |
|---|---|
InterprNode |
Document.bottom |
InterprNode[] |
InterprNode.children |
InterprNode |
Conflicts.Conflict.conflict |
InterprNode |
InterprNode.largestCommonSubset |
static InterprNode |
InterprNode.MAX |
static InterprNode |
InterprNode.MIN |
InterprNode |
Conflicts.Key.o |
InterprNode[] |
InterprNode.parents |
InterprNode |
Conflicts.Conflict.primary |
InterprNode |
Conflicts.Conflict.secondary |
| Modifier and Type | Field and Description |
|---|---|
Set<InterprNode> |
InterprNode.linkedByLCS |
Map<Activation,InterprNode> |
InterprNode.orInterprNodes |
Set<InterprNode> |
InterprNode.refByOrInterprNode |
List<InterprNode> |
Document.selectedInterprNode |
| Modifier and Type | Method and Description |
|---|---|
static InterprNode |
InterprNode.add(Document doc,
boolean nonConflicting,
InterprNode... input) |
static InterprNode |
InterprNode.add(Document doc,
boolean nonConflicting,
List<InterprNode> inputs) |
static InterprNode |
InterprNode.addPrimitive(Document doc) |
| Modifier and Type | Method and Description |
|---|---|
static List<InterprNode> |
SearchNode.collectConflicts(Document doc) |
| Modifier and Type | Method and Description |
|---|---|
static void |
Conflicts.add(Document doc,
Activation act,
InterprNode primary,
InterprNode secondary) |
static InterprNode |
InterprNode.add(Document doc,
boolean nonConflicting,
InterprNode... input) |
static void |
InterprNode.addLink(InterprNode a,
InterprNode b) |
void |
InterprNode.addOrOption(Activation inputAct,
InterprNode n) |
static void |
Conflicts.collectAllConflicting(Collection<InterprNode> results,
InterprNode n,
long v) |
static void |
Conflicts.collectDirectConflicting(Collection<InterprNode> results,
InterprNode n) |
static int |
InterprNode.compare(InterprNode oa,
InterprNode ob) |
boolean |
InterprNode.Relation.compare(InterprNode a,
InterprNode b) |
int |
InterprNode.compareTo(InterprNode n) |
void |
InterprNode.computeLargestCommonSubsetIncremental(InterprNode no) |
boolean |
SearchNode.containedInSelectedBranch(long v,
InterprNode n) |
boolean |
InterprNode.contains(boolean dir,
InterprNode n,
boolean followLCS) |
boolean |
InterprNode.contains(InterprNode n,
boolean followLCS) |
static void |
Conflicts.remove(Document doc,
Activation act,
InterprNode primary,
InterprNode secondary) |
static void |
InterprNode.removeLink(InterprNode a,
InterprNode b) |
void |
InterprNode.removeOrOption(Activation inputAct,
InterprNode n) |
| Modifier and Type | Method and Description |
|---|---|
static InterprNode |
InterprNode.add(Document doc,
boolean nonConflicting,
List<InterprNode> inputs) |
Neuron.NormWeight |
Document.ValueQueue.adjustWeight(SearchNode cand,
List<InterprNode> changed) |
static void |
Conflicts.collectAllConflicting(Collection<InterprNode> results,
InterprNode n,
long v) |
void |
InterprNode.collectConflicts(Set<InterprNode> conflicts,
long v) |
static void |
Conflicts.collectDirectConflicting(Collection<InterprNode> results,
InterprNode n) |
static void |
InterprNode.computeRelations(List<InterprNode> parentsResults,
List<InterprNode> childrenResults,
List<InterprNode> inputs) |
static void |
InterprNode.computeRelations(List<InterprNode> parentsResults,
List<InterprNode> childrenResults,
List<InterprNode> inputs) |
static void |
InterprNode.computeRelations(List<InterprNode> parentsResults,
List<InterprNode> childrenResults,
List<InterprNode> inputs) |
static SearchNode |
SearchNode.createCandidate(Document doc,
List<InterprNode> changed,
SearchNode parent,
SearchNode selectedParent,
SearchNode excludedParent,
List<InterprNode> ref,
SearchNode.RefMarker marker) |
static SearchNode |
SearchNode.createCandidate(Document doc,
List<InterprNode> changed,
SearchNode parent,
SearchNode selectedParent,
SearchNode excludedParent,
List<InterprNode> ref,
SearchNode.RefMarker marker) |
| Constructor and Description |
|---|
Conflict(Activation act,
InterprNode primary,
InterprNode secondary,
InterprNode conflict) |
Key(InterprNode o,
Activation act) |
| Modifier and Type | Method and Description |
|---|---|
InterprNode |
OrNode.lookupOrOption(Document doc,
Range r,
boolean create) |
| Modifier and Type | Method and Description |
|---|---|
static void |
Node.addConflict(Document doc,
InterprNode io,
InterprNode o,
Activation act,
Collection<Activation> inputActs,
long v) |
static void |
AndNode.addNextLevelActivation(Document doc,
Activation act,
Activation secondAct,
AndNode nlp,
InterprNode conflict) |
void |
OrNode.apply(Document doc,
Activation act,
InterprNode conflict) |
abstract void |
Node.apply(Document doc,
Activation act,
InterprNode conflict) |
void |
InputNode.apply(Document doc,
Activation act,
InterprNode removedConflict) |
void |
AndNode.apply(Document doc,
Activation act,
InterprNode removedConflict) |
boolean |
OrNode.isAllowedOption(Document doc,
InterprNode n,
Activation act,
long v) |
abstract boolean |
Node.isAllowedOption(Document doc,
InterprNode n,
Activation act,
long v) |
boolean |
InputNode.isAllowedOption(Document doc,
InterprNode n,
Activation act,
long v) |
boolean |
AndNode.isAllowedOption(Document doc,
InterprNode n,
Activation act,
long v) |
void |
OrNode.propagateAddedActivation(Document doc,
Activation act,
InterprNode removedConflict) |
abstract void |
Node.propagateAddedActivation(Document doc,
Activation act,
InterprNode conflict) |
void |
InputNode.propagateAddedActivation(Document doc,
Activation act,
InterprNode removedConflict) |
void |
AndNode.propagateAddedActivation(Document doc,
Activation act,
InterprNode removedConflict) |
static void |
Node.removeConflict(Document doc,
InterprNode io,
InterprNode o,
Activation act,
Activation nAct,
long v) |
| Modifier and Type | Method and Description |
|---|---|
void |
InputNeuron.addInput(Document doc,
int begin,
int end,
Integer rid,
InterprNode o)
Propagate an input activation into the network.
|
void |
InputNeuron.addInput(Document doc,
int begin,
int end,
Integer rid,
InterprNode o,
double value)
Propagate an input activation into the network.
|
void |
InputNeuron.addInput(Document doc,
int begin,
int end,
InterprNode o)
Propagate an input activation into the network.
|
void |
InputNeuron.removeInput(Document doc,
int begin,
int end,
Integer rid,
InterprNode o) |
void |
InputNeuron.removeInput(Document doc,
int begin,
int end,
InterprNode o) |
Copyright © 2017. All rights reserved.