Técnicas eficientes para la búsqueda aproximada utilizando la distancia DEA
Within the context of the approximate searching of names in a DB, we discuss searching techniques for the DEA distance function. A very efficient technique is presented based on a Trie tree. Also, an easy-to-implement technique is presented based on the relationships between bigrams and simple edit...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2003 |
| País: | España |
| Institución: | 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/97419 |
| Acceso en línea: | https://hdl.handle.net/2117/97419 |
| Access Level: | acceso abierto |
| Palabra clave: | Approximate searching of names DB DEA distance function Àrees temàtiques de la UPC::Informàtica |
| Sumario: | Within the context of the approximate searching of names in a DB, we discuss searching techniques for the DEA distance function. A very efficient technique is presented based on a Trie tree. Also, an easy-to-implement technique is presented based on the relationships between bigrams and simple edit distance. |
|---|