# tagsoup: Parsing and extracting information from (possibly malformed) HTML/XML documents

[ bsd3, library, xml ] [ Propose Tags ]

TagSoup is a library for parsing HTML/XML. It supports the HTML 5 specification, and can be used to parse either well-formed XML, or unstructured and malformed HTML from the web. The library also provides useful functions to extract information from an HTML document, making it ideal for screen-scraping.

Users should start from the Text.HTML.TagSoup module.

## Modules

[Index] [Quick Jump]

• Text

#### Maintainer's Corner

For package maintainers and hackage trustees

Candidates

• No Candidates
Versions [RSS] 0.1, 0.4, 0.6, 0.8, 0.9, 0.10, 0.10.1, 0.11, 0.11.1, 0.12, 0.12.1, 0.12.2, 0.12.3, 0.12.4, 0.12.5, 0.12.6, 0.12.7, 0.12.8, 0.13, 0.13.1, 0.13.2, 0.13.3, 0.13.4, 0.13.5, 0.13.6, 0.13.7, 0.13.8, 0.13.9, 0.13.10, 0.14, 0.14.1, 0.14.2, 0.14.3, 0.14.4, 0.14.5, 0.14.6, 0.14.7, 0.14.8 CHANGES.txt base (>=4 && <5), bytestring, containers, text [details] BSD-3-Clause Neil Mitchell 2006-2019 Neil Mitchell Neil Mitchell XML https://github.com/ndmitchell/tagsoup#readme https://github.com/ndmitchell/tagsoup/issues head: git clone https://github.com/ndmitchell/tagsoup.git by NeilMitchell at 2019-05-01T19:45:41Z Arch:0.14.8, Debian:0.14.8, Fedora:0.14.8, FreeBSD:0.13.3, LTSHaskell:0.14.8, NixOS:0.14.8, Stackage:0.14.8, openSUSE:0.14.8 186276 total (469 in the last 30 days) 2.5 (votes: 3) [estimated by Bayesian average] λ λ λ Docs available Last success reported on 2019-05-01

[back to package description]

# TagSoup

TagSoup is a library for parsing HTML/XML. It supports the HTML 5 specification, and can be used to parse either well-formed XML, or unstructured and malformed HTML from the web. The library also provides useful functions to extract information from an HTML document, making it ideal for screen-scraping.

The library provides a basic data type for a list of unstructured tags, a parser to convert HTML into this tag type, and useful functions and combinators for finding and extracting information. This document gives two particular examples of scraping information from the web, while a few more may be found in the Sample file from the source repository. The examples we give are:

• Obtaining a list of Simon Peyton Jones' latest papers
• A brief overview of some other examples

The intial version of this library was written in Javascript and has been used for various commercial projects involving screen scraping. In the examples general hints on screen scraping are included, learnt from bitter experience. It should be noted that if you depend on data which someone else may change at any given time, you may be in for a shock!

This library was written without knowledge of the Java version of TagSoup. They have made a very different design decision: to ensure default attributes are present and to properly nest parsed tags. We do not do this - tags are merely a list devoid of nesting information.

#### Acknowledgements

Thanks to Mike Dodds for persuading me to write this up as a library. Thanks to many people for debugging and code contributions, including: Gleb Alexeev, Ketil Malde, Conrad Parker, Henning Thielemann, Dino Morelli, Emily Mitchell, Gwern Branwen.

## Potential Bugs

There are two things that may go wrong with these examples:

• The Websites being scraped may change. There is nothing I can do about this, but if you suspect this is the case let me know, and I'll update the examples and tutorials. I have already done so several times, it's only a few minutes work.
• The openURL method may not work. This happens quite regularly, and depending on your server, proxies and direction of the wind, they may not work. The solution is to use wget to download the page locally, then use readFile instead. Hopefully a decent Haskell HTTP library will emerge, and that can be used instead.

Our goal is to develop a program that displays the date that the wiki at wiki.haskell.org was last modified. This example covers all the basics in designing a basic web-scraping application.

### Finding the Page

We first need to find where the information is displayed and in what format. Taking a look at the front web page, when not logged in, we see:

<ul id="f-list">
</ul>


Rule 1: Scrape from what the page returns, not what a browser renders, or what view-source gives.

Some web servers will serve different content depending on the user agent, some browsers will have scripting modify their displayed HTML, some pages will display differently depending on your cookies. Before you can start to figure out how to start scraping, first decide what the input to your program will be. There are two ways to get the page as it will appear to your program.

#### Using the HTTP package

We can write a simple HTTP downloader with using the HTTP package:

module Main where

import Network.HTTP

openURL :: String -> IO String
openURL x = getResponseBody =<< simpleHTTP (getRequest x)

main :: IO ()
main = do
writeFile "temp.htm" src


Now open temp.htm, find the fragment of HTML containing the hit count, and examine it.

### Finding the Information

Now we examine both the fragment that contains our snippet of information, and the wider page. What does the fragment have that nothing else has? What algorithm would we use to obtain that particular element? How can we still return the element as the content changes? What if the design changes? But wait, before going any further:

Rule 2: Do not be robust to design changes, do not even consider the possibility when writing the code.

If the user changes their website, they will do so in unpredictable ways. They may move the page, they may put the information somewhere else, they may remove the information entirely. If you want something robust talk to the site owner, or buy the data from someone. If you try and think about design changes, you will complicate your design, and it still won't work. It is better to write an extraction method quickly, and happily rewrite it when things change.

So now, let's consider the fragment from above. It is useful to find a tag which is unique just above your snippet - something with a nice id or class attribute - something which is unlikely to occur multiple times. In the above example, an id with value lastmod seems perfect.

module Main where

import Data.Char
import Network.HTTP
import Text.HTML.TagSoup

openURL :: String -> IO String
openURL x = getResponseBody =<< simpleHTTP (getRequest x)

let lastModifiedDateTime = fromFooter $parseTags src putStrLn$ "wiki.haskell.org was last modified on " ++ lastModifiedDateTime
where fromFooter = unwords . drop 6 . words . innerText . take 2 . dropWhile (~/= "<li id=lastmod>")

main :: IO ()


Now we start writing the code! The first thing to do is open the required URL, then we parse the code into a list of Tags with parseTags. The fromFooter function does the interesting thing, and can be read right to left:

• First we throw away everything (dropWhile) until we get to an li tag containing id=lastmod. The (~==) and (~/=) operators are different from standard equality and inequality since they allow additional attributes to be present. We write "<li id=lastmod>" as syntactic sugar for TagOpen "li" [("id","lastmod")]. If we just wanted any open tag with the given id attribute we could have written (~== TagOpen "" [("id","lastmod")]) and this would have matched. Any empty strings in the second element of the match are considered as wildcards.
• Next we take two elements: the <li> tag and the text node immediately following.
• We call the innerText function to get all the text values from inside, which will just be the text node following the lastmod.
• We split the string into a series of words and drop the first six, i.e. the words This, page, was, last, modified and on
• We reassemble the remaining words into the resulting string 9 September 2013, at 22:38.

This code may seem slightly messy, and indeed it is - often that is the nature of extracting information from a tag soup.

Rule 3: TagSoup is for extracting information where structure has been lost, use more structured information if it is available.

## Simon's Papers

Our next very important task is to extract a list of all Simon Peyton Jones' recent research papers off his home page. The largest change to the previous example is that now we desire a list of papers, rather than just a single result.

As before we first start by writing a simple program that downloads the appropriate page, and look for common patterns. This time we want to look for all patterns which occur every time a paper is mentioned, but no where else. The other difference from last time is that previous we grabbed an automatically generated piece of information - this time the information is entered in a more freeform way by a human.

First we spot that the page helpfully has named anchors, there is a current work anchor, and after that is one for Haskell. We can extract all the information between them with a simple take/drop pair:

takeWhile (~/= "<a name=haskell>") $drop 5$ dropWhile (~/= "<a name=current>") tags


This code drops until you get to the "current" section, then takes until you get to the "haskell" section, ensuring we only look at the important bit of the page. Next we want to find all hyperlinks within this section:

map f $sections (~== "<A>")$ ...


Remember that the function to select all tags with name "A" could have been written as (~== TagOpen "A" []), or alternatively isTagOpenName "A". Afterwards we map each item with an f function. This function needs to take the tags starting just after the link, and find the text inside the link.

f = dequote . unwords . words . fromTagText . head . filter isTagText


Here the complexity of interfacing to human written markup comes through. Some of the links are in italic, some are not - the filter drops all those that are not, until we find a pure text node. The unwords . words deletes all multiple spaces, replaces tabs and newlines with spaces and trims the front and back - a neat trick when dealing with text which has spacing at the source code but not when displayed. The final thing to take account of is that some papers are given with quotes around the name, some are not - dequote will remove the quotes if they exist.

For completeness, we now present the entire example:

module Main where

import Network.HTTP
import Text.HTML.TagSoup

openURL :: String -> IO String
openURL x = getResponseBody =<< simpleHTTP (getRequest x)

spjPapers :: IO ()
spjPapers = do
tags <- parseTags <$> openURL "http://research.microsoft.com/en-us/people/simonpj/" let links = map f$ sections (~== "<A>") $takeWhile (~/= "<a name=haskell>")$
drop 5 $dropWhile (~/= "<a name=current>") tags putStr$ unlines links
where
f :: [Tag String] -> String
f = dequote . unwords . words . fromTagText . head . filter isTagText

dequote ('\"':xs) | last xs == '\"' = init xs
dequote x = x

main :: IO ()
main = spjPapers


## Other Examples

Several more examples are given in the Sample.hs file, including obtaining the (short) list of papers from my site, getting the current time and a basic XML validator. All use very much the same style as presented here - writing screen scrapers follow a standard pattern. We present the code from two for enjoyment only.

### My Papers

module Main where

import Network.HTTP
import Text.HTML.TagSoup

openURL :: String -> IO String
openURL x = getResponseBody =<< simpleHTTP (getRequest x)

ndmPapers :: IO ()
ndmPapers = do
tags <- parseTags <$> openURL "http://community.haskell.org/~ndm/downloads/" let papers = map f$ sections (~== "<li class=paper>") tags
putStr $unlines papers where f :: [Tag String] -> String f xs = fromTagText (xs !! 2) main :: IO () main = ndmPapers  ### UK Time module Main where import Network.HTTP import Text.HTML.TagSoup openURL :: String -> IO String openURL x = getResponseBody =<< simpleHTTP (getRequest x) currentTime :: IO () currentTime = do tags <- parseTags <$> openURL "http://www.timeanddate.com/worldclock/uk/london"
let time = fromTagText (dropWhile (~/= "<span id=ct>") tags !! 1)
putStrLn time

main :: IO ()
main = currentTime


## Other Examples

In Sample.hs the following additional examples are listed: