Approximate textual retrieval

Simple item page
dc.creatorConstans, Pere
dc.date2007-05-05
dc.date.accessioned2026-07-07T07:59:41Z
dc.date.available2026-07-07T07:59:41Z
dc.descriptionAn approximate textual retrieval algorithm for searching sources with high levels of defects is presented. It considers splitting the words in a query into two overlapping segments and subsequently building composite regular expressions from interlacing subsets of the segments. This procedure reduces the probability of missed occurrences due to source defects, yet diminishes the retrieval of irrelevant, non-contextual occurrences.
dc.identifierhttps://arxiv.org/abs/0705.0751
dc.identifierhttp://arxiv.org/abs/0705.0751
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128460
dc.subjectInformation Retrieval
dc.subjectDigital Libraries
dc.subjectH.3.3; I.2.8
dc.titleApproximate textual retrieval
dc.typetext

Files

Collections

arXiv