« Correspondance approximative de séquences » : différence entre les versions
Aucun résumé des modifications Balise : Éditeur de wikicode 2017 |
|||
| Ligne 10 : | Ligne 10 : | ||
== Français == | == Français == | ||
appariement approximatif de séquences | ''' appariement approximatif de séquences''' | ||
appariement approximatif de chaînes | ''' appariement approximatif de chaînes''' | ||
correspondance approximative de séquences | ''' correspondance approximative de séquences''' | ||
correspondance approximative de chaînes | ''' correspondance approximative de chaînes''' | ||
== Anglais == | == Anglais == | ||
''' Approximate string matching ''' | |||
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. | 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. | ||
Version du 28 avril 2019 à 08:54
Domaine
Vocabulary
Coulombe
Définition
Français
appariement approximatif de séquences
appariement approximatif de chaînes
correspondance approximative de séquences
correspondance approximative de chaînes
Anglais
Approximate string matching
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.
Contributeurs: Claude Coulombe, Imane Meziani, wiki, Sihem Kouache
