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

	Published as a conference paper at ICLRDYNAMIC N EURAL P ROGRAM E MBEDDINGS FOR P RO GRAM R EPAIR arXiv:1711.07163v3 [cs.AI] 25 Feb 2018 DocID: 1xVbw - View Document
	Proceedings of the Australasian Language Technology Workshop 2007, pagesPractical Queries of a Massive n-gram Database Tobias Hawker Mary Gardiner Andrew Bennetts DocID: 1vitY - View Document
	Museum Visitors Interact with Explore Evolution Exhibition Formative Evaluation Report for the Explore Evolution Project by Amy N. Spiegel, E. Margaret Evans, Wendy Gram, DocID: 1uOVN - View Document
	N -Gram Posterior Probabilities for Statistical Machine Translation Richard Zens and Hermann Ney Human Language Technology and Pattern Recognition Lehrstuhl f¨ur Informatik 6 – Computer Science Department RWTH Aachen DocID: 1uCgu - View Document
	The Limits of N-Gram Translation Evaluation Metrics Christopher Culy FXPAL 3400 Hillview Ave, Bldg. 4 Palo Alto, CA 94304 DocID: 1uz1O - View Document