Conditional Random Fields for XML Trees

Abstract : We present Conditional Random Fields (XCRFs), a framework for building conditional models to label XML data. XCRFs are Conditional Random Fields over unranked trees (where every node has an unbounded number of children). The maximal cliques of the graph are triangles consisting of a node and two adjacent children. We equip XCRFs with efficient dynamic programming algorithms for inference and parameter estimation. We experiment XCRFs on tree labeling tasks for structured information extraction and schema matching. Experimental results show that labeling with XCRFs is suitable for these problems.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/inria-00118761
Contributor : Marc Tommasi <>
Submitted on : Wednesday, December 6, 2006 - 1:25:05 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on: Thursday, April 8, 2010 - 1:18:41 PM

File

jousse_MLG06.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00118761, version 1

Collections

Citation

Florent Jousse, Rémi Gilleron, Isabelle Tellier, Marc Tommasi. Conditional Random Fields for XML Trees. Workshop on Mining and Learning in Graphs, Sep 2006, Berlin, Germany. ⟨inria-00118761⟩

Share

Metrics

Record views

402

Files downloads

253