| | 1 | [[TracNav]] |
| | 2 | |
| | 3 | = AlignmentGenerator: [wiki:PhaseLibs PhaseTab] Algorithm = |
| | 4 | |
| | 5 | Developers: [mailto:endres(at)dfki.uni-kl.de Björn Endres] and [mailto:Malte.Kiesel(at)dfki.de Malte Kiesel] |
| | 6 | |
| | 7 | == Description == |
| | 8 | The PhaseTab algorithm is a generic algorithm that employs an arbitrary number of [wiki:SimilarityMeasure SimilarityMeasures] to generate an alignment. The algorithm was originally developed by [mailto:Malte.Kiesel(at)dfki.de Malte Kiesel] and [mailto:Ludger.van_Elst(at)dfki.de Ludger van Elst] and has been presented in the paper referenced [wiki:PhaseLibs here]. It was then adapted for the PhaseLibs project. |
| | 9 | |
| | 10 | 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. |
| | 11 | |
| | 12 | 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. |
| | 13 | |
| | 14 | An iteration cycle consists of three phases: |
| | 15 | |
| | 16 | |
| | 17 | == Characteristics == |
| | 18 | |
| | 19 | == Evaluation/Performance == |
| | 20 | |
| | 21 | == Specification == |
| | 22 | === Intitialisation === |
| | 23 | |
| | 24 | === Parameters === |
| | 25 | none |
| | 26 | |
| | 27 | === Dependencies === |
| | 28 | none |
| | 29 | |
| | 30 | == License Issues == |
| | 31 | TODO |
