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 - the Fox - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-07-10 08:59:07		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 Source URL: titan.informatik.uni-leipzig.de Download Document from Source Website File Size: 262,20 KB Share Document on Facebook