Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
first 3 features: exact URLs, Levenshtein names, cosine descriptions …
- Loading branch information
Marco Fossati
committed
Jan 10, 2019
1 parent
265003f
commit 5008ee1
Showing
2 changed files
with
183 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,27 @@ | ||
Copyright (c) 2016-2018, Jonathan de Bruin | ||
All rights reserved. | ||
|
||
Redistribution and use in source and binary forms, with or without | ||
modification, are permitted provided that the following conditions are met: | ||
|
||
* Redistributions of source code must retain the above copyright notice, this | ||
list of conditions and the following disclaimer. | ||
|
||
* Redistributions in binary form must reproduce the above copyright notice, | ||
this list of conditions and the following disclaimer in the documentation | ||
and/or other materials provided with the distribution. | ||
|
||
* Neither the name of the copyright holder nor the names of its | ||
contributors may be used to endorse or promote products derived from | ||
this software without specific prior written permission. | ||
|
||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | ||
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | ||
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE | ||
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | ||
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR | ||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER | ||
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, | ||
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | ||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,156 @@ | ||
#!/usr/bin/env python3 | ||
# -*- coding: utf-8 -*- | ||
|
||
"""Set of classes to compare field pairs and extract features for supervised linking.""" | ||
|
||
__author__ = 'Marco Fossati' | ||
__email__ = 'fossati@spaziodati.eu' | ||
__version__ = '1.0' | ||
__license__ = 'GPL-3.0' | ||
__copyright__ = 'Copyleft 2018, Hjfocs' | ||
|
||
import logging | ||
|
||
import jellyfish | ||
import numpy | ||
import pandas | ||
from recordlinkage.base import BaseCompareFeature | ||
from recordlinkage.utils import fillna | ||
from sklearn.feature_extraction.text import CountVectorizer | ||
|
||
from soweego.commons import text_utils | ||
|
||
LOGGER = logging.getLogger(__name__) | ||
|
||
# Adapted from https://github.com/J535D165/recordlinkage/blob/master/recordlinkage/compare.py | ||
# See RECORDLINKAGE_LICENSE | ||
|
||
|
||
class StringList(BaseCompareFeature): | ||
|
||
name = 'string_list' | ||
description = 'Compare pairs of lists with string values' | ||
|
||
def __init__(self, | ||
left_on, | ||
right_on, | ||
algorithm='levenshtein', | ||
threshold=None, | ||
missing_value=0.0, | ||
analyzer=None, | ||
ngram_range=(2, 2), | ||
label=None): | ||
super(StringList, self).__init__(left_on, right_on, label=label) | ||
self.algorithm = algorithm | ||
self.threshold = threshold | ||
self.missing_value = missing_value | ||
self.analyzer = analyzer | ||
self.ngram_range = ngram_range | ||
|
||
def _compute_vectorized(self, source_column, target_column): | ||
if self.algorithm == 'levenshtein': | ||
algorithm = self.levenshtein_similarity | ||
elif self.algorithm == 'cosine': | ||
algorithm = self.cosine_similarity | ||
else: | ||
raise ValueError( | ||
'Bad string similarity algorithm: %s. Please use one of %s' % (self.algorithm, ('levenshtein', 'cosine'))) | ||
|
||
compared = algorithm(source_column, target_column) | ||
compared_filled = fillna(compared, self.missing_value) | ||
|
||
if self.threshold is None: | ||
return compared_filled | ||
return (compared_filled >= self.threshold).astype(numpy.float64) | ||
|
||
# Adapted from https://github.com/J535D165/recordlinkage/blob/master/recordlinkage/algorithms/string.py | ||
# Average the edit distance among the list of values | ||
# TODO issue 1: it doesn't makes sense to compare names in different languages | ||
# TODO issue 2: low scores if name is swapped with surname | ||
def levenshtein_similarity(self, source_column, target_column): | ||
concatenated = pandas.Series(list(zip(source_column, target_column))) | ||
|
||
def _levenshtein_apply(pair): | ||
source_values, target_values = pair | ||
scores = [] | ||
for source in source_values: | ||
for target in target_values: | ||
try: | ||
score = 1 - jellyfish.levenshtein_distance(source, target) \ | ||
/ numpy.max([len(source), len(target)]) | ||
scores.append(score) | ||
except TypeError: | ||
if pandas.isnull(source) or pandas.isnull(target): | ||
scores.append(self.missing_value) | ||
else: | ||
raise | ||
avg = numpy.average(scores) | ||
return avg | ||
|
||
return concatenated.apply(_levenshtein_apply) | ||
|
||
def cosine_similarity(self, source_column, target_column): | ||
if len(source_column) != len(target_column): | ||
raise ValueError('Columns must have the same length') | ||
if len(source_column) == len(target_column) == 0: | ||
return [] | ||
|
||
# No analyzer means input underwent commons.text_utils#tokenize | ||
if self.analyzer is None: | ||
vectorizer = CountVectorizer(analyzer=str.split) | ||
elif self.analyzer == 'soweego': | ||
vectorizer = CountVectorizer(analyzer=text_utils.tokenize) | ||
# scikit-learn built-ins | ||
# 'char' and char_wb' make CHARACTER n-grams, instead of WORD ones, may be useful for short strings with misspellings. | ||
# 'char_wb' makes n-grams INSIDE words, thus eventually padding with whitespaces. | ||
# See https://scikit-learn.org/stable/modules/feature_extraction.html#limitations-of-the-bag-of-words-representation | ||
elif self.analyzer in ('word', 'char', 'char_wb'): | ||
vectorizer = CountVectorizer( | ||
analyzer=self.analyzer, strip_accents='unicode', ngram_range=self.ngram_range) | ||
else: | ||
raise ValueError( | ||
'Bad text analyzer: %s. Please use one of %s' % (self.analyzer, ('soweego', 'word', 'char', 'char_wb'))) | ||
|
||
data = source_column.append(target_column).fillna('') | ||
vectors = vectorizer.fit_transform(data) | ||
|
||
def _metric_sparse_cosine(u, v): | ||
a = numpy.sqrt(u.multiply(u).sum(axis=1)) | ||
b = numpy.sqrt(v.multiply(v).sum(axis=1)) | ||
ab = v.multiply(u).sum(axis=1) | ||
# TODO looks like some values are NaN | ||
cosine = numpy.divide(ab, numpy.multiply(a, b)).A1 | ||
return cosine | ||
|
||
return _metric_sparse_cosine(vectors[:len(source_column)], vectors[len(source_column):]) | ||
|
||
|
||
class UrlList(BaseCompareFeature): | ||
|
||
name = 'url_list' | ||
description = 'Compare pairs of lists with URL values' | ||
|
||
def __init__(self, left_on, right_on, agree_value=1.0, disagree_value=0.0, missing_value=0.0, label=None): | ||
super(UrlList, self).__init__(left_on, right_on, label=label) | ||
self.agree_value = agree_value | ||
self.disagree_value = disagree_value | ||
self.missing_value = missing_value | ||
|
||
def _compute_vectorized(self, source_column, target_column): | ||
concatenated = pandas.Series(list(zip(source_column, target_column))) | ||
|
||
def exact_apply(pair): | ||
source_urls, target_urls = pair | ||
scores = [] | ||
for source in source_urls: | ||
for target in target_urls: | ||
if pandas.isnull(source) or pandas.isnull(target): | ||
scores.append(self.missing_value) | ||
continue | ||
if source == target: | ||
scores.append(self.agree_value) | ||
else: | ||
scores.append(self.disagree_value) | ||
return numpy.average(scores) | ||
|
||
return concatenated.apply(exact_apply) |