Quantitative Constraint Logic Programming for Weighted Grammar Applications
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Inducing Features of Random Fields
Inducing Features of Random Fields
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Parameter estimation for constrained context-free language models
HLT '91 Proceedings of the workshop on Speech and Natural Language
DCG induction using MDL and parsed corpora
Learning language in logic
Learning log-linear models on constraint-based grammars for disambiguation
Learning language in logic
Parameter Estimation in Stochastic Logic Programs
Machine Learning
Issues in Learning Language in Logic
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Programming Spoken Dialogs Using Grammatical Inference
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Statistical properties of probabilistic context-free grammars
Computational Linguistics
Exploiting auxiliary distributions in stochastic unification-based grammars
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Estimation of stochastic attribute-value grammars using an informative sample
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Estimators for stochastic "Unification-Based" grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
The LinGO Redwoods treebank motivation and preliminary applications
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 2
A generative probability model for unification-based grammars
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Dynamic programming for parsing and estimation of stochastic unification-based grammars
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Building deep dependency structures with a wide-coverage CCG parser
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Generative models for statistical parsing with Combinatory Categorial Grammar
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Ranking algorithms for named-entity extraction: boosting and the voted perceptron
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Overfitting avoidance for stochastic modeling of attribute-value grammars
ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
Distributional phrase structure induction
ConLL '01 Proceedings of the 2001 workshop on Computational Natural Language Learning - Volume 7
A comparison of algorithms for maximum entropy parameter estimation
COLING-02 proceedings of the 6th conference on Natural language learning - Volume 20
A model of syntactic disambiguation based on lexicalized grammars
CONLL '03 Proceedings of the seventh conference on Natural language learning at HLT-NAACL 2003 - Volume 4
Log-linear models for wide-coverage CCG parsing
EMNLP '03 Proceedings of the 2003 conference on Empirical methods in natural language processing
Discriminative Reranking for Natural Language Parsing
Computational Linguistics
New developments in parsing technology
Incremental parsing with the perceptron algorithm
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Probabilistic disambiguation models for wide-coverage HPSG parsing
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Contrastive estimation: training log-linear models on unlabeled data
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Incorporating non-local information into information extraction systems by Gibbs sampling
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Robust PCFG-based generation using automatically acquired LFG approximations
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Deep linguistic analysis for the accurate identification of predicate-argument relations
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Maximum entropy estimation for feature forests
HLT '02 Proceedings of the second international conference on Human Language Technology Research
A stochastic grammar of images
Foundations and Trends® in Computer Graphics and Vision
Feature forest models for probabilistic hpsg parsing
Computational Linguistics
Wide-coverage deep statistical parsing using automatic dependency structure annotation
Computational Linguistics
Archetype-Driven Character Dialogue Generation for Interactive Narrative
IVA '08 Proceedings of the 8th international conference on Intelligent Virtual Agents
An Inductive Logic Programming Approach to Statistical Relational Learning
Proceedings of the 2005 conference on An Inductive Logic Programming Approach to Statistical Relational Learning
Formal Grammars of Early Language
Languages: From Formal to Natural
CrossParser '08 Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation
Deterministic shift-reduce parsing for unification-based grammars by using default unification
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Structural correspondence learning for parse disambiguation
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop
Extremely lexicalized models for accurate and fast HPSG parsing
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Efficiency in unification-based N-best parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
A log-linear model with an n-gram reference distribution for accurate HPSG parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Three-dimensional parametrization for parsing morphologically rich languages
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Journal of Artificial Intelligence Research
Parameter learning of logic programs for symbolic-statistical modeling
Journal of Artificial Intelligence Research
A machine learning approach for statistical software testing
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
How the statistical revolution changes (computational) linguistics
ILCL '09 Proceedings of the EACL 2009 Workshop on the Interaction between Linguistics and Computational Linguistics: Virtuous, Vicious or Vacuous?
Generative modeling with failure in PRISM
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Probabilistic inductive logic programming
Probabilistic inductive logic programming
New advances in logic-based probabilistic modeling by PRISM
Probabilistic inductive logic programming
Chart mining-based lexical acquisition with precision grammars
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Modeling morphosyntactic agreement in constituency-based parsing of modern Hebrew
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
Exploiting Semantic Information for HPSG Parse Selection
Research on Language and Computation
Reversible stochastic attribute-value grammars
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Loglinear models for first-order probabilistic reasoning
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Negation elimination for finite PCFGs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Explaining Activities as Consistent Groups of Events
International Journal of Computer Vision
Large-scale corpus-driven PCFG approximation of an HPSG
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Semantic separator learning and its applications in unsupervised Chinese text parsing
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Probabilistic analogues of regular and context-free grammars are well known in computational linguistics, and currently the subject of intensive research. To date, however, no satisfactory probabilistic analogue of attribute-value grammars has been proposed: previous attempts have failed to define an adequate parameter-estimation algorithm.In the present paper, I define stochastic attribute-value grammars and give an algorithm for computing the maximum-likelihood estimate of their parameters. The estimation algorithm is adapted from Della Pietra, Della Pietra, and Lafferty (1995). To estimate model parameters, it is necessary to compute the expectations of certain functions under random fields. In the application discussed by Della Pietra, Della Pietra, and Lafferty (representing English orthographic constraints), Gibbs sampling can be used to estimate the needed expectations. The fact that attribute-value grammars generate constrained languages makes Gibbs sampling inapplicable, but I show that sampling can be done using the more general Metropolis-Hastings algorithm.