Context Navigation

Changes between Version 1 and Version 2 of generator_PhaseTab

-                      v1
+                      v2
 The basic principle of the algorithm is the iterative confirmation of the best ranked relation proposals. This approach makes use of a feature of some [wiki:SimilarityMeasure SimilarityMeasures], especially the SimilarityFlooding, which increase their precision when given higher confidences on correct relations.
 In order to archieve a robust and fair ranking, a BordaCount alogrithm is used to identify the (n) best rated realtion of all SimilarityMeasures involved.
+In order to archieve a robust and fair ranking, a BordaCount alogrithm is used to identify the {{{n}}} best rated realtion of all SimilarityMeasures involved.
+An iteration cycle consists of three phases:
+An iteration cycle now consists of three phases:
+) Generate the SimilarityMatrix for all [wiki:SimilarityMeasure SimilarityMeasures] involved, using the current alignment as an input; the current alignment being empty in the first iteration. If the SimilarityMeasure is independent of such input, e.g. with a frame name based comparison measure, the matrix should not be recalculated. This is, however, up to the measure to decide.
+) Copy all 1.0 rated realtions, i.e. "confirmed ones", into a new and empty alignment.
+) Rank the remaining relations and identify the {{{n}}} best. These are also confirmed by setting their confidence to 1.0.
+) Finally append all other relations with the confidences given by the BordaCount algorithm.