Applications of Approximate Word Matching in Information Retrieval J. C. French, A. L. Powell, E. Schulman* Department of Computer Science, University of Virginia *National Radio Astronomy Observatory CIKM ’97 November

First Page		Document Content
Date: 1998-07-01 11:12:28 Computing Science Dynamic programming Approximate string matching String searching algorithm Edit distance Regular expression String Astrophysics Data System Pattern matching Formal languages Combinatorics		Applications of Approximate Word Matching in Information Retrieval J. C. French, A. L. Powell, E. Schulman* Department of Computer Science, University of Virginia *National Radio Astronomy Observatory CIKM ’97 November Add to Reading List Source URL: www.cs.virginia.edu Download Document from Source Website File Size: 61,53 KB Share Document on Facebook

	Perl regular expression puzzle: even zeros and odd ones Greg Bacon The challenge was to write a regular expression — subject to seemingly tight constraints: only literals, concatenation, Kleene star, DocID: 1vc3D - View Document
	Regular Expression Matching on Graphics Hardware for Intrusion Detection Giorgos Vasiliadis, Michalis Polychronakis, Spiros Antonatos, Sotiris Ioannidis, Evangelos P. Markatos FORTH-ICS, Greece DocID: 1v8HL - View Document
	Derivative-Based Diagnosis of Regular Expression Ambiguity Martin Sulzmann1 and Kenny Zhuo Ming Lu2 1 Karlsruhe University of Applied Sciences DocID: 1tI80 - View Document
	Fixing Regular Expression Matching Failure Martin Sulzmann1 and Kenny Zhuo Ming Lu2 1 Karlsruhe University of Applied Sciences DocID: 1tFZR - View Document