Text Chunking Using Transformation-Based Learning
Lance Ramshaw,Mitchell Marcus +1 more
- pp 157-176
Reads0
Chats0
TLDR
This work has shown that the transformation-based learning approach can be applied at a higher level of textual interpretation for locating chunks in the tagged text, including non-recursive “baseNP” chunks.Abstract:
Transformation-based learning, a technique introduced by Eric Brill (1993b), has been shown to do part-of-speech tagging with fairly high accuracy. This same method can be applied at a higher level of textual interpretation for locating chunks in the tagged text, including non-recursive “baseNP” chunks. For this purpose, it is convenient to view chunking as a tagging problem by encoding the chunk structure in new tags attached to each word. In automatic tests using Treebank-derived data, this technique achieved recall and precision rates of roughly 93% for baseNP chunks (trained on 950K words) and 88% for somewhat more complex chunks that partition the sentence (trained on 200K words). Working in this new application and with larger template and training sets has also required some interesting adaptations to the transformation-based learning approach.read more
Citations
More filters
Journal ArticleDOI
Information extraction from calls for papers with conditional random fields and layout features
TL;DR: This work employs Conditional Random Fields for the task of extracting key information such as conference names, titles, dates, locations and submission deadlines from CFPs, and combines a variety of features, including generic token classes, domain-specific dictionaries and layout features.
Dissertation
A Finite-State Approach to Shallow Parsing and Grammatical Functions Annotation of German
TL;DR: Finite-state automata (FSAs) are used as the abstract automaton which serves as the basis of the parser in the thesis at hand because FSAs are very effective formalisms for parsing.
Proceedings Article
Rule Based Chunker for Croatian
TL;DR: A rule-based approach to chunking sentences in Croatian, implemented using local regular grammars within the NooJ development environment, and is comparable to chunker performance of CoNLL-2000 shared task of chunking.
Learning Named Entity Recognition from Wikipedia
TL;DR: Wikipedia is viable as a source of automatically-annotated training corpora, which have wide domain coverage applicable to a broad range of NLP applications, and can outperform manually-annotate corpora on this cross-corpus evaluation task.
Journal Article
Shallow parsing using noisy and non-stationary training material
TL;DR: This work investigates the performance of four shallow parsers trained using various types of artificially noisy material and shows that they are surprisingly robust to synthetic noise, and addresses the question of whether naturally occurring disfluencies undermines performance more than does a change in distribution.
References
More filters
Book ChapterDOI
Parsing By Chunks
TL;DR: The typical chunk consists of a single content word surrounded by a constellation of function words, matching a fixed template, and the relationships between chunks are mediated more by lexical selection than by rigid templates.
Proceedings ArticleDOI
A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text
TL;DR: The authors used a linear-time dynamic programming algorithm to find an assignment of parts of speech to words that optimizes the product of (a) lexical probabilities (probability of observing part of speech i given word i) and (b) contextual probabilities (pb probability of observing n following partsof speech).
Proceedings Article
Some advances in transformation-based part of speech tagging
TL;DR: In this article, a rule-based approach to tagging unknown words is described, where the tagger-can be extended into a k-best tagger, where multiple tags can be assigned to words in some cases of uncertainty.
Journal ArticleDOI
Performance structures: A psycholinguistic and linguistic appraisal☆
James Paul Gee,François Grosjean +1 more
TL;DR: In this paper, two lines of research are combined to deal with a long-standing problem in both fields: why the performance structures of sentences (structures based on experimental data, such as pausing and parsing values) are not fully accountable for by linguistic theories of phrase structure.
Book
A corpus-based approach to language learning
TL;DR: A learning algorithm is described that takes a small structurally annotated corpus of text and a larger unannotated corpus as input, and automatically learns how to assign accurate structural descriptions to sentences not in the training corpus.