Fellegi & Sunter Model (Entity Resolution Entity Resolution)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{3}k)$

Space Complexity

$O(k)$ words

(Derived: A constant number of values per feature; Sums range over n elements, but can be computed in the same memory; see Method 1)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1969

Reference

https://courses.cs.washington.edu/courses/cse590q/04au/papers/Felligi69.pdf