Table 8.
Matching strategies in the participating systems - 2
| System | String-based strategies | Structure-based strategies | Constraint-based strategies | Instance-based strategies |
|---|---|---|---|---|
| JarvisOM | Cosine, WuPalmer, Lin, N-gram | - | - | - |
| KOSIMap | SimMetrics APIa, Degree of commonality coefficient | ✓ | ✓ | - |
| Lily | Edit-Distance | ✓ | ✓ | ✓ |
| LogMap | I-Sub | ✓ | - | ✓ |
| LPHOM | I-Sub, Mongue-Elkan, | - | - | - |
| 3-Gram, Jaccard, Lin | ||||
| LYAM++ | SOFT TF-IDF, Jaccard | ✓ | - | - |
| MaasMatch | Cosine, Edit-Distance, Jaccard, | ✓ | - | ✓ |
| 3-Gram, Longest Common Substring | ||||
| MapSSS | Edit-Distance, Choice based on [10] | ✓ | ✓ | - |
| NBJLM | Set of words-level | ✓ | - | - |
| ODGOMS | Longest Common Subsequence, SMOA, TF-IDF | ✓ | - | - |
| Optima+ | Lin, Smith-Waterman, | ✓ | - | - |
| Needleman-Wunsch | ||||
| Inverse Edit-Distance | ||||
| Prior+ | Edit-Distance | ✓ | - | - |
| RiMOM | Edit-Distance, Cosine | ✓ | - | ✓ |
| RSDLWB | Jaccard, Substring | ✓ | ✓ | - |
| SAMBO, SAMBOdtf | Edit-Distance, 3-Gram | ✓ | - | ✓ |
| ServOMap | Edit-Distance, | ✓ | - | - |
| I-Sub, Q-Gram, TF-IDF, | ||||
| Monge-Elkan, Jaccard | ||||
| SOBOM | I-Sub | ✓ | - | - |
| StringsAuto | Choice based on [10] | - | - | - |
| TaxoMap | Lin, 3-gram | ✓ | ✓ | - |
| Degree of commonality coefficient | ||||
| TOAST | ✓b | ✓ | - | - |
| WeSeE | Edit-Distance, TF-IDF | - | - | - |
| WikiMatch | Jaccard | - | - | - |
| X-SOM | Edit-Distance, Jaro | ✓ | - | ✓ |
| XMap | Edit distance, Jaro-Winkler, | ✓ | ✓ | - |
| N-gram, Jaccard, Cosine | ||||
| YAM++ | Tverskyc, TF-IDF | ✓ | - | ✓ |
aSimMetrics API is a Java library that include such string metrics as Jaccard, Jaro-Winkler and N-gram
bNo information found on actual used metrics
cTversky is a similarity metric on string sets