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

	Multi-source annotation projection of coreference chains: assessing strategies and testing opportunities Yulia Grishina and Manfred Stede Applied Computational Linguistics FSP Cognitive Science University of Potsdam DocID: 1vrep - View Document
	Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Philadelphia, July 2002, pp. DocID: 1vn1Q - View Document
	NODALIDA 2009 th 17 Nordic Conference of Computational Linguistics Kristiina Jokinen DocID: 1vkzQ - View Document
	Concepts and properties in word spaces* Marco Baroni & Alessandro Lenci Properties play a central role in most theories of conceptual knowledge. Since computational models derived from word co-occurrence statistics have DocID: 1vcjQ - View Document
	The ACL Anthology Reference Corpus: A Reference Dataset for Bibliographic Research in Computational Linguistics Steven Bird1 , Robert Dale2 , Bonnie J. Dorr3 , Bryan Gibson4 , Mark T. Joseph4 , Min-Yen Kan5† , Dongwon DocID: 1v63z - View Document