Results 81 to 90 of about 83,132 (184)

A Metric Index for Approximate String Matching

Theoretical Computer Science, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chávez, Edgar, Navarro, Gonzalo
openaire   +4 more sources

3-Partition Order-Preserving Pattern Matching

Mathematics
Two strings of equal length are called order-isomorphic if their relative orders are identical at every position. The classical order-preserving pattern matching (OPPM) problem finds all substrings in a text T that are order-isomorphic to a pattern P ...
Joong Chae Na, Seokchul Kang, Jeong Seop Sim   +2 more
doaj   +1 more source

MedT5SQL: a transformers-based large language model for text-to-SQL conversion in the healthcare domain

Frontiers in Big Data
IntroductionIn response to the increasing prevalence of electronic medical records (EMRs) stored in databases, healthcare staff are encountering difficulties retrieving these records due to their limited technical expertise in database operations.
Alaa Marshan, Anwar Nais Almutairi, Athina Ioannou, David Bell, Asmat Monaghan, Mahir Arzoky   +5 more
doaj   +1 more source

Approximate string matching using compressed suffix arrays

Theoretical Computer Science, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huynh, T.N.D., Hon, W.-K., Lam, T.-W., Sung, W.-K.   +3 more
openaire   +5 more sources

Searching by approximate personal-name matching [PDF]

, 2003
We discuss the design, building and evaluation of a method to access theinformation of a person, using his name as a search key, even if it has deformations.
Camps Pare, Rafael, Daude Ventura, Jordi
core   +1 more source

Approximate string-matching with q-grams and maximal matches

Theoretical Computer Science, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Increased Bit-Parallelism for Approximate String Matching

, 2004
Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for the approximate occurrences of a pattern of length m in a text of length n in time O(⌈m/w⌉n), where w is the number of bits in the computer word.
Hyyro, Heikki, Fredriksson, Kimmo, Navarro, Gonzalo   +2 more
openaire   +3 more sources

Matching health information seekers' queries to medical terms

BMC Bioinformatics, 2012
Background The Internet is a major source of health information but most seekers are not familiar with medical vocabularies. Hence, their searches fail due to bad query formulation.
Soualmia Lina F, Prieur-Gaston Elise, Moalla Zied, Lecroq Thierry, Darmoni Stéfan J   +4 more
doaj   +1 more source

Identificación de nombres personales por medio de sistemas de codificación fonética

Personal name identification through phonetic codification systems

Encontros Bibli, 2006
La necesidad de identificar las variantes de los nombres personales es un problema muy conocido en diversas aplicaciones, tales como los sistemas de recuperación de información (SRI), las bibliotecas digitales, las bases de datos de pacientes en un ...
Carmen Gálvez
doaj  

Audio Fingerprint Identification By Approximate String Matching.

, 2007
[TODO] Add abstract here.
Lebossé, Jerome, Brun, Luc
openaire   +2 more sources