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

[dedupe] account for missing ordinal suffixes in Soft-TFIDF deduping i.e. to count 1st Place and 1 Plce as the same where there might be a misspelling and the phrase wouldn't match under exact expansions

Browse Source
This commit is contained in:
Al
2018-02-23 23:42:49 -05:00
parent b03fbdd681
commit b2dcb18d7e
3 changed files with 65 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

47
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, phrase_array *multi_word_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, uint32_array *ordinal_suffixes1, size_t num_tokens2, char **tokens2, double *token_scores2, phrase_array *phrases2, uint32_array *ordinal_suffixes2, 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))) {
@@ -140,6 +140,10 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
phrases1 = phrases2;
phrases2 = tmp_phrases;
uint32_array *tmp_suffixes = ordinal_suffixes1;
ordinal_suffixes1 = ordinal_suffixes2;
ordinal_suffixes2 = tmp_suffixes;
size_t tmp_num_tokens = num_tokens1;
num_tokens1 = num_tokens2;
num_tokens2 = tmp_num_tokens;
@@ -228,6 +232,14 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
}
}
uint32_t *suffixes1;
uint32_t *suffixes2;
if (ordinal_suffixes1 != NULL && ordinal_suffixes2 != NULL) {
suffixes1 = ordinal_suffixes1->a;
suffixes2 = ordinal_suffixes2->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;
@@ -260,12 +272,19 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
bool have_abbreviation = false;
bool have_strict_abbreviation = false;
bool have_acronym_match = false;
size_t last_ordinal_suffix = 0;
bool have_ordinal_suffix = false;
phrase_t acronym_phrase = NULL_PHRASE;
bool have_phrase_match = false;
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;
uint32_t ordinal_suffix_i = 0;
if (suffixes1 != NULL) {
ordinal_suffix_i = suffixes1[i];
}
bool have_multi_word_match = false;
phrase_t multi_word_phrase = NULL_PHRASE;
@@ -286,6 +305,8 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
continue;
}
size_t slen1 = strlen(tokens1[i]);
for (size_t j = 0; j < len2; j++) {
t2u = t2_tokens_unicode[j];
@@ -293,6 +314,11 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
int64_t pm2 = phrase_memberships2 != NULL ? phrase_memberships2[j] : NULL_PHRASE_MEMBERSHIP;
phrase_t p2 = pm2 >= 0 ? phrases2->a[pm2] : NULL_PHRASE;
uint32_t ordinal_suffix_j = 0;
if (suffixes2 != NULL) {
ordinal_suffix_j = suffixes2[j];
}
canonical_match_t canonical_response = CANONICAL_NO_MATCH;
if (p1.len > 0 && p2.len > 0 && phrases_have_same_canonical(num_tokens1, tokens1, num_tokens2, tokens2, p1, p2, &canonical_response)) {
if (canonical_response > best_canonical_phrase_response) {
@@ -375,6 +401,18 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
}
}
if (ordinal_suffix_i > 0) {
size_t slen2 = strlen(tokens2[j]);
if (utf8_common_prefix_len(tokens1[i], tokens2[j], slen2) == slen2) {
last_ordinal_suffix = j;
have_ordinal_suffix = true;
}
} else if (ordinal_suffix_j > 0) {
if (utf8_common_prefix_len(tokens1[i], tokens2[j], slen1) == slen1) {
last_ordinal_suffix = j;
have_ordinal_suffix = true;
}
}
}
// Note: here edit distance, affine gap and abbreviations are only used in the thresholding process.
@@ -419,6 +457,11 @@ double soft_tfidf_similarity_with_phrases_and_acronyms(size_t num_tokens1, char
t2_score = token_scores2[last_abbreviation];
total_sim += last_abbreviation_sim * t1_score * t2_score;
matched_tokens++;
} else if (have_ordinal_suffix) {
log_debug("have ordinal suffix from %zu\n", last_ordinal_suffix);
t2_score = token_scores2[last_ordinal_suffix];
total_sim += 1.0 * t1_score * t2_score;
matched_tokens++;
}
} else if (have_phrase_match) {
double p2_score = 0.0;
@@ -545,5 +588,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, NULL, options, num_matches);
return soft_tfidf_similarity_with_phrases_and_acronyms(num_tokens1, tokens1, token_scores1, NULL, NULL, num_tokens2, tokens2, token_scores2, NULL, NULL, NULL, NULL, options, num_matches);
}