Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Option to select shortest item in the duplicate list for process.dedupe #76

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Option to select shortest item in the duplicate list for process.dedupe #76

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d31bf33
dedupe_selector - add option for selecting shortest duplicated value …
smtodd Sep 1, 2024
071c8b3
Merge pull request #1 from smtodd/dedupe_selector
smtodd Sep 1, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 20 additions & 2 deletions thefuzz/process.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -406,6 +406,7 @@ def dedupe(
contains_dupes: _TC,
threshold: float = 70,
scorer: _Scorer = fuzz.token_set_ratio,
len_selector: str = "longest"
) -> t.Union[t.List[str], _TC]:
"""
This convenience function takes a list of strings containing duplicates and uses fuzzy matching to identify
Expand All @@ -427,17 +428,34 @@ def dedupe(
of the form f(query, choice) -> int.
By default, fuzz.token_set_ratio() is used and expects both query and
choice to be strings.
len_selector: Choose whether to return the longest or shortest item in the duplicate list.
We assume 'longest' contains the most detailed entity information about the group.
We assume 'shortest' returns the most generalized information about the entity group.

Returns:
A deduplicated list. For example:
A deduplicated list that returns the longest item. For example:

In: contains_dupes = ['Frodo Baggin', 'Frodo Baggins', 'F. Baggins', 'Samwise G.', 'Gandalf', 'Bilbo Baggins']
In: dedupe(contains_dupes)
Out: ['Frodo Baggins', 'Samwise G.', 'Bilbo Baggins', 'Gandalf']

A deduplicated list that returns the shortest item.
In: dup_universities = ["Duke University",
"Duke University Department of Chemistry",
"Duke University Hospital",
"Stanford",
"Stanford University Business School",
'Stanford University Engineering Department',
'Stanford University Biology Department']
In: dedupe(dup_universities, threshold=70, len_selector='shortest']
Out: ['Stanford', 'Duke University']
"""
deduped = set()
for item in contains_dupes:
matches = extractBests(item, contains_dupes, scorer=scorer, score_cutoff=threshold, limit=None)
deduped.add(max(matches, key=lambda x: (len(x[0]), x[0]))[0])
if len_selector == "longest":
deduped.add(max(matches, key=lambda x: (len(x[0]), x[0]))[0])
elif len_selector == "shortest":
deduped.add(min(matches, key=lambda x: (len(x[0]), x[0]))[0])

return list(deduped) if len(deduped) != len(contains_dupes) else contains_dupes