tommy/libpostal
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[dedupe] adding multi-word phrase alignments to deduping

Browse Source
This commit is contained in:
Al
2018-02-23 01:25:43 -05:00
parent 591891951d
commit b03fbdd681
3 changed files with 78 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

71
src/soft_tfidf.c
View File

@@ -125,7 +125,7 @@ static inline size_t sum_token_lengths(size_t num_tokens, char **tokens) {
}
double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char **tokens1, double *token_scores1, phrase_array *phrases1, size_t num_tokens2, char **tokens2, double *token_scores2, phrase_array *phrases2, phrase_array *acronym_alignments, soft_tfidf_options_t options, size_t *num_matches) {
double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char **tokens1, double *token_scores1, phrase_array *phrases1, size_t num_tokens2, char **tokens2, double *token_scores2, phrase_array *phrases2, phrase_array *acronym_alignments, phrase_array *multi_word_alignments, soft_tfidf_options_t options, size_t *num_matches) {
if (token_scores1 == NULL || token_scores2 == NULL) return 0.0;
if (num_tokens1 > num_tokens2 || (num_tokens1 == num_tokens2 && sum_token_lengths(num_tokens1, tokens1) > sum_token_lengths(num_tokens2, tokens2))) {
@@ -164,6 +164,9 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
int64_array *acronym_memberships_array = NULL;
int64_t *acronym_memberships = NULL;
int64_array *multi_word_memberships_array = NULL;
int64_t *multi_word_memberships = NULL;
t1_tokens_unicode = calloc(len1, sizeof(uint32_array *));
if (t1_tokens_unicode == NULL) {
total_sim = -1.0;
@@ -217,6 +220,14 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
}
}
if (multi_word_alignments != NULL) {
multi_word_memberships_array = int64_array_new();
token_phrase_memberships(multi_word_alignments, multi_word_memberships_array, len2);
if (multi_word_memberships_array->n == len2) {
multi_word_memberships = multi_word_memberships_array->a;
}
}
double jaro_winkler_min = options.jaro_winkler_min;
size_t jaro_winkler_min_length = options.jaro_winkler_min_length;
size_t damerau_levenshtein_max = options.damerau_levenshtein_max;
@@ -254,7 +265,10 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
int64_t pm1 = phrase_memberships1 != NULL ? phrase_memberships1[i] : NULL_PHRASE_MEMBERSHIP;
phrase_t p1 = pm1 >= 0 ? phrases1->a[pm1] : NULL_PHRASE;
phrase_t argmax_phrase = NULL_PHRASE;
bool have_multi_word_match = false;
phrase_t multi_word_phrase = NULL_PHRASE;
bool use_jaro_winkler = t1_len >= jaro_winkler_min_length;
bool use_strict_abbreviation_sim = t1_len >= strict_abbreviation_min_length;
bool use_damerau_levenshtein = damerau_levenshtein_max > 0 && t1_len >= damerau_levenshtein_min_length;
@@ -315,6 +329,23 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
}
}
if (multi_word_memberships != NULL) {
int64_t multi_word_membership = multi_word_memberships[j];
log_debug("multi_word_membership = %zd\n", multi_word_membership);
if (multi_word_membership >= 0) {
multi_word_phrase = multi_word_alignments->a[multi_word_membership];
uint32_t multi_word_match_index = multi_word_phrase.data;
if (multi_word_match_index == i) {
max_sim = 1.0;
argmax_sim = j;
have_multi_word_match = true;
log_debug("have multi-word match\n");
break;
}
}
}
double jaro_winkler = jaro_winkler_distance_unicode(t1u, t2u);
if (jaro_winkler > max_sim) {
max_sim = jaro_winkler;
@@ -349,7 +380,7 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
// Note: here edit distance, affine gap and abbreviations are only used in the thresholding process.
// Jaro-Winkler is still used to calculate similarity
if (!have_acronym_match && !have_phrase_match) {
if (!have_acronym_match && !have_phrase_match && !have_multi_word_match) {
if (have_equal || (use_jaro_winkler && (max_sim > jaro_winkler_min || double_equals(max_sim, jaro_winkler_min)))) {
log_debug("jaro-winkler, max_sim = %f\n", max_sim);
t2_score = token_scores2[argmax_sim];
@@ -407,7 +438,33 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
matched_tokens += p1.len;
log_debug("have_phrase_match\n");
} else {
} else if (have_multi_word_match) {
double multi_word_score = 0.0;
for (size_t p = multi_word_phrase.start; p < multi_word_phrase.start + multi_word_phrase.len; p++) {
t2_score = token_scores2[p];
multi_word_score += t2_score * t2_score;
}
double norm_multi_word_score = sqrt(multi_word_score);
double max_multi_word_score = 0.0;
if (t1_score > norm_multi_word_score || double_equals(t1_score, norm_multi_word_score)) {
norm2_offset += (t1_score * t1_score) - multi_word_score;
log_debug("t1_score >= norm_multi_word_score, norm2_offset = %f\n", norm2_offset);
max_multi_word_score = t1_score;
} else {
norm1_offset += multi_word_score - (t1_score * t1_score);
log_debug("norm_multi_word_score > t1_score, norm1_offset = %f\n", norm1_offset);
max_multi_word_score = norm_multi_word_score;
}
log_debug("max_multi_word_score = %f\n", max_multi_word_score);
total_sim += max_multi_word_score * max_multi_word_score;
log_debug("have multi-word match\n");
matched_tokens++;
} else if (have_acronym_match) {
double acronym_score = 0.0;
for (size_t p = acronym_phrase.start; p < acronym_phrase.start + acronym_phrase.len; p++) {
t2_score = token_scores2[p];
@@ -475,6 +532,10 @@ return_soft_tfidf_score:
int64_array_destroy(acronym_memberships_array);
}
if (multi_word_memberships_array != NULL) {
int64_array_destroy(multi_word_memberships_array);
}
double norm = sqrt(double_array_sum_sq(token_scores1, num_tokens1) + norm1_offset) * sqrt(double_array_sum_sq(token_scores2, num_tokens2) + norm2_offset);
log_debug("total_sim = %f, norm1_offset = %f, norm2_offset = %f, norm = %f\n", total_sim, norm1_offset, norm2_offset, norm);
@@ -484,5 +545,5 @@ return_soft_tfidf_score:
double soft_tfidf_similarity(size_t num_tokens1, char **tokens1, double *token_scores1, size_t num_tokens2, char **tokens2, double *token_scores2, soft_tfidf_options_t options, size_t *num_matches) {
return soft_tfidf_similarity_with_phrases_and_acronyms(num_tokens1, tokens1, token_scores1, NULL, num_tokens2, tokens2, token_scores2, NULL, NULL, options, num_matches);
return soft_tfidf_similarity_with_phrases_and_acronyms(num_tokens1, tokens1, token_scores1, NULL, num_tokens2, tokens2, token_scores2, NULL, NULL, NULL, options, num_matches);
}