Sciweavers

2750 search results - page 54 / 550
» Learning Efficient Parsing
Sort
View
NLPRS
2001
Springer
14 years 2 months ago
A Separate-and-Learn Approach to EM Learning of PCFGs
WeproposeanewapproachtoEMlearning of PCFGs. We completely separate the process of EM learning from that of parsing, andfor theformer, weintroduce a new EM algorithm called the gra...
Taisuke Sato, Shigeru Abe, Yoshitaka Kameya, Kiyoa...
ICGI
1998
Springer
14 years 2 months ago
Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data
Abstract. The present paper presents a new approach of how to convert Gold-style [4] learning in the limit into stochastically finite learning with high confidence. We illustrate t...
Peter Rossmanith, Thomas Zeugmann
LNCS
1991
14 years 1 months ago
A Flexible Parser for a Linguistic Development Environment
We describe the parser of LEU/2, the Linguistic Experimentation Environment of the LILOG project. The parser is designed to support and encourage experimentation with different gr...
Gregor Erbach
ICDT
2010
ACM
147views Database» more  ICDT 2010»
14 years 1 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
AAAI
1996
13 years 11 months ago
Learning Efficient Rules by Maintaining the Explanation Structure
Many learning systems suffer from the utility problem; that is, that time after learning is greater than time before learning. Discovering how to assure that learned knowledge wil...
Jihie Kim, Paul S. Rosenbloom