Search for "Pattern matching" in article titles:

1. Gestalt pattern matching: Gestalt pattern matching, also Ratcliff/Obershelp pattern recognition, is a string-matching algorithm for determining the similarity of two strings. It was developed in 1983 by John W. [100%] 2023-03-21 [Search algorithms] [Information theory]...
2. Gestalt Pattern Matching: Gestalt Pattern Matching, also Ratcliff/Obershelp Pattern Recognition, is a string-matching algorithm for determining the similarity of two strings. It was developed in 1983 by John W. [100%] 2023-02-14 [Search algorithms] [Information theory]...
3. Compressed pattern matching: In computer science, compressed pattern matching (abbreviated as CPM) is the process of searching for patterns in compressed data with little or no decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space. (Searching for patterns in compressed data) [100%] 2024-06-13 [Data compression] [Pattern matching]...
4. Gestalt pattern matching: Gestalt pattern matching, also Ratcliff/Obershelp pattern recognition, is a string-matching algorithm for determining the similarity of two strings. It was developed in 1983 by John W. [100%] 2024-07-25 [Search algorithms] [Information theory]...
5. Tom (pattern matching language): 79-й чемпионат Франции прошёл в Валь-д’Изер с 16 по 26 августа 2004 года. (None) [86%] 2024-02-04 [Programming language implementation] [Pattern matching]...
6. Erlang (programming language)#Tutorials#Pattern Matching: Erlang uses powerful pattern-matching to bind variables to values. Pattern matching can be explicit, as when the = (pattern matching operator) is used, or implicit, as when a function call is processed and a function's actual arguments are matched ... (Programming language) [70%] 2025-03-03