| Package | Description |
|---|---|
| org.aika.corpus | |
| org.aika.network.neuron | |
| org.aika.network.neuron.recurrent | |
| org.aika.network.neuron.simple.lattice |
| Modifier and Type | Field and Description |
|---|---|
Range |
Document.bottomRange |
static Range |
Range.MAX |
static Range |
Range.MIN |
Range |
Range.negation |
Range |
Document.topRange |
| Modifier and Type | Field and Description |
|---|---|
ArrayList<Range> |
Range.children |
ArrayList<Range> |
Range.parents |
Map<List<int[]>,Range> |
Document.ranges |
| Modifier and Type | Method and Description |
|---|---|
static Range |
Range.add(Document doc,
Range... input) |
Range |
Range.complement(Range r) |
static Range |
Range.create(Document doc,
int[] pos) |
static Range |
Range.create(Document doc,
int a,
int b) |
static Range |
Range.create(Document doc,
List<int[]> r) |
Range |
Range.intersection(Range r) |
| Modifier and Type | Method and Description |
|---|---|
List<Range> |
Range.select(Range.Relation rr) |
| Modifier and Type | Method and Description |
|---|---|
static Range |
Range.add(Document doc,
Range... input) |
static void |
Range.addLink(Range a,
Range b) |
void |
Range.collectOverlapping(List<Range> results,
Range r,
boolean test,
boolean includeAdjoined,
boolean onlyAfter,
long v) |
int |
Range.compareTo(Range r) |
Range |
Range.complement(Range r) |
boolean |
Range.contains(boolean dir,
Range n) |
boolean |
Range.contains(Range r) |
boolean |
Document.contains(Range r) |
int |
Range.Relation.estimateNodeCount(Range r) |
Range |
Range.intersection(Range r) |
static boolean |
Range.overlaps(Range ra,
Range rb,
boolean includeAdjoined,
boolean onlyAfter) |
static void |
Range.removeLink(Range a,
Range b) |
| Modifier and Type | Method and Description |
|---|---|
void |
Range.collect(List<Range> results,
boolean dir,
boolean includeFirst,
long v) |
void |
Range.collectOverlapping(List<Range> results,
Range r,
boolean test,
boolean includeAdjoined,
boolean onlyAfter,
long v) |
boolean |
Range.containedIn(Collection<Range> input) |
boolean |
Range.containedInAny(Collection<Range> input) |
boolean |
Range.containsAll(List<Range> input) |
boolean |
Range.outsideOfAll(Collection<Range> input) |
| Modifier and Type | Field and Description |
|---|---|
Range |
Activation.Key.pos |
| Modifier and Type | Method and Description |
|---|---|
void |
Input.addActivation(Iteration t,
Activation inputAct,
Range addedRange) |
static void |
Node.addActivationAndPropagate(Iteration t,
boolean processFirst,
Activation.Key ak,
Range addedRange,
Option initOption,
Set<Activation> inputActs,
Set<Activation> directInputActs) |
static Activation |
Activation.get(Node n,
Integer rid,
Range r,
Range.Relation rr,
Option o,
Option.Relation or,
Integer fired,
Integer id,
boolean includeShadowed) |
static Activation |
Activation.get(Node n,
Range r,
Option o) |
void |
Node.processRemovedActivations(Iteration t,
Activation act,
Range removedRange) |
void |
Neuron.propagateAddedActivation(Iteration t,
Activation act,
Range addedRange) |
void |
Node.propagateAddedActivation(Iteration t,
Activation act,
Range addedRange,
Option conflict) |
void |
Node.propagateRemovedActivation(Iteration t,
Activation act,
Range removedRange) |
void |
Neuron.propagateRemovedActivation(Iteration t,
Activation act,
Range removedRange) |
void |
Input.removeActivation(Iteration t,
Activation inputAct,
Range removedRange) |
static void |
Node.removeActivationAndPropagate(Iteration t,
boolean processFirst,
Activation act,
Range removedRange) |
Option |
Node.retrieveInitialOption(Range r,
Integer rid,
Option o) |
static List<Activation> |
Activation.select(Node n,
Integer rid,
Range r,
Range.Relation rr,
Option o,
Option.Relation or,
Option no,
Integer fired,
Integer id,
boolean includeShadowed) |
| Constructor and Description |
|---|
Activation(Node n,
Range pos,
int rid,
Option o,
int fired) |
Activation(Node n,
Range pos,
int rid,
Option o,
int fired,
int id) |
Key(Node n,
Range pos,
int rid,
Option o,
int fired) |
Key(Node n,
Range pos,
int rid,
Option o,
int fired,
int id) |
| Modifier and Type | Method and Description |
|---|---|
void |
RecurrentNode.addActivation(Iteration t,
Activation inputAct,
Range addedRange) |
void |
OutputNode.addActivation(Iteration t,
Activation inputAct,
Range addedRange) |
void |
ClockTerminationNode.addActivation(Iteration t,
Activation inputAct,
Range addedRange) |
void |
RecurrentNode.propagateAddedActivation(Iteration t,
Activation act,
Range addedRange,
Option conflict) |
void |
OutputNode.propagateAddedActivation(Iteration t,
Activation act,
Range addedRange,
Option conflict) |
void |
ClockTerminationNode.propagateAddedActivation(Iteration t,
Activation act,
Range addedRange,
Option conflict) |
void |
RecurrentNode.propagateRemovedActivation(Iteration t,
Activation act,
Range removedRange) |
void |
OutputNode.propagateRemovedActivation(Iteration t,
Activation act,
Range removedRange) |
void |
ClockTerminationNode.propagateRemovedActivation(Iteration t,
Activation act,
Range removedRange) |
void |
RecurrentNode.removeActivation(Iteration t,
Activation inputAct,
Range removedRange) |
void |
OutputNode.removeActivation(Iteration t,
Activation inputAct,
Range removedRange) |
void |
ClockTerminationNode.removeActivation(Iteration t,
Activation inputAct,
Range removedRange) |
| Modifier and Type | Method and Description |
|---|---|
static TreeMap<Range,Set<Conflicts.Key>> |
NegativeInputNode.getNegationSegments(Document doc,
Set<NegativeInputNode> nn,
Range r) |
| Modifier and Type | Method and Description |
|---|---|
void |
OrNode.addActivation(Iteration t,
Activation.Key ak,
Range addedRange,
Activation inputAct) |
void |
AndNode.addActivation(Iteration t,
Activation.Key ak,
Range addedRange,
Option initOption,
Set<Activation> inputActs,
Set<Activation> directInputActs) |
void |
InputNode.addActivation(Iteration t,
Activation inputAct,
Range addedRange) |
static void |
AndNode.addActivationsToNextLevelPattern(Iteration t,
LatticeNode firstNode,
Node secondNode,
AndNode.Refinement refinement,
Activation act,
Range addedRange,
Option conflict) |
void |
OrNode.expandToNextLevel(Iteration t,
Activation act,
Range addedRange,
Option conflict,
boolean train) |
abstract void |
LatticeNode.expandToNextLevel(Iteration t,
Activation act,
Range addedRange,
Option conflict,
boolean train) |
void |
InputNode.expandToNextLevel(Iteration t,
Activation act,
Range addedRange,
Option removedConflict,
boolean train) |
void |
AndNode.expandToNextLevel(Iteration t,
Activation act,
Range addedRange,
Option conflict,
boolean train) |
static TreeMap<Range,Set<Conflicts.Key>> |
NegativeInputNode.getNegationSegments(Document doc,
Set<NegativeInputNode> nn,
Range r) |
static void |
OrNode.processCandidate(Iteration t,
LatticeNode parentNode,
Activation act,
Range addedRange,
Option conflict,
boolean train) |
static void |
AndNode.processCandidate(Iteration t,
LatticeNode firstNode,
Node secondNode,
AndNode.Refinement refinement,
Activation act,
Range addedRange,
Option conflict,
boolean train) |
void |
NegativeInputNode.propagateAddedActivation(Iteration t,
Activation act,
Range addedRange,
Option conflict) |
void |
LatticeNode.propagateAddedActivation(Iteration t,
Activation act,
Range addedRange,
Option conflict) |
void |
NegativeInputNode.propagateRemovedActivation(Iteration t,
Activation act,
Range removedRange) |
void |
LatticeNode.propagateRemovedActivation(Iteration t,
Activation act,
Range removedRange) |
protected void |
AndNode.removeActivation(Iteration t,
Activation.Key ak,
Range removedRange) |
protected void |
OrNode.removeActivation(Iteration t,
Activation act,
Range removedRange) |
void |
InputNode.removeActivation(Iteration t,
Activation inputAct,
Range removedRange) |
void |
LatticeNode.removeFromNextLevel(Iteration t,
Activation iAct,
Range removedRange) |
Copyright © 2016. All rights reserved.