The grammatical basis of linguistic performance: language use and acquisition
The grammatical basis of linguistic performance: language use and acquisition
LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Strong generative capacity, weak generative capacity, and modern linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Counting with range concatenation grammars
Theoretical Computer Science - Algebraic methods in language processing
Derivational Minimalism Is Mildly Context-Sensitive
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
A Characterization of Minimalist Languages
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Chinese number-names, tree adjoining languages, and mild context-sensitivity
Computational Linguistics
New frontiers beyond context-freeness: DI-grammars and DI-automata
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A tractable extension of Linear Indexed Grammars
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Chinese numbers, MIX, scrambling, and range concatenation grammars
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Tabular algorithms for TAG parsing
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Head corner parsing for discontinuous constituency
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Multiset-valued linear index grammars: imposing dominance constraints on derivations
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Recognition of linear context-free rewriting systems
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Linear context-free rewriting systems and deterministic tree-walking transducers
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Polynomial learnability and locality of formal grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Feasible learnability of formal grammars and the theory of natural language acquisition
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Global Index Grammars and Descriptive Power
Journal of Logic, Language and Information
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms
Journal of Logic, Language and Information
Constraints on strong generative power
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
On the applicability of Global Index Grammars
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
A recognizer for minimalist languages
New developments in parsing technology
New developments in parsing technology
Feature forest models for probabilistic hpsg parsing
Computational Linguistics
Statistical machine translation
ACM Computing Surveys (CSUR)
Parsing mildly non-projective dependency structures
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Dependency trees and the strong generative capacity of CCG
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Treebank grammar techniques for non-projective dependency parsing
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Minimal-length linearizations for mildly context-sensitive dependency trees
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Optimal reduction of rule length in linear context-free rewriting systems
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Parsing linear context-free rewriting systems
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Stochastic multiple context-free grammar for RNA pseudoknot modeling
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
An Earley parsing algorithm for range concatenation grammars
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
An optimal-time binarization algorithm for linear context-free rewriting systems with fan-out two
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
A polynomial-time parsing algorithm for TT-MCTAG
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
An incremental earley parser for simple range concatenation grammar
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Synchronous rewriting in treebanks
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Parsing directed acyclic graphs with range concatenation grammars
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Efficient parsing of well-nested linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Optimal parsing strategies for linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Optimal rank reduction for linear context-free rewriting systems with fan-out two
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Direct parsing of discontinuous constituents in German
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
Data-driven parsing with probabilistic linear context-free rewriting systems
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Dependency structures derived from minimalist grammars
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Grammar factorization by tree decomposition
Computational Linguistics
Using regular tree grammars to enhance sentence realisation
Natural Language Engineering
Multi-component tree insertion grammars
FG'09 Proceedings of the 14th international conference on Formal grammar
Characterizing discontinuity in constituent treebanks
FG'09 Proceedings of the 14th international conference on Formal grammar
Optimal head-driven parsing complexity for linear context-free rewriting systems
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Well-nestedness properly subsumes strict derivational minimalism
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete
Journal of Logic, Language and Information
On Mildly Context-Sensitive Non-Linear Rewriting
Research on Language and Computation
Disentangling notions of specifier impenetrability: late adjunction, islands, and expressive power
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Dependency parsing schemata and mildly non-projective dependency parsing
Computational Linguistics
Languages as hyperplanes: grammatical inference with string kernels
ECML'06 Proceedings of the 17th European conference on Machine Learning
Computation of infix probabilities for probabilistic context-free grammars
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
A note on the complexity of constraint interaction: locality conditions and minimalist grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
The copying power of well-nested multiple context-free grammars
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
A generalized view on parsing and translation
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
PLCFRS parsing of English discontinuous constituents
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Discontinuous data-oriented parsing: a mildly context-sensitive all-fragments grammar
SPMRL '11 Proceedings of the Second Workshop on Statistical Parsing of Morphologically Rich Languages
Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Efficient parsing with linear context-free rewriting systems
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Managing Multiple Knowledge Sources In Constraint-Based Parsing Of Spoken Language
Fundamenta Informaticae
Second position clitics and monadic second-order transduction
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Strong lexicalization of tree adjoining grammars
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
MIX is not a tree-adjoining language
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Data-driven parsing using probabilistic linear context-free rewriting systems
Computational Linguistics
Mildly non-projective dependency grammar
Computational Linguistics
| Hi-index | 0.00 |
We consider the structural descriptions produced by various grammatical formalisms in terms of the complexity of the paths and the relationship between paths in the sets of structural descriptions that each system can generate. In considering the relationship between formalisms, we show that it is useful to abstract away from the details of the formalism, and examine the nature of their derivation process as reflected by properties of their derivation trees. We find that several of the formalisms considered can be seen as being closely related since they have derivation tree sets with the same structure as those produced by Context-Free Grammars. On the basis of this observation, we describe a class of formalisms which we call Linear Context-Free Rewriting Systems, and show they are recognizable in polynomial time and generate only semilinear languages.