We have a column for street addresses:
123 Maple Rd.
321 1st Ave.
etc...
Is there any way to match these addresses t
You may want to consider using the Levenshtein Distance algorithm.
You can create it as a user-defined function in SQL Server, where it will return the number of operations that need to be performed on String_A so that it becomes String_B. You can then compare the result of the Levenshtein Distance function against some fixed threshold, or against some value derived from the length of the strings.
You would simply use it as follows:
... WHERE LEVENSHTEIN(address_in_db, address_to_search) < 5;
As Mark Byers suggested, converting variable terms into canonical form will help if you use Levenshtein Distance.
Using Full-Text Search may be another option, especially since Levenshtein would normally require a full table scan. This decision may depend on how frequently you intend to do these queries.
You may want to check out the following Levenshtein Distance implementation for SQL Server:
Note: You would need to implement a MIN3 function for the above implementation. You can use the following:
CREATE FUNCTION MIN3(@a int, @b int, @c int)
RETURNS int
AS
BEGIN
DECLARE @m INT
SET @m = @a
IF @b < @m SET @m = @b
IF @c < @m SET @m = @c
RETURN @m
END
You may also be interested in checking out the following articles: