Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars

doi 10.3115/981574.981592
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Incremental Parsing With Parallel Multiple Context-Free Grammars

2009English

Analyzing Ambiguity of Context-Free Grammars

BRICS Report Series
2007English

Polynomial Time Parsing of Combinatory Categorial Grammars

1990English

Generalized Queries on Probabilistic Context-Free Grammars

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

Dynamic Compilation of Weighted Context-Free Grammars

1998English

Learning Context Free Grammars With the Finite Context Property: A Correction of A. Clark’s Algorithm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Equivalence of Four Extensions of Context-Free Grammars

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1994English

Tracking Down the Origins of Ambiguity in Context-Free Grammars

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Pairwise RNA Structure Comparison With Stochastic Context-Free Grammars

2001English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy