Searching by approximate personal-name matching
We discuss the design, building and evaluation of a method to access the information of a person, using his name as a search key, even if it has deformations. We present a similarity function, the DEA function, based on the probabilities of the edit operations accordingly to the involved letters and...
| Autores: | , |
|---|---|
| Formato: | informe técnico |
| Fecha de publicación: | 2003 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/369840 |
| Acesso em linha: | https://hdl.handle.net/2117/369840 |
| Access Level: | acceso abierto |
| Palavra-chave: | Computer programming Programació (Ordinadors) Àrees temàtiques de la UPC::Informàtica |
| Resumo: | We discuss the design, building and evaluation of a method to access the information of a person, using his name as a search key, even if it has deformations. We present a similarity function, the DEA function, based on the probabilities of the edit operations accordingly to the involved letters and their position, and using a variable threshold. The efficacy of DEA is quantitatively evaluated, without human relevance judgments, very superior to the efficacy of known methods. A very efficient approximate search technique for the DEA function is also presented based on a compacted trie-tree structure. |
|---|