• 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 226
Next 10 →

Dependency parsing and domain adaptation with LR models and parser ensembles

by Kenji Sagae - In Proceedings of the Eleventh Conference on Computational Natural Language Learning , 2007
"... We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser actions are determined by a classifier, based on features that represent the current state of the parser. We apply this pars ..."
Abstract - Cited by 88 (8 self) - Add to MetaCart
this parsing framework to both tracks of the CoNLL 2007 shared task, in each case taking advantage of multiple models trained with different learners. In the multilingual track, we train three LR models for each of the ten languages, and combine the analyses obtained with each individual model with a maximum

Probabilistic Language Modeling for Generalized LR Parsing

by Virach Sornlertlamvanich , 1998
"... In this thesis, we introduce probabilistic models to rank the likelihood of resultant parses within the GLR parsing framework. Probabilistic models can also bring about the benefit of reduction of search space, if the models allow prefix probabilities for partial parses. In devising the models, we c ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
In this thesis, we introduce probabilistic models to rank the likelihood of resultant parses within the GLR parsing framework. Probabilistic models can also bring about the benefit of reduction of search space, if the models allow prefix probabilities for partial parses. In devising the models, we

A practical method for LR and LL syntactic error diagnosis and recovery

by Michael G. Burke, Gerald A. Fisher, Thomas J. Watson - ACM Transactions on Programming Languages and Systems , 1987
"... This paper presents a powerful, practical, and essentially language-independent syntactic error diagnosis and recovery method that is applicable within the frameworks of LR and LL parsing. The method generally issues accurate diagnoses even where multiple errors occur within close proximity, yet sel ..."
Abstract - Cited by 23 (0 self) - Add to MetaCart
This paper presents a powerful, practical, and essentially language-independent syntactic error diagnosis and recovery method that is applicable within the frameworks of LR and LL parsing. The method generally issues accurate diagnoses even where multiple errors occur within close proximity, yet

LR Scalar Mixings and One-loop Neutrino Masses

by Otto C. W. Kong , 2000
"... Abstract: Within the framework of the complete theory of supersymmetry without R-parity, where all possible R-parity violating terms are admitted, we perform a systematic analytical study of all sources of neutrino masses up to “direct one-loop” (defined explicitly below) level. In the passing, we p ..."
Abstract - Add to MetaCart
Abstract: Within the framework of the complete theory of supersymmetry without R-parity, where all possible R-parity violating terms are admitted, we perform a systematic analytical study of all sources of neutrino masses up to “direct one-loop” (defined explicitly below) level. In the passing, we

ENTROPY CONDITIONS FOR Lr-CONVERGENCE OF EMPIRICAL PROCESSES

by A. Caponnetto, E. De Vito, M. Pontil
"... Abstract. The Law of Large Numbers (LLN) over classes of functions is a classical topic of Empirical Processes Theory. The properties characterizing classes of functions on which the LLN holds uniformly (i.e. Glivenko-Cantelli classes) have been widely studied in the literature. An elegant sufficien ..."
Abstract - Add to MetaCart
and consider the LLN relative to the associated Lr metric. This framework extends the case of uniform convergence over F, which is recovered when r goes to infinity. The main result is a Lr-LLN in terms of a suitable uniform entropy integral which generalizes the Koltchinskii-Pollard entropy integral. 1.

LR Parsing = Grammar Transformation + LL Parsing - Making LR Parsing More Understandable And More Efficient

by Peter Pepper , 1999
"... The paper has three aims. Its primary focus is a derivation method which is --- in contrast to many of the classical presentations in the literature --- easy to comprehend and thus easy to adapt to different needs. Secondly, it presents an improved LR parser which has the power of LR parsing, but ( ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
The paper has three aims. Its primary focus is a derivation method which is --- in contrast to many of the classical presentations in the literature --- easy to comprehend and thus easy to adapt to different needs. Secondly, it presents an improved LR parser which has the power of LR parsing

SCHEDULING ELECTRIC POWER GENERATORS USING PARTICLE SWARM OPTIMIZATION COMBINED WITH THE LAGRANGIAN RELAXATION METHOD

by Huseyin Hakan Balci, Jorge F. Valenzuela
"... This paper describes a procedure that uses particle swarm optimization (PSO) combined with the Lagrangian Relaxation (LR) framework to solve a power-generator scheduling problem known as the unit commitment problem (UCP). The UCP consists of determining the schedule and production amount of generati ..."
Abstract - Cited by 13 (0 self) - Add to MetaCart
This paper describes a procedure that uses particle swarm optimization (PSO) combined with the Lagrangian Relaxation (LR) framework to solve a power-generator scheduling problem known as the unit commitment problem (UCP). The UCP consists of determining the schedule and production amount

Π 0 1 CLASSES, LR DEGREES AND TURING DEGREES

by George Barmpalias, Andrew E. M, Lewis, Frank Stephan
"... Abstract. We say that A ≤LR B if every B-random set is A-random with respect to Martin-Löf randomness. We study this reducibility and its interactions with the Turing reducibility, Π0 1 classes, hyperimmunity and other recursion theoretic notions. A natural variant of the Turing reducibility from th ..."
Abstract - Cited by 8 (7 self) - Add to MetaCart
studied by Barmpalias, Lewis, Soskova [2] and Simpson [15]. In this paper we study ≤LR and its interactions with ≤T. In Section 1 we lay out the basic framework and facts which are used throughout the rest of

Performance Evaluation of IEEE 802.15.4 LR-WPAN for Industrial Applications

by Feng Chen, Nan Wang, Reinhard German, Falko Dressler - In 5th IEEE/IFIP Conference on Wireless On demand Network Systems and Services (IEEE/IFIP WONS 2008 , 2008
"... Abstract—We present a number of performance studies of the IEEE 802.15.4 protocol. We put a special focus on application scenarios in industrial sensor network applications, which is one of the intended application domains for this protocol. The primary requirements are reduced end-to-end latency an ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
and energy consumption. Our studies are based on our new implementation of IEEE 802.15.4 developed for the simulation framework OMNeT++. We performed extensive simulations that demonstrate the capabilities of this protocol in the selected scenarios but also the limitations. In particular, we investigated

Performance Evaluation of LR-WPAN for different Path- Loss Models

by Neeraj Choudhary, Ajay K Sharma
"... LR-WPAN is Low-Rate wireless personal area network standard IEEE 802.15.4. This paper is to establish path loss models for predicting wireless data transmission performance for IEEE 802.15.4 protocol standard. We use two different path-loss models to check the performance of network. Applying the ch ..."
Abstract - Add to MetaCart
LR-WPAN is Low-Rate wireless personal area network standard IEEE 802.15.4. This paper is to establish path loss models for predicting wireless data transmission performance for IEEE 802.15.4 protocol standard. We use two different path-loss models to check the performance of network. Applying
Next 10 →
Results 1 - 10 of 226
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