IDL-PMCFG, a grammar formalism for describing free word order languages

DOI10.1007/s10849-022-09363-0OpenAlexW4225142542MaRDI QIDQ2093024

François Hublet

Publication date: 4 November 2022

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-022-09363-0

zbMATH Keywords

free word ordergrammar formalismgrammatical frameworkmidly context-sensitive languagesPMCFG

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (1)

Graph grammar formalism with multigranularity for spatial graphs

Uses Software

• YACC

Cites Work

• Unnamed Item
• Unnamed Item
• YACC
• On multiple context-free grammars
• The word problem of \(\mathbb{Z}^n\) is a multiple context-free language
• MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
• Parsing Beyond Context-Free Grammars
• Direct parsing of ID/LP grammars
• FUNCTIONAL PEARL Functional chart parsing of context-free grammars
• Grammatical Framework
• Reducibility among Combinatorial Problems
• On the Complexity of Free Word Orders
• Three models for the description of language
• Indexed Grammars—An Extension of Context-Free Grammars
• Logical Aspects of Computational Linguistics

This page was built for publication: IDL-PMCFG, a grammar formalism for describing free word order languages