Diclib.com
قاموس ChatGPT

بحث في القاموس حلول مخصصة

أدخل كلمة أو عبارة بأي لغة 👆

اللغة:

ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT

في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:

كيف يتم استخدام الكلمة في اللغة
تردد الكلمة
ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
أصل الكلمة

%ما هو (من)٪ 1 - تعريف

TASK OF FINDING RECORDS IN A DATA SET THAT REFER TO SAME ENTITY ACROSS DIFFERENT SOURCES

Record linkage problem; Fellegi-Sunter; Fellegi-Sunter algorithm; Entity resolution; Identity resolution; Fuzzy matching; Probabilistic merging; Fuzzy merging; Probabilistic record linkage; Reference reconciliation; Privacy-preserving record linkage

Approximate string matching

ALGORITHM FOR FINDING STRINGS THAT MATCH A PATTERN APPROXIMATELY

Fuzzy string searching; Fuzzy search; Fuzzy searching; Fuzzy string matching; Fuzzy finder; Approximate substring matching; Approximately matching strings; Fzf; FZF

In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match a pattern approximately (rather than exactly). The problem of approximate string matching is typically divided into two sub-problems: finding approximate substring matches inside a given string and finding dictionary strings that match the pattern approximately.

https://en.wikipedia.org/wiki/Approximate_string_matching

fuzzy subset

SETS WHOSE ELEMENTS HAVE DEGREES OF MEMBERSHIP

Fuzzy sets; Fuzzy set theory; Fuzzification; Fuzzy subset; Credibility(fuzzy); Fuzzy category; Goguen category; Fuzzy Sets; Fuzzy relation equation; Pythagorean fuzzy set; Degree of membership; Uncertain set

In fuzzy logic, a fuzzy subset F of a set S is defined by a "membership function" which gives the degree of membership of each element of S belonging to F.

Bracket matching

A SYNTAX HIGHLIGHTING FEATURE OF CERTAIN TEXT EDITORS AND INTEGRATED DEVELOPMENT ENVIRONMENTS THAT HIGHLIGHTS MATCHING PAIRS OF BRACKETS.

Braces matching; Brace matching

Bracket matching, also known as brace matching or parentheses matching, is a syntax highlighting feature of certain text editors and integrated development environments that highlights matching sets of brackets (square brackets, curly brackets, or parentheses) in languages such as Java, JavaScript, and C++ that use them. The purpose is to help the programmer navigate through the code and also spot any improper matching, which would cause the program to not compile or malfunction.

https://en.wikipedia.org/wiki/Bracket_matching

ويكيبيديا

Record linkage

Record linkage (also known as data matching, data linkage, entity resolution, and many other terms) is the task of finding records in a data set that refer to the same entity across different data sources (e.g., data files, books, websites, and databases). Record linkage is necessary when joining different data sets based on entities that may or may not share a common identifier (e.g., database key, URI, National identification number), which may be due to differences in record shape, storage location, or curator style or preference. A data set that has undergone RL-oriented reconciliation may be referred to as being cross-linked.

https://en.wikipedia.org/wiki/Record linkage