In this paper, we present an efficient comparison of text and RDF data for recognizing named entities. Here, a named entity is a text sequence that refers to a URI reference within an RDF graph. We present suffix arrays as representation format for text and a relational database scheme to represent Semantic Web data. Using these representation facilities performs a named entity recognition in linear time complexity and without the requirement to hold names of existing entities in memory. Both is needed to implement a named entity recognition on the scale of for instance the DBpedia database. © 2011 Springer-Verlag.
CITATION STYLE
Adrian, B., & Schwarz, S. (2011). Using suffix arrays for efficiently recognition of named entities in large scale. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6882 LNAI, pp. 420–429). https://doi.org/10.1007/978-3-642-23863-5_43
Mendeley helps you to discover research relevant for your work.