BOYS algorithm (Entity Resolution Entity Resolution)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2} k)$
Space Complexity
$O(n^{2})$ words
(Derived: As written stores counts/probabailities for all pairs of entries.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1993
Reference
https://www.sciencedirect.com/science/article/abs/pii/016794739390116B