BIROn - Birkbeck Institutional Research Online

    Syntactic pattern matching with GraphSpider and MPL

    Shepherd, Adrian J. and Clegg, A.B. (2008) Syntactic pattern matching with GraphSpider and MPL. In: Proceedings of the Third Symposium on Semantic Mining in Biomedicine, September 1-3 2008, Turku, Finland.

    Full text not available from this repository.


    We present MPL (Metapattern Language), a new formalism for defining patterns over dependency-parsed text, and GraphSpider, a matching engine for extracting dependency subgraphs which match against MPL patterns. Using a regexp-like syntax, MPL allows the definition of subgraphs matching user-specified patterns which can be constrained by word or word class, part-of speech tag, dependency type and direction, and presence of named variables in particular locations. Although MPL and Graph- Spider are general-purpose, we developed a set of patterns to capture biomolecular interactions which achieved very high precision results (92.6% at 31.2% recall) on the LLL Challenge corpus. MPL specifications and pattern sets, and the GraphSpider software, are available on SourceForge:


    Item Type: Conference or Workshop Item (Paper)
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Natural Sciences
    Research Centres and Institutes: Bioinformatics, Bloomsbury Centre for (Closed), Structural Molecular Biology, Institute of (ISMB)
    Depositing User: Administrator
    Date Deposited: 04 Aug 2010 14:09
    Last Modified: 02 Aug 2023 16:49


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item