Skip to content

Latest commit

 

History

History
33 lines (19 loc) · 1.5 KB

README.md

File metadata and controls

33 lines (19 loc) · 1.5 KB

Welcome to TNAS

Seeking patterns of similarity between data strings

TNAS estimates the similarities or dissimilarities between things. It compares any group of characters with any other group of characters and estimates the percentage similarity between one or more items.


Summary

The TNAS repository holds a variety of common pattern matching algorithms including a C++ and a C# rendition of the Ratcliff/Obershelp pattern-matching algorithm developed by John W. Ratcliff and John A. Obershelp in 1983 to address concerns about educational software (Ratcliff, 1988).

The two Ratcliff/Obershelp renditions here differ primarily in that the C# methods provide a comprehensive set of pre-processing attributes that modify the similarity outcome based on comparison characteristics that may be relevant to specific data requirements.

C++ Comparison Methods

1. RatcliffObershelp

C# Comparison Methods

1. RatcliffObershelp
2. LevenshteinDistance
3. HammingDistance
4. PhoneticPatterns