@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix sn8: <http://data.loterre.fr/ark:/67375/SN8> .

<http://data.loterre.fr/ark:/67375/8LP> a owl:Ontology, skos:ConceptScheme .
<http://data.loterre.fr/ark:/67375/8LP-DWF96JCR-L>
  skos:hiddenLabel "Retrieval algorithm"@en, "Algorithme d'extraction"@fr ;
  a skos:Concept ;
  skos:example "Cet algorithme d'extraction des concepts est original sous deux aspects: l'extraction des concepts dépend directement des mots clés fournis par l'utilisateur et l'heuristique est construite sur une recherche de point fixe (Debourges et al. 2001). (Debourges, Guilloré-Billot & Vrain, 2001)"@fr, "Our solution to automate the data gathering and labeling problem is based on adding an extra filtering layer on top of existing retrieval algorithms on large-scale multimedia repositories so as to significantly refine the search results. (Correia, Trancoso & Raj, 2020)"@en, "In section 4 an effective retrieval algorithm is proposed to implement the so-called intelligent recommendation function. (Liu, Zhou, Gao, Xun & Huang, 2000)"@en, "When we analyze the retrieved text blocks for one example in the development set and compare it to the gold standard retrieval by humans (presented in Table 4) we see that none of the retrieval algorithms are capable of finding the desired missing information to improve semantic inference. (Sushil, Suster & Daelemans, 2021)"@en ;
  skos:prefLabel "retrieval algorithm"@en, "algorithme d'extraction"@fr ;
  dc:modified "2024-05-03T11:32:50"^^xsd:dateTime ;
  skos:inScheme <http://data.loterre.fr/ark:/67375/8LP> ;
  skos:exactMatch sn8:-BQSRH36G-H ;
  skos:broader <http://data.loterre.fr/ark:/67375/8LP-R50C56F3-F> .

<http://data.loterre.fr/ark:/67375/8LP-R50C56F3-F>
  skos:prefLabel "NLP algorithm"@en, "algorithme de TAL"@fr ;
  a skos:Concept ;
  skos:narrower <http://data.loterre.fr/ark:/67375/8LP-DWF96JCR-L> .

