|
{ |
|
"paper_id": "N03-2001", |
|
"header": { |
|
"generated_with": "S2ORC 1.0.0", |
|
"date_generated": "2023-01-19T14:07:53.360625Z" |
|
}, |
|
"title": "Automating XML markup of text documents", |
|
"authors": [ |
|
{ |
|
"first": "Shazia", |
|
"middle": [], |
|
"last": "Akhtar", |
|
"suffix": "", |
|
"affiliation": { |
|
"laboratory": "", |
|
"institution": "University College Dublin", |
|
"location": { |
|
"settlement": "Belfield, Dublin 4", |
|
"country": "Ireland" |
|
} |
|
}, |
|
"email": "[email protected]" |
|
}, |
|
{ |
|
"first": "Ronan", |
|
"middle": [ |
|
"G" |
|
], |
|
"last": "Reilly", |
|
"suffix": "", |
|
"affiliation": { |
|
"laboratory": "", |
|
"institution": "National University of Ireland", |
|
"location": { |
|
"settlement": "Maynooth", |
|
"country": "Ireland" |
|
} |
|
}, |
|
"email": "[email protected]" |
|
}, |
|
{ |
|
"first": "John", |
|
"middle": [], |
|
"last": "Dunnion", |
|
"suffix": "", |
|
"affiliation": { |
|
"laboratory": "", |
|
"institution": "University College Dublin", |
|
"location": { |
|
"addrLine": "Belfield, Dublin 4", |
|
"country": "Ireland" |
|
} |
|
}, |
|
"email": "[email protected]" |
|
} |
|
], |
|
"year": "", |
|
"venue": null, |
|
"identifiers": {}, |
|
"abstract": "We present a novel system for automatically marking up text documents into XML and discuss the benefits of XML markup for intelligent information retrieval. The system uses the Self-Organizing Map (SOM) algorithm to arrange XML marked-up documents on a twodimensional map so that similar documents appear closer to each other. It then employs an inductive learning algorithm C5 to automatically extract and apply markup rules from the nearest SOM neighbours of an unmarked document. The system is designed to be adaptive, so that once a document is marked-up; its behaviour is modified to improve accuracy. The automatically marked-up documents are again categorized on the Self-Organizing Map.", |
|
"pdf_parse": { |
|
"paper_id": "N03-2001", |
|
"_pdf_hash": "", |
|
"abstract": [ |
|
{ |
|
"text": "We present a novel system for automatically marking up text documents into XML and discuss the benefits of XML markup for intelligent information retrieval. The system uses the Self-Organizing Map (SOM) algorithm to arrange XML marked-up documents on a twodimensional map so that similar documents appear closer to each other. It then employs an inductive learning algorithm C5 to automatically extract and apply markup rules from the nearest SOM neighbours of an unmarked document. The system is designed to be adaptive, so that once a document is marked-up; its behaviour is modified to improve accuracy. The automatically marked-up documents are again categorized on the Self-Organizing Map.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Abstract", |
|
"sec_num": null |
|
} |
|
], |
|
"body_text": [ |
|
{ |
|
"text": "Vast amounts of information are now available in electronic form to which accurate and speedy access is getting more difficult.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "The increasing quantity of information has created a need for intelligent management and retrieval techniques. Many of the existing information retrieval systems, which deal with large volumes of documents, have poor retrieval performance because these systems can use a little knowledge in the documents. By adopting XML as a standard document format, content-based queries can be performed by exploiting the XML structure of the documents. In addition, specifically tagged sections of the documents can be searched rather than the entire document, thus providing fast and effective retrieval. Furthermore, using the logical structure of a document created by XML markup, different types of operations can be performed, for example, the same content can be reused in a variety of formats, specific elements can be extracted from the XML documents and full documents satisfying certain structural conditions can be retrieved from the database. These and other advantages of using XML make it a complete solution for content management and intelligent information retrieval. However, despite the advantages and the popularity of XML, we still do not have large repositories of XML because automatic XML markup is still a challenge and the process of manually marking up XML documents is complex, tedious and expensive. Most of the existing automatic markup systems are limited to certain domains and do not perform general automatic markup. In addressing the need for more general automatic markup of text documents, we present a system with a novel hybrid architecture. The system uses the techniques of Self-Organizing Map (SOM) algorithm (Kohonen, 1997) and an inductive learning algorithm, C5 (Quinlan, 1993 (Quinlan, , 2000 .", |
|
"cite_spans": [ |
|
{ |
|
"start": 1640, |
|
"end": 1655, |
|
"text": "(Kohonen, 1997)", |
|
"ref_id": "BIBREF1" |
|
}, |
|
{ |
|
"start": 1696, |
|
"end": 1710, |
|
"text": "(Quinlan, 1993", |
|
"ref_id": "BIBREF3" |
|
}, |
|
{ |
|
"start": 1711, |
|
"end": 1727, |
|
"text": "(Quinlan, , 2000", |
|
"ref_id": "BIBREF4" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "The system has two phases. The first phase of the system deals with the formation of a map of valid XML (a valid XML document is one which is well-formed and which has been validated against a DTD) marked-up documents using the SOM algorithm. The second phase deals with the automatic markup of new (unmarked) document according to the markup of existing documents. Once a document is marked-up, the system's behaviour is modified to improve accuracy. These two phases of the system are currently implemented independently but will be combined to form an integrated hybrid system. This paper focuses on phase 2 of the system.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "System overview", |
|
"sec_num": "2" |
|
}, |
|
{ |
|
"text": "Phase 2 of the system is implemented as an independent automatic XML markup system, which is Figure 1 . It comprises two main modules -a Rule extraction module and a Markup module. The rule extraction module deals with the extraction of rules using an inductive learning approach (Mitchell, 1997) . Firstly, during a preliminary phase, training examples are collected from the valid XML marked-up documents. These documents should be from a specific domain and their markup should be valid and conformant to the rules of a single Document Type Definition (DTD). An XML document consists of a strictly nested hierarchy of elements with a root element. Only elements having text nodes are considered as markup elements for our system. The markup of elements nested within other elements can be accomplished by using the DTD. Each training instance corresponds to an element containing a text node from the collection of marked-up documents. The text enclosed between the start and end tags of all occurrences of each element is encoded using a fixed-width feature vector. We have used 31 features in our experiments. The set of feature vectors is used by the system to learn classifiers. An inductive learning algorithm processes these encoded instances to develop classifiers for elements having specific tag names. These classifiers segment the text of an unmarked document into different elements of the resulting XML marked-up document. In our system, the C5 program is used to learn classifiers. These classifiers are later used to markup the segments of text as XML elements.", |
|
"cite_spans": [ |
|
{ |
|
"start": 280, |
|
"end": 296, |
|
"text": "(Mitchell, 1997)", |
|
"ref_id": "BIBREF2" |
|
} |
|
], |
|
"ref_spans": [ |
|
{ |
|
"start": 93, |
|
"end": 101, |
|
"text": "Figure 1", |
|
"ref_id": null |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "System overview", |
|
"sec_num": "2" |
|
}, |
|
{ |
|
"text": "The second module deals with the creation of XML markup. The unmarked document to be used for this process should be from the same domain and should have a similar structure to the documents, which were used for learning the rules. To accomplish the markup, the unmarked document is segmented into pieces of text using a variety of heuristics. These heuristics are derived from the set of training examples. By using the DTD conformant to the document set used for learning the rules and by using the text segments stored for each element, a hierarchical structure of the document is encoded and the marked-up document is produced.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "System overview", |
|
"sec_num": "2" |
|
}, |
|
{ |
|
"text": "The markup produced by the system can be validated according to a DTD. However, in order to check the accuracy of the markup, we have to examine it manually and compare it with the original source (if available) as XML processors can only validate the syntax of the markup, and not its semantics.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "System overview", |
|
"sec_num": "2" |
|
}, |
|
{ |
|
"text": "We used documents from a number of different domains for our experiments, including letters from the Mac-Greevy archive (Schreibman, 1998 (Schreibman, , 2000 , a database of employee records, Shakespearean plays (Bosak, 1998) , poems from an early American encoding project, and scientific journal articles (Openly Informatics, Inc., 1999-200) . Figure 2 shows a part of a scene from \"A Midsummer Night's Dream\" as an example of XML markup automatically produced by our system. The underlined text was not marked up by our system.", |
|
"cite_spans": [ |
|
{ |
|
"start": 120, |
|
"end": 137, |
|
"text": "(Schreibman, 1998", |
|
"ref_id": null |
|
}, |
|
{ |
|
"start": 138, |
|
"end": 157, |
|
"text": "(Schreibman, , 2000", |
|
"ref_id": "BIBREF7" |
|
}, |
|
{ |
|
"start": 212, |
|
"end": 225, |
|
"text": "(Bosak, 1998)", |
|
"ref_id": null |
|
}, |
|
{ |
|
"start": 307, |
|
"end": 343, |
|
"text": "(Openly Informatics, Inc., 1999-200)", |
|
"ref_id": null |
|
} |
|
], |
|
"ref_spans": [ |
|
{ |
|
"start": 346, |
|
"end": 354, |
|
"text": "Figure 2", |
|
"ref_id": null |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Performance", |
|
"sec_num": "3" |
|
}, |
|
{ |
|
"text": "We have also evaluated our system with some of the document sets. For evaluation, we considered the elements representing the content of the document, and a human expert is required to evaluate this. We have used three performance measures in evaluating the automatic markup process. These measures are", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Performance", |
|
"sec_num": "3" |
|
}, |
|
{ |
|
"text": "\u2022 The percentage of markup elements determined correctly by the system \u2022 The percentage of markup elements determined incorrectly by the system \u2022 The percentage of markup elements not determined by the system (i.e. text nodes for these markup elements are not present in the markedup document produced by the system)", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Performance", |
|
"sec_num": "3" |
|
}, |
|
{ |
|
"text": "The elements of 10 valid XML marked-up letters from the MacGreevy archive were used to learn C5 rules and text segmentation heuristics. By applying these rules and heuristics, 55 elements of five unmarked letters from the MacGreevy archive were automatically marked up by the system with 96% accuracy (we use the term \"accuracy\" here to mean the number of marked-up elements correctly determined by the system). Similarly, elements of 5 valid XML marked-up Shakespeare plays were used as training examples and 13882 elements of four Shakespearean plays were automatically marked-up by the system. In this case the accuracy rate was 92%. ", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Performance", |
|
"sec_num": "3" |
|
}, |
|
{ |
|
"text": "We have described a system with a novel hybrid architecture that uses an inductive learning approach to perform automatic markup of text documents. The system automatically marks up documents by capturing markup information from the neighbouring documents on a Self-Organizing Map. Such marked-up documents can be used for management and retrieval purposes according to the structural information they contain. The results from our experiments demonstrate that our approach is practical and that our system provides a novel approach for automatically marking up text documents in XML. The functionality of our system makes it a useful tool for electronic information exchange.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Conclusion", |
|
"sec_num": "4" |
|
} |
|
], |
|
"back_matter": [ |
|
{ |
|
"text": "The support of the Informatics Research Initiative of Enterprise Ireland is gratefully acknowledged. The work was funded under grant PRP/00/INF/06.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Acknowledgements", |
|
"sec_num": null |
|
} |
|
], |
|
"bib_entries": { |
|
"BIBREF1": { |
|
"ref_id": "b1", |
|
"title": "Self-Organizing Maps. Springer Series in Information Science", |
|
"authors": [ |
|
{ |
|
"first": "T", |
|
"middle": [], |
|
"last": "Kohonen", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 1997, |
|
"venue": "", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Kohonen, T. (1997). Self-Organizing Maps. Springer Series in Information Science, Berlin, Heidelberg, New York.", |
|
"links": null |
|
}, |
|
"BIBREF2": { |
|
"ref_id": "b2", |
|
"title": "Machine Learning. McGraw Hill", |
|
"authors": [ |
|
{ |
|
"first": "T", |
|
"middle": [], |
|
"last": "Mitchell", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 1997, |
|
"venue": "", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Mitchell, T. (1997). Machine Learning. McGraw Hill.", |
|
"links": null |
|
}, |
|
"BIBREF3": { |
|
"ref_id": "b3", |
|
"title": "C4.5: Programs For Machine Learning", |
|
"authors": [ |
|
{ |
|
"first": "J", |
|
"middle": [ |
|
"R" |
|
], |
|
"last": "Quinlan", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 1993, |
|
"venue": "", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Quinlan, J. R. (1993). C4.5: Programs For Machine Learning. Morgan Kauffman Publishers, San Mateo, Calif.", |
|
"links": null |
|
}, |
|
"BIBREF4": { |
|
"ref_id": "b4", |
|
"title": "Data Mining Tools See5 and C5", |
|
"authors": [ |
|
{ |
|
"first": "J", |
|
"middle": [ |
|
"R" |
|
], |
|
"last": "Quinlan", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 1999, |
|
"venue": "", |
|
"volume": "0", |
|
"issue": "", |
|
"pages": "", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Quinlan, J. R. (2000). Data Mining Tools See5 and C5.0. [http://www.rulequest.com/see5-info.html] Openly Informatics, Inc. (1999-2000). [http://www.openly.com/efirst]", |
|
"links": null |
|
}, |
|
"BIBREF6": { |
|
"ref_id": "b6", |
|
"title": "The MacGreevy Archive", |
|
"authors": [], |
|
"year": null, |
|
"venue": "", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "The MacGreevy Archive. [http://www.ucd.ie/~cosei/archive.htm]", |
|
"links": null |
|
}, |
|
"BIBREF7": { |
|
"ref_id": "b7", |
|
"title": "The MacGreevy Archive", |
|
"authors": [ |
|
{ |
|
"first": "S", |
|
"middle": [], |
|
"last": "Schreibman", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2000, |
|
"venue": "", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Schreibman, S. (2000). The MacGreevy Archive. [http://jafferson.village.Virginia.edu/macgreevy]", |
|
"links": null |
|
} |
|
}, |
|
"ref_entries": { |
|
"FIGREF0": { |
|
"num": null, |
|
"text": "Automatic XML markup system", |
|
"type_str": "figure", |
|
"uris": null |
|
} |
|
} |
|
} |
|
} |