Fast approximate string matching with suffix arrays and A* parsing

First Page		Document Content
Date: 2013-10-22 08:13:24 Computational linguistics Formal languages Pattern matching Speech recognition Natural language processing Translation memory Approximate string matching N-gram Regular expression Linguistics Science Computing		Fast approximate string matching with suffix arrays and A* parsing Add to Reading List Source URL: www.systransoft.com Download Document from Source Website File Size: 177,32 KB Share Document on Facebook

	Surname identification and correction in a corpus of forename surname dataset Suresh Veluru, Yogachandran Rahulamathavan, and Muttukrishnan Rajarajan Information Security Group, School of Engineering and Mathematical Sci DocID: 1rk7H - View Document
	A PATTERN EXTRACTION ALGORITHM FOR ABSTRACT MELODIC REPRESENTATIONS THAT ALLOW PARTIAL OVERLAPPING OF INTERVALLIC CATEGORIES Emilios Cambouropoulos1 , Maxime Crochemore2,3 , Costas Iliopoulos3 , Manal Mohamed3 , Marie-Fr DocID: 1rgdB - View Document
	doi:j.ins DocID: 1r4I2 - View Document
	Indexing Mixed Types for Approximate Retrieval Liang Jin Nick Koudas University of California, Irvine, USA DocID: 1q5EM - View Document
	Genome Informatics 12: 175–Indexing Huge Genome Sequences for Solving Various Problems DocID: 1pYuy - View Document