string matching
[/strɪŋ ˈmætʃɪŋ/]
noun
correspondência de cadeias de caracteres
1. A computer science technique for finding occurrences of a pattern (substring) within a larger text string
String matching algorithms are essential for search functions in text editors.
Algoritmos de correspondência de cadeias de caracteres são essenciais para funções de busca em editores de texto.
2. The process of comparing two or more strings to determine if they are identical or contain matching sequences
The software uses string matching to validate user input against database records.
O software usa correspondência de cadeias para validar entradas do usuário contra registros de banco de dados.
3. An algorithm-based operation for locating patterns within text data
Efficient string matching reduces the computational complexity of text processing.
A correspondência eficiente de cadeias reduz a complexidade computacional do processamento de texto.
This is a technical term primarily used in computer science, software development, and IT education. It is used identically in both Brazilian and Portuguese contexts, though often remains untranslated in technical environments due to the prevalence of English in programming. The concept is fundamental to search engines, text editors, and database systems worldwide.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →