• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 5,603
Next 10 →

A Simple Rule-Based Part of Speech Tagger

by Eric Brill , 1992
"... Automatic part of speech tagging is an area of natural language processing where statistical techniques have been more successful than rule- based methods. In this paper, we present a sim- ple rule-based part of speech tagger which automatically acquires its rules and tags with accuracy coinparable ..."
Abstract - Cited by 596 (9 self) - Add to MetaCart
genre or language to another. Perhaps the biggest contribution of this work is in demonstrating that the stochastic method is not the only viable method for part of speech tagging. The fact that a simple rule-based tagger that automatically learns its rules can perform so well should offer encouragement

A SIMPLE RULE-BASED PART OF SPEECH TAGGER

by unknown authors
"... Automatic part of speech tagging is an area of natural lan-guage processing where statistical techniques have been more successful than rule-based methods. In this paper, we present a simple rule-based part of speech tagger which automati-cally acquires its rules and tags with accuracy comparable to ..."
Abstract - Add to MetaCart
Automatic part of speech tagging is an area of natural lan-guage processing where statistical techniques have been more successful than rule-based methods. In this paper, we present a simple rule-based part of speech tagger which automati-cally acquires its rules and tags with accuracy comparable

Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging

by Eric Brill - Computational Linguistics , 1995
"... this paper, we will describe a simple rule-based approach to automated learning of linguistic knowledge. This approach has been shown for a number of tasks to capture information in a clearer and more direct fashion without a compromise in performance. We present a detailed case study of this learni ..."
Abstract - Cited by 924 (8 self) - Add to MetaCart
this paper, we will describe a simple rule-based approach to automated learning of linguistic knowledge. This approach has been shown for a number of tasks to capture information in a clearer and more direct fashion without a compromise in performance. We present a detailed case study

Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms

by Michael Collins , 2002
"... We describe new algorithms for training tagging models, as an alternative to maximum-entropy models or conditional random fields (CRFs). The algorithms rely on Viterbi decoding of training examples, combined with simple additive updates. We describe theory justifying the algorithms through a modific ..."
Abstract - Cited by 660 (13 self) - Add to MetaCart
modification of the proof of convergence of the perceptron algorithm for classification problems. We give experimental results on part-of-speech tagging and base noun phrase chunking, in both cases showing improvements over results for a maximum-entropy tagger.

Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules

by A. Jadbabaie, J. Lin, A. S. Morse , 2002
"... In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discrete-time model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based on ..."
Abstract - Cited by 1290 (62 self) - Add to MetaCart
In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discrete-time model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based

From gene names to actual genes

by Ioannis Korkontzelos , Andreas Vlachos , Ian Lewin - BIOINFORMATICS , 2007
"... A common task in biomedical text mining is the recognition of gene names. In many applications though, it is important to know whether a gene name refers to the actual gene or to an entity related to it. This paper presents a trainable system to perform this task. It combines syntactic parsing with ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
with SVMs and achieves 78.63 % accuracy. The training data used were generated automatically by a simple rule-based tagger. Such an approach can be useful to other fields which exhibit similar ambiguity in the way names are used to refer to entities.

Flocks, herds, and schools: a distributed behavior model,

by Craig W Reynolds - Proceedings of ACM SIGGRAPH , 1987
"... Abstract The aggregate motion of a flock of birds, a herd of land animals, or a school of fish is a beautiful and familiar part of the natural world. But this type of complex motion is rarely seen in computer animation. This paper explores an approach based on simulation as an alternative to script ..."
Abstract - Cited by 1317 (5 self) - Add to MetaCart
Abstract The aggregate motion of a flock of birds, a herd of land animals, or a school of fish is a beautiful and familiar part of the natural world. But this type of complex motion is rarely seen in computer animation. This paper explores an approach based on simulation as an alternative

A learning algorithm for Boltzmann machines

by H. Ackley, E. Hinton, J. Sejnowski - Cognitive Science , 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract - Cited by 584 (13 self) - Add to MetaCart
to a gen-eral learning rule for modifying the connection strengths so as to incorporate knowledge obout o task domain in on efficient way. We describe some simple examples in which the learning algorithm creates internal representations thot ore demonstrobly the most efficient way of using

Monetary Policy Rules Based on Real-Time Data

by Athanasios Orphanides - BOARD OF GOVERNORS OF THE FEDERAL RESERVE SYSTEM FINANCE AND ECONOMICS DISCUSSION PAPER SERIES , 1997
"... In recent years, simple policy rules have received attention as a means to a more transparent and effective monetary policy. Often, however, the analysis is based on unrealistic assumptions about the timeliness of data availability. This permits rule specifications that are not operational and ignor ..."
Abstract - Cited by 431 (18 self) - Add to MetaCart
In recent years, simple policy rules have received attention as a means to a more transparent and effective monetary policy. Often, however, the analysis is based on unrealistic assumptions about the timeliness of data availability. This permits rule specifications that are not operational

The Skill Content of Recent Technological Change: An Empirical Exploration

by David H. Autor, Frank Levy, Richard J. Murnane , 2000
"... Recent empirical and case study evidence documents a strong association between the adoption of computers and increased use of college educated or non-production workers. With few exceptions, the conceptual link explaining how computer technology complements skilled labor or substitutes for unskille ..."
Abstract - Cited by 643 (28 self) - Add to MetaCart
for unskilled labor is less well developed. In this paper, we apply an understanding of what computers do – the execution of procedural or rules-based logic – to develop a simple model of how the widespread adoption of computers in the workplace might alter workplace skill demands. An essential contention
Next 10 →
Results 1 - 10 of 5,603
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University