Linking.scala

  private def link(l1: List[String], l2: List[String]) = {
    def findClosest(v: String) = l2.foldLeft((Int.MaxValue, ""))((current, item) => LevenshteinMetric.compare(v, item).getOrElse(Int.MaxValue) match {
      case i if i <= current._1 => (i, item)
      case _ => current
    })

    var items = Map.empty[String, String]
    l1.foreach(v1 => findClosest(v1) match {
      case (score, v2) => {
        if (items.valuesIterator.contains(v2)) {
          throw new RuntimeException(s"Duplicate matching of $v2 for both $v1 and ${items.find(t => t._2 == v1)}")
        } else {
          items += v1 -> v2
        }
      }
    })
    items
  }