@prefix owl: . @prefix dbpedia: . dbpedia:Term_indexing owl:sameAs . @prefix foaf: . @prefix ns3: . dbpedia:Term_indexing foaf:page ns3:Term_indexing . @prefix rdfs: . dbpedia:Term_indexing rdfs:label "Term indexing"@en , "Index terminologique"@fr , "Indeksowanie term\u00F3w"@pl . @prefix dbpprop: . dbpedia:Term_indexing dbpprop:abstract "L\u2019index terminologique est utilis\u00E9 pour lister les termes significatifs utilis\u00E9s dans un ouvrage, avec renvoi aux pages auxquelles ils sont utilis\u00E9s. Par extension, en informatique, l'indexation de termes est la t\u00E2che qui consiste \u00E0 cr\u00E9er un index de termes et les clauses de la collecte."@fr , "Indeksowanie term\u00F3w to zagadnienie polegaj\u0105ce na wyszukaniu w pewnym zbiorze term\u00F3w tych term\u00F3w (dowolnego albo te\u017C wszystkich), kt\u00F3re s\u0105 w pewnej relacji z danym termem. Zagadnieniem temu w szczeg\u00F3lno\u015Bci po\u015Bwi\u0119cony jest dzia\u0142 z pogranicza informatyki i matematyki zwany: Systemy Wyszukiwania Informacji. Indeksowanie term\u00F3w ma wiele zastosowa\u0144, ale w wi\u0119kszo\u015Bci typowych problem\u00F3w term\u00F3w jest ma\u0142o i s\u0105 proste, a ich zbi\u00F3r jest sta\u0142y. Zupe\u0142nie inaczej ma si\u0119 to w przypadku system\u00F3w automatycznego dowodzenia twierdze\u0144 - tam term\u00F3w jest du\u017Co, s\u0105 z\u0142o\u017Cone, i ca\u0142y czas nast\u0119puje ich dodawanie i kasowanie. Dobre algorytmy indeksowania term\u00F3w s\u0105 wi\u0119c kluczowe dla wydajno\u015Bci takich system\u00F3w. Wa\u017Cniejsze algorytmy indeksowania term\u00F3w to: code tree context tree drzewo dyskryminacyjne (teoria oblicze\u0144) substitution tree"@pl , "In computer science, term indexing is the task of creating an index of terms and clauses in a collection. Many operations in automatic theorem provers require search in huge collections of terms and clauses. Such operations typically fall into the following scheme. Given a collection <math>S</math> of terms (clauses) and a query term (clause) <math>q</math>, find in <math>S</math> some/all terms <math>t</math> related to <math>q</math> according to a certain retrieval condition. Most interesting retrieval conditions are formulated as existence of a substitution that relates in a special way the query and the retrieved objects <math>t</math>. Here is a list of retrieval conditions frequently used in provers: term <math>q</math> is unifiable with term <math>t</math>, i.e. , there exists a substitution <math> \\theta </math>, such that <math>q\\theta</math> = <math>t\\theta</math> term <math>t</math> is an instance of <math>q</math>, i.e. , there exists a substitution <math>\\theta</math>, such that <math>q\\theta</math> = <math>t</math> term <math>t</math> is a generalisation of <math>q</math>, i.e. , there exists a substitution <math>\\theta</math>, such that <math>q</math> = <math>t\\theta</math> clause <math>q</math> subsumes clause <math>t</math>, i.e. , there exists a substitution <math>\\theta</math>, such that <math>q\\theta</math> is a subset/submultiset of <math>t</math> clause <math>q</math> is subsumed by <math>t</math>, i.e. , there exists a substitution <math>\\theta</math>, such that <math>t\\theta</math> is a subset/submultiset of <math>q</math> More often than not, we are actually interested in finding the appropriate substitutions explicitly, together with the retrieved terms <math>t</math>, rather than just in establishing existence of such substitutions. Very often the sizes of term sets to be searched are large, the retrieval calls are frequent and the retrieval condition test is rather complex. In such situations linear search in <math>S</math>, when the retrieval condition is tested on every term from <math>S</math>, becomes prohibitively costly. To overcome this problem, special data structures, called indexes, are designed in order to support fast retrieval. Such data structures, together with the accompanying algorithms for index maintenance and retrieval, are called term indexing techniques."@en ; rdfs:comment "L\u2019index terminologique est utilis\u00E9 pour lister les termes significatifs utilis\u00E9s dans un ouvrage, avec renvoi aux pages auxquelles ils sont utilis\u00E9s. Par extension, en informatique, l'indexation de termes est la t\u00E2che qui consiste \u00E0 cr\u00E9er un index de termes et les clauses de la collecte."@fr , "Indeksowanie term\u00F3w to zagadnienie polegaj\u0105ce na wyszukaniu w pewnym zbiorze term\u00F3w tych term\u00F3w (dowolnego albo te\u017C wszystkich), kt\u00F3re s\u0105 w pewnej relacji z danym termem. Zagadnieniem temu w szczeg\u00F3lno\u015Bci po\u015Bwi\u0119cony jest dzia\u0142 z pogranicza informatyki i matematyki zwany: Systemy Wyszukiwania Informacji. Indeksowanie term\u00F3w ma wiele zastosowa\u0144, ale w wi\u0119kszo\u015Bci typowych problem\u00F3w term\u00F3w jest ma\u0142o i s\u0105 proste, a ich zbi\u00F3r jest sta\u0142y."@pl , "In computer science, term indexing is the task of creating an index of terms and clauses in a collection. Many operations in automatic theorem provers require search in huge collections of terms and clauses. Such operations typically fall into the following scheme."@en . @prefix skos: . @prefix ns7: . dbpedia:Term_indexing skos:subject ns7:Searching . @prefix ns8: . dbpedia:Term_indexing dbpprop:hasPhotoCollection ns8:Term_indexing .