Abstract
Error-tolerant lookup of words in large vocabularies hasmany potential uses, both within and beyond natural language processing (NLP). This work The work described here was done while the authors were at Language Technology Lab, German Research Center for Artificial Intelligence (DFKI GmbH), Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany. describes a generic library for finite-state-based lexical lookup, originally designed for NLP-related applications, that can be adapted to application-specific error metrics. We show how this tool can be used for searching existing trademarks in a database, using orthographic and phonetic similarity. We sketch a prototypical implementation of a trademark search engine and show results of a preliminary evaluation of this system. © 2004 Springer-Verlag.
Cite
CITATION STYLE
Eisele, A., & Vor Der Brück, T. (2004). Error-tolerant finite-state lookup for trademark search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3238 LNAI, pp. 112–126). Springer Verlag. https://doi.org/10.1007/978-3-540-30221-6_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
