Amanote Research

Amanote Research

    RegisterSign In

Conditions on Consistency of Probabilistic Tree Adjoining Grammars

doi 10.3115/980691.980759
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 1998

Authors
Anoop Sarkar
Publisher

Association for Computational Linguistics


Related search

Stochastic Lexicalized Tree-Adjoining Grammars

1992English

Feature Structures Based Tree Adjoining Grammars

1988English

Portuguese Analysis With Tree Adjoining Grammars

1994English

An Empirical Evaluation of Probabilistic Lexicalized Tree Insertion Grammars

1998English

Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars

1995English

A Probabilistic Approach to Error Detection&Correction for Tree-Mapping Grammars

The Prague Bulletin of Mathematical Linguistics
2018English

Generalized Queries on Probabilistic Context-Free Grammars

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
1998English

D-Tree Substitution Grammars

Computational Linguistics
LinguisticsComputer Science ApplicationsArtificial IntelligenceLanguage
2001English

Multi-Component Tree Insertion Grammars

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy