|
AROMA 1.2 | |||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use MatchingRelation | |
---|---|
fr.inrialpes.exmo.aroma | |
fr.inrialpes.exmo.aroma.algorithms | |
fr.inrialpes.exmo.aroma.alignment | |
fr.inrialpes.exmo.aroma.measures.entitybased |
Uses of MatchingRelation in fr.inrialpes.exmo.aroma |
---|
Method parameters in fr.inrialpes.exmo.aroma with type arguments of type MatchingRelation | |
---|---|
private Thread |
AROMA.getAlignThread(AEntity root1,
AEntity root2,
Set<MatchingRelation> align)
|
Uses of MatchingRelation in fr.inrialpes.exmo.aroma.algorithms |
---|
Fields in fr.inrialpes.exmo.aroma.algorithms with type parameters of type MatchingRelation | |
---|---|
private Set<MatchingRelation> |
ImplicationDiscovery.correspondences
|
Methods in fr.inrialpes.exmo.aroma.algorithms that return types with arguments of type MatchingRelation | |
---|---|
static Set<MatchingRelation> |
PostAlgorithms.deduceEquivalences(Set<MatchingRelation> align,
Set<Implication> st,
Set<Implication> ts,
AlignmentFactory af)
|
static Set<MatchingRelation> |
PostAlgorithms.hSelect(Set<MatchingRelation> s)
Hungrian algorithm which select the matching subset. |
static Set<MatchingRelation> |
PostAlgorithms.removeCycles(Set<MatchingRelation> smr,
AlignmentFactory af)
|
static Set<MatchingRelation> |
PostAlgorithms.removeRedundancy(Set<MatchingRelation> smr)
|
static Set<MatchingRelation> |
PostAlgorithms.retainMax(Set<MatchingRelation> s,
boolean functional,
boolean bidirectional)
Algorithm which only retain, for each entity, the best relations. |
Methods in fr.inrialpes.exmo.aroma.algorithms with parameters of type MatchingRelation | |
---|---|
private static void |
PostAlgorithms.addEntity2Rel(AEntity ent,
MatchingRelation mr,
Map<AEntity,Set<MatchingRelation>> ent2Rel)
|
static AEntity |
PostAlignment.getObject(MatchingRelation mr,
boolean object1)
|
Method parameters in fr.inrialpes.exmo.aroma.algorithms with type arguments of type MatchingRelation | |
---|---|
private static void |
PostAlgorithms.addEntity2Rel(AEntity ent,
MatchingRelation mr,
Map<AEntity,Set<MatchingRelation>> ent2Rel)
|
static void |
PostAlignment.alignParentWhenChildrenMatch(AEntity h1,
AEntity h2,
Set<MatchingRelation> s,
AlignmentFactory af)
|
static void |
PostAlignment.alignSyntax(AEntity h1,
AEntity h2,
Set<MatchingRelation> s,
AlignmentFactory af,
fr.inrialpes.exmo.ontosim.Measure<fr.inrialpes.exmo.ontosim.entity.model.Entity<?>> lexicalM,
double threshold)
|
private static void |
PostAlgorithms.analyzeCycles(AlignmentFactory af,
Set<MatchingRelation> s1,
Set<MatchingRelation> s2,
Set<MatchingRelation> toRemove,
Set<MatchingRelation> toAdd)
|
private static void |
PostAlgorithms.analyzeCycles(AlignmentFactory af,
Set<MatchingRelation> s1,
Set<MatchingRelation> s2,
Set<MatchingRelation> toRemove,
Set<MatchingRelation> toAdd)
|
private static void |
PostAlgorithms.analyzeCycles(AlignmentFactory af,
Set<MatchingRelation> s1,
Set<MatchingRelation> s2,
Set<MatchingRelation> toRemove,
Set<MatchingRelation> toAdd)
|
private static void |
PostAlgorithms.analyzeCycles(AlignmentFactory af,
Set<MatchingRelation> s1,
Set<MatchingRelation> s2,
Set<MatchingRelation> toRemove,
Set<MatchingRelation> toAdd)
|
static void |
PostAlignment.closure(Set<MatchingRelation> s,
AlignmentFactory af)
|
static Set<MatchingRelation> |
PostAlgorithms.deduceEquivalences(Set<MatchingRelation> align,
Set<Implication> st,
Set<Implication> ts,
AlignmentFactory af)
|
static void |
PostAlignment.eqLabelAlign(AEntity h1,
AEntity h2,
Set<MatchingRelation> s,
AlignmentFactory af)
|
static void |
PostAlignment.eqLabelAlign2(AEntity h1,
AEntity h2,
Set<MatchingRelation> s,
int threshold,
AlignmentFactory af)
|
static void |
PostAlignment.eqLabelAlign2(Set<AEntity> notAlignedh1,
Set<AEntity> notAlignedh2,
Set<MatchingRelation> s,
int threshold,
AlignmentFactory af)
|
static void |
PostAlignment.eqLabelAlign3(AEntity h1,
AEntity h2,
Set<MatchingRelation> s,
int threshold,
AlignmentFactory af)
|
static void |
PostAlignment.eqLabelAlign3(Set<AEntity> notAlignedh1,
Set<AEntity> notAlignedh2,
Set<MatchingRelation> s,
int threshold,
AlignmentFactory af)
|
static Set<AEntity> |
PostAlignment.getMatched(Set<MatchingRelation> s)
|
static Set<AEntity> |
PostAlignment.getNotMatched(AEntity h,
boolean direct,
Set<MatchingRelation> s)
|
static Set<MatchingRelation> |
PostAlgorithms.hSelect(Set<MatchingRelation> s)
Hungrian algorithm which select the matching subset. |
static void |
PostAlignment.incLabelAlign(AEntity h1,
AEntity h2,
Set<MatchingRelation> s,
int threshold,
AlignmentFactory af)
|
static void |
PostAlignment.incLabelAlign(Set<AEntity> notAlignedh1,
Set<AEntity> notAlignedh2,
Set<MatchingRelation> s,
int threshold,
AlignmentFactory af)
|
static Map<AEntity,Set<AEntity>> |
PostAlignment.ranges(Set<MatchingRelation> s)
built a map between each object and its correspondent entities according the implication relation |
static Set<MatchingRelation> |
PostAlgorithms.removeCycles(Set<MatchingRelation> smr,
AlignmentFactory af)
|
static void |
PostAlgorithms.removeLowRelations(Set<MatchingRelation> s,
double seuil)
|
static Set<MatchingRelation> |
PostAlgorithms.removeRedundancy(Set<MatchingRelation> smr)
|
static Set<MatchingRelation> |
PostAlgorithms.retainMax(Set<MatchingRelation> s,
boolean functional,
boolean bidirectional)
Algorithm which only retain, for each entity, the best relations. |
Constructor parameters in fr.inrialpes.exmo.aroma.algorithms with type arguments of type MatchingRelation | |
---|---|
ImplicationDiscovery(AEntity a1,
AEntity a2,
AlignmentFactory af,
Set<MatchingRelation> correspondences)
|
|
ImplicationDiscovery(AEntity a1,
AEntity a2,
AlignmentFactory af,
Set<MatchingRelation> correspondences,
double threshold)
|
Uses of MatchingRelation in fr.inrialpes.exmo.aroma.alignment |
---|
Subclasses of MatchingRelation in fr.inrialpes.exmo.aroma.alignment | |
---|---|
class |
Equivalence
|
class |
Implication
|
Methods in fr.inrialpes.exmo.aroma.alignment with parameters of type MatchingRelation | |
---|---|
abstract boolean |
MatchingRelation.isGenerativeOf(MatchingRelation rel)
|
boolean |
Implication.isGenerativeOf(MatchingRelation rel)
Is the implication generative of the implication imp (given in parameter) -> A is generative of B if A.source >= B.source and A.target <= B.target |
boolean |
Equivalence.isGenerativeOf(MatchingRelation rel)
|
Method parameters in fr.inrialpes.exmo.aroma.alignment with type arguments of type MatchingRelation | |
---|---|
boolean |
Implication.hasBestAndGenerativeImplication(Set<? extends MatchingRelation> rels)
verifies that this implication has no generative implication and best in the set |
Uses of MatchingRelation in fr.inrialpes.exmo.aroma.measures.entitybased |
---|
Constructor parameters in fr.inrialpes.exmo.aroma.measures.entitybased with type arguments of type MatchingRelation | |
---|---|
SBMeasure(Set<MatchingRelation> mrSet)
|
|
AROMA 1.2 | |||||||||
PREV NEXT | FRAMES NO FRAMES |