Skip to main content

Table 1 Similarity values based on the Levenshtein distance

From: A study on machine learning techniques for the schema matching network problem

Levenshtein matcher Schema B
   searchForm.search searchForm.searchType searchForm.keyword searchForm.shortTitle searchForm.shortAuthor
Schema A search 1.0000 0.6000 0.1429 0.2000 0.2727
  search.field-title 0.0909 0.1818 0.0909 0.3636 0.0000
  search.field-subject 0.1538 0.1538 0.0769 0.0769 0.0769
  search.field-asin 0.2000 0.0000 0.1000 0.0000 0.0000
  search.field-publisher 0.1333 0.1333 0.0667 0.1333 0.2000
  search.field-dateyear 0.1429 0.1429 0.1429 0.1419 0.1429
  search.field-keywords 0.1429 0.1429 0.5000 0.0000 0.1429