Appendix - Algorithm for expansion policy Algorithm 1: Search candidates for named entities and expansion policy Data: N = {N1 , N2Nn } sorted in ascending order of their string length, trigram similarity threshol - Similarity - Document - PDFSEARCH.IO

First Page	Meta Content
	Appendix - Algorithm for expansion policy Algorithm 1: Search candidates for named entities and expansion policy Data: N = {N1 , N2Nn } sorted in ascending order of their string length, trigram similarity threshol Add to Reading List Document Date: 2014-07-10 08:59:07 Open Document File Size: 262,20 KB Share Result on Facebook

Appendix - Algorithm for expansion policy Algorithm 1: Search candidates for named entities and expansion policy Data: N = {N1 , N2Nn } sorted in ascending order of their string length, trigram similarity thresholAdd to Reading List