Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing - SLP '07 2007
DOI: 10.3115/1626333.1626336
|View full text |Cite
|
Sign up to set email alerts
|

Converting Grammatical Framework to Regulus

Abstract: We present an algorithm for converting Grammatical Framework grammars (Ranta, 2004) into the Regulus unification-based framework (Rayner et al., 2006). The main purpose is to take advantage of the Regulusto-Nuance compiler for generating optimized speech recognition grammars. But there is also a theoretical interest in knowing how similar the two grammar formalisms are.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…GF is a multilingual development toolkit that has one abstract syntax and several parallel concrete syntaxes, one for each language [14]. The abstract syntax constitutes a finite set of abstract categories with a corresponding finite set of abstract functions to implement the categories whereas the parallel concrete syntaxes are parallel multiple context-free grammars (PMCFG) [15]. The definition of PMCFG is given by a 5-tuple equation as shown in Definition 1 below.…”
Section: Related Researchmentioning
confidence: 99%
“…GF is a multilingual development toolkit that has one abstract syntax and several parallel concrete syntaxes, one for each language [14]. The abstract syntax constitutes a finite set of abstract categories with a corresponding finite set of abstract functions to implement the categories whereas the parallel concrete syntaxes are parallel multiple context-free grammars (PMCFG) [15]. The definition of PMCFG is given by a 5-tuple equation as shown in Definition 1 below.…”
Section: Related Researchmentioning
confidence: 99%
“…Like GF, Regulus uses a general grammar for each language, which is specialized to a domain-specific one. Ljunglöf (Ljunglöf, 2007b) relates GF and Regulus by showing how to convert GF grammars to Regulus grammars. We carry compositional semantic interpretation through left-recursion elimination using the same idea as the UNIANCE grammar compiler (Bos, 2002), though our version handles both direct and indirect left-recursion.…”
Section: Unification Grammar Compilationmentioning
confidence: 99%