Datasets:
mteb
/
sts16-sts

Dataset card Viewer Files Community
1
split
stringclasses
1 value
sentence1
stringlengths
12
283
sentence2
stringlengths
10
290
score
float64
0
5
test
there is also conditional probability which is usually interested in the way variables relate to each other .
the pagerank is a recursive algorithm used by google to determine which webpages are more important than others .
0
test
thus , the program is the best plan for action that is produced .
thus , the " program " is the optimal plan for action that is produced .
5
test
inheritance is a basic concept in object oriented programming .
inheritance in object oriented programming is a way to form new classes using classes that have already been defined .
3
test
programming , in this sense , means finding an acceptable plan of action .
programming , in this sense , means finding an acceptable plan , an algorithm .
4
test
the vector space model has some limitations : 1 .
the vector space model has several disadvantages .
4
test
using the vector space model for information retrieval models all pages and queries as high-dimensional sparse vectors .
a possible use for a vector space model is for retrieval and filtering of information .
4
test
one of the most famous schemes is tf-idf weighting .
one of the best known schemes is tf-idf ( term frequency-inverse document frequency ) weighting .
4
test
a document is represented as a vector , with each dimension corresponding to a separate term .
a document has representation as a vector .
3
test
vector space representation results in the loss of the order which the terms are in the document .
the order in which terms appear in the document is lost in a vector space representation .
4
test
p ( a ) is the probability of the student being a girl ( which is 2 / 5 ) .
what is the probability this student is a girl ?
2
test
the basic idea is to represent each document as a vector of certain weighted word frequencies .
if a term appears in the document , the terms value in the vector is non-zero .
1
test
therefore , the " program " is the optimal plan for action that is produced .
the " program " is the optimal plan for action that is produced .
5
test
this is highly used in dynamic programming .
there are four steps in dynamic programming : 1 .
2
test
other ways of computing these values , or weights , have been developed .
many different methods of calculating these values , sometimes known as ( term ) weights , have been developed .
4
test
it is usually be used to compute posterior probabilities given observations .
it is used to compute posterior probabilities given observations .
4
test
in probability theory , bayes ' theorem relates the conditional and marginal probabilities of two random events .
bayes theorem is a mathematical formula used to calculate conditional probabilities .
3
test
p ( b ) is the prior or marginal probability of b , and acts as a normalizing constant .
p ( b | a ) is the conditional probability of b given a .
1
test
a website ’ s page rank , is how ‘ important ’ it is on the web .
a variation of the pagerank method bases the importance of a webpage on how many visits the page gets .
3
test
in computer science ; dynamic programming is a way of solving problems consist of overlapping subproblems and optimal substructure .
dynamic programming is a very powerful mathematical technique , often utilised in programming , for solving optimization problems .
4
test
the most popular is tf-idf weighting .
one of the most famous schemes is tf-idf weighting .
4
test
this method is used in the google toolbar , which reports back actual site visits to google .
in order to prevent spamming , google releases little information on the way in which a pagerank is calculated .
1
test
to achieve this , the programmer has to note generalisations and similarities about various aspects of the program .
mathematicians use the word to describe a set of rules which anyone can follow to solve a problem .
0
test
construct an optimal solution from computed values .
the last point would be to construct an optimal solution from the computed values .
4
test
if the term doesn ’ t occur within the document , the value in the vector is zero .
if a term appears in the document , the terms value in the vector is non-zero .
3
test
this is a much quicker method than other more naive methods .
the method takes much less time than naive methods .
4
test
p ( b ) is the prior or marginal probability of b , and acts to normalise the probability .
p ( a ) , or the probability that the student is a girl regardless of any other information .
1
test
inheritance in object oriented programming is a way to form new classes using classes that have already been defined .
inheritance in object oriented programming is where a new class is formed using classes which have allready been defined .
4
test
they also inherit the attributes and methods of its superclass .
the new classes are called derived classes and they inherit the behaviours and attributes of the base classes .
3
test
a term which occurs in the document has a value in the vector of non-zero .
a document is represented as a vector , with each dimension corresponding to a separate term .
2
test
if a term appears in the document , the terms value in the vector is non-zero .
a term which occurs in the document has a value in the vector of non-zero .
5
test
the order in which terms appear in the document is lost in a vector space representation .
in vector space model , the documents from which the information is to be retrieved are represented as vectors .
1
test
the vector space model has some limitations : 1 .
limitation : there is some limitation of vector space model .
5
test
however , the vector space model has limitations .
the limitations of the vector space model are thus .
4
test
the method can be abused when people deliberately link to sites in order to raise a site 's pagerank .
mathematicians use the word to describe a set of rules which anyone can follow to solve a problem .
0
test
when a document is represented as a vector , each dimension corresponds to a separate term .
to explain further vector space models , basically a document is characterized by a vector .
2
test
the basic idea is to represent each document as a vector of certain weighted word frequencies .
a term which occurs in the document has a value in the vector of non-zero .
1
test
programming , in this sense , means finding an acceptable plan of action .
programming means finding a plan of action .
4
test
google ’ s payoff is that it gets to track the behaviour of actual users .
after this , it is using this to pick the best overall path .
0
test
this means that inheritance is used when types have common factors and these would be put into the superclass .
there is also conditional probability which is usually interested in the way variables relate to each other .
0
test
bayes ’ theorem was names after rev thomas bayes and is a method used in probability theory .
as a formal theorem bayes theorem is valid in all common interpretations of probability .
3
test
dynamic programming solves problems by combining the solutions of subproblems .
the key to dynamic programming is to find the structure of optimal solutions .
4
test
terms are basically the words or any indexing unit used to identify the contents of a text .
in this classic model the term specific weights in the document vectors are products of local and global parameters .
2
test
the vector space model are the documents which are represented as “ bags of words ” .
in vector space model , the documents from which the information is to be retrieved are represented as vectors .
2
test
thus , the " program " is the optimal plan of action that is being produced .
the easiest way to look at inheritance is as an “ … is a kind of ” relationship .
0
test
to achieve this , the programmer has to note generalisations and similarities about various aspects of the program .
the advantage being the less time consumption in comparison to other amateur methods .
0
test
subclasses are said to extend or specialise their superclasses .
subclasses are said to ‘ extend ’ superclasses .
4
test
it is also called the posterior probability because it is derived from or depends upon the specified value of b .
it is also called the subsequent probability because it is derived from or depends upon the specified value of b .
3
test
this can be useful when the number of times a word appears is not considered important .
it is mainly used to calculate the probability of one event ’ s outcome given that a previous event happened .
0
test
java allows object inheritance .
inheritance is one of the basic concepts of object oriented programming .
1
test
mathematicians use the word to describe a set of rules which anyone can follow to solve a problem .
instead , a new object is made to inherit properties of objects which already exist .
0
test
virtual attributes and methods can be shadowed / overridden .
in java all attributes and methods are implicitly virtual .
1
test
one of the best known schemes is tf-idf weighting , proposed by salton , wong and yang .
tf-idf weighting is one of the most well known schemes .
3
test
in the vector space model a document is represented as a vector .
the vector space model are the documents which are represented as “ bags of words ” .
1
test
the vector space model has the following limitations : 1 .
limitation : there is some limitation of vector space model .
3
test
it is intended to help reuse existing code with little or no modification .
the idea of inheritance is to reuse the existing code with little or no modification at all .
3
test
it is often used to compute posterior probabilities given observations .
the theorem is often used when we have observations and wish to compute posterior probabilities .
4
test
when any sub-problem is met again , it can be found and re-used to solve another problem .
it was intended to allow existing code to be used again with minimal or no alteration .
2
test
the peropos of inheritance in object oriented programming is to minimize the reuse of existing code without modification .
in object oriented programming inheritance is also dependant on access level modifiers .
1
test
every dimension is precisely related to a separate term .
each and every dimension corresponds to a separate term .
4
test
the other method is the top down approach which is a method that combines memorization and recursion .
the easiest way to look at inheritance is as an “ … is a kind of ” relationship .
0
test
p ( a ) , or the probability that the student is a girl regardless of any other information .
later versions of pagerank ( see the below formulas ) would assume a probability distribution between 0 and 1 .
0
test
when a document is represented as a vector , each dimension corresponds to a separate term .
the value of a vector is non-zero if a term occurs in the document .
1
test
to achieve this , the programmer has to note generalisations and similarities about various aspects of the program .
terms are basically the words or any indexing unit used to identify the contents of a text .
0
test
the vector space model are the documents which are represented as “ bags of words ” .
the limitations of the vector space model are thus .
2
test
the vector space model is one of these methods , and it is an algebraic model .
in vector space model , the documents from which the information is to be retrieved are represented as vectors .
1
test
the vector space model has the following limitations : 1 .
the vector space model has some limitations : 1 .
5
test
however an object cannot be cast to a class which is no relative of it .
here by meaning that a program can be an optimal plan for the produced action .
0
test
the vector is then constucted of the frequency of eacher word ( dimension ) .
the basic idea is to represent each document as a vector of certain weighted word frequencies .
3
test
typically terms are single words , keywords , or longer phrases .
typically terms are keywords , single words or longer phrases .
5
test
it does not take into account any information about b and therefore is considered “ prior ” .
it doesn 't take into account any information about b , so it is " prior " .
5
test
the pagerank depends on the pagerank rating and number of all pages that have links to it .
of a particular page is roughly based upon the quantity of inbound links as well as the pagerank ?
3
test
construct an optimal solution from computed values .
use these optimal solutions to construct an optimal solution for the original problem .
4
test
single words , keywords and occasionally longer phrases are used for terms .
the number of unique words in the vocabulary denotes the dimensionality , if words are used for the terms .
3
test
the vector space model has several disadvantages .
a document has representation as a vector .
1
test
every dimension is precisely related to a separate term .
a document is represented as a vector , with each dimension corresponding to a separate term .
4
test
this means that inheritance is used when types have common factors and these would be put into the superclass .
occasionally it is advantageous to differentiate between these uses , as it is not necessarily noticeable from context .
0
test
this is highly used in dynamic programming .
the key to dynamic programming is to find the structure of optimal solutions .
2
test
the idea of inheritance is to reuse the existing code with little or no modification at all .
the idea of inheritance in oop refers to the formation of new classes with the already existing classes .
3
test
the peropos of inheritance in object oriented programming is to minimize the reuse of existing code without modification .
however , the key in dynamic programming is to determine the structure of optimal solutions .
1
test
a document is represented as a vector and each dimension corresponds to a separate term .
when a document is represented as a vector , each dimension corresponds to a separate term .
5
test
it is valid in all common interpretations of probability .
as an official theorem , bayes ' theorem is valid in all universal interpretations of probability .
3
test
the order in which the terms appear in the document is lost in the vector space representation .
if the term doesn ’ t occur within the document , the value in the vector is zero .
1
test
since it is a formal theorem , bayes ' theorem holds in all popular interpretations of probability .
as a formal theorem , bayes ' theorem is valid in all common interpretations of probability .
5
test
the methodology takes much less time rather than naive methods .
the method is more effiecent than naive methods .
5
test
the most popular is tf-idf weighting .
one of the best known schemes is tf-idf ( term frequency-inverse document frequency ) weighting .
4
test
this means that inheritance is used when types have common factors and these would be put into the superclass .
this can be useful when the number of times a word appears is not considered important .
0
test
the value of a vector is non-zero if a term occurs in the document .
if the term doesn ’ t occur within the document , the value in the vector is zero .
3
test
the value of a vector is non-zero if a term occurs in the document .
the order in which the terms appear in the document is lost in the vector space representation .
1
test
the way that a ' term ' is defined depends on the application .
the easiest way to look at inheritance is as an “ … is a kind of ” relationship .
0
test
the similarity measures largely identify the retrieval efficiency of a particular information retrieval system .
it is used in information retrieval and was first used in the smart information retrieval system .
1
test
typically terms are keywords , single words or longer phrases .
single words , keywords and occasionally longer phrases are used for terms .
5
test
the vector space model is one of these methods , and it is an algebraic model .
the vector space model has the following limitations : 1 .
1
test
therefore , the " program " is the optimal plan for action that is produced .
since the pagerank is the most important algorithms which is used in the google engine .
0
test
• p ( a | b ) is the conditional probability of a , given b .
p ( b ) ( a.k.a. the normalizing constant ) is the prior or marginal probability of b .
1
test
construct an optimal solution from computed values .
generate the optimal solution of these computed values
5
test
the theorem is often used when we have observations and wish to compute posterior probabilities .
it is usually be used to compute posterior probabilities given observations .
4
test
generalise the structure of an optimal solution 2 .
use these optimal solutions to construct an optimal solution for the original problem .
1
test
the vector space model is one of these methods , and it is an algebraic model .
the vector space model has several disadvantages .
1
test
if the term doesn ’ t occur within the document , the value in the vector is zero .
finally , the order in which the terms appear in the document is lost in the vector space representation .
1
test
when a document is represented as a vector , each dimension corresponds to a separate term .
in the vector space model a document is represented as a vector .
3