Aditya Bhargava
Department of Computer Science
University of Toronto
10 King's College Road, Rm. 3302
Toronto, Ontario, Canada
M4S 3G4
Office: SF 3209
Phone: 416-946-7504

To contact me, send an email to myfirstname@cs.toronto.edu, making the appropriate substitution. Each of my publications also has an email address for me.

strcmp2

This page (named as a successor to the C strcmp function) provides string comparison using various string comparison methods. The methods are implemented in a Perl script by my former supervisor, Dr. Greg Kondrak.

String 1
String 2
Method	IDENT: Simple identity; returns 1 if the strings are equal, 0 otherwise. SIMARD: Length of the common prefix. SOUNDEX: A venerable method of matching personal names. DICE: Number of common bigrams. TRI: Number of common trigrams. XDICE: See (Brew and McKelvie, 1996). XXDICE: Ibid. LCSR: Longest common subsequence ratio. EDIT: Levenshtein (edit) distance. BI-SIM: See (Kondrak, 2005). TRI-SIM: Ibid. BI-DIST: Ibid. TRI-DIST: Ibid.
Options	Normalize by length

References

• Chris Brew and David McKelvie. 1996. Word-pair extraction for lexicography. In Proceedings of the Second International Conference on New Methods in Language Processing, pp. 45-–55, September.
• Grzegorz Kondrak. 2005. N-gram similarity and distance. In Proceedings of the Twelfth International Conference on String Processing and Information Retrieval, pp. 115-–126, November.

This site uses valid XHTML 1.1 and valid CSS 2.1.
This site uses a modified version of the RockinChrome theme designed by Cory Miller.
All content is by Aditya Bhargava and is licensed under a Creative Commons Attribution-Non-Commercial-Share Alike 2.5 Canada License unless otherwise stated.