A framework for traversing dense annotation lattices.
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories—the common representation basis for modern pipelined text processing architectures. The open-ended nature of these architectures and expressivene...
| Publicado en: | Language Resources & Evaluation Vol. 44; no. 3; pp. 183 - 204 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Springer Nature
Sep2010
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=52370332&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 52370332 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 1574020X 179V jtl: Language Resources & Evaluation issn: 1574020X maglogo: N pubinfo: dt: Sep2010 vid: 44 iid: 3 pid: 237 pub: Springer Nature artinfo: ui: 52370332 10.1007/s10579-010-9123-y ppf: 183 ppct: 21 formats: fmt: @attributes: type: P size: 411KB tig: atl: A framework for traversing dense annotation lattices. aug: au: Boguraev, Branimir Neff, Mary affil: IBM T.J. Watson Research Center, Yorktown Heights USA su: Annotations Text processing (Computer science) Language & languages Electronic data processing Database management sug: subj: Annotations Text processing (Computer science) Language & languages Electronic data processing Database management keyword: afst Annotation lattices Annotation-based analytics development Corpus analysis Finite-state transduction High density annotation repositories Pattern matching over annotations UIMA ab: Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories—the common representation basis for modern pipelined text processing architectures. The open-ended nature of these architectures and expressiveness of feature structure-based annotation schemes account for the natural tendency of such annotation repositories to become very dense, as multiple levels of analysis get encoded as layered annotations. This particular characteristic presents challenges for the design of a pattern matching framework capable of interpreting ‘flat’ patterns over arbitrarily dense annotation lattices. We present an approach where a finite state device applies (compiled) pattern grammars over what is, in effect, a linearized ‘projection’ of a particular route through the lattice. The route is derived by a mix of static grammar analysis and runtime interpretation of navigational directives within an extended grammar formalism; it selects just the annotations sequence appropriate for the patterns at hand. For expressive and efficient pattern matching in dense annotations stores, our implemented approach achieves a mix of lattice traversal and finite state scanning by exposing a language which, to its user, provides constructs for specifying sequential, structural, and configurational constraints among annotations. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Language Resources & Evaluation is a copyright of Springer, 2010. All Rights Reserved. item: Language Resources & Evaluation holder: Springer Nature dt: @attributes: year: 2010 holdings: @attributes: islocal: N |
|---|