International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)
World Wide Web consists of vast information which is scattered across millions of web pages. The authors consider the problem of extracting relations from this huge data. Relations can be unary such as, creating just lists of various cities, movies, actors, etc. or binary such as all the (author, book) pairs. They want to propose an unsupervised algorithm to extract the required information from the corpus. Some small no. of seed examples can be used. Here, they are interested in finding out relationships which may be spanned over the entire length of the document. It is important to note that, their algorithm differs from the previous algorithms proposed in the aspects.