Adaptable Grammars for Non-Context-Free Languages

Publikation: Bidrag til tidsskriftKonferenceartikelForskningpeer review

Resumé

We consider, as an alternative to traditional approaches for describing non-context-free languages, the use
of grammars in which application of grammar rules themselves control the creation or modification of grammar rules.
This principle is shown to capture, in a concise way, standard example languages that are
considered as prototype representatives of non-context-free phenomena in natural languages.
We define a grammar formalism with these characteristics and show how it can be implemented in logic programming
in a surprisingly straightforward way, compared with the expressive power.
It is also shown how such adaptable grammars can be applied for describing meta-level architectures that include their own explicit meta-languages for defining new syntax

OriginalsprogEngelsk
BogserieLecture Notes in Computer Science
Udgave nummer5517
Sider (fra-til)488-503
ISSN0302-9743
DOI
StatusUdgivet - 2009
BegivenhedBio-Inspired Systems: Computational and Ambient Intelligence. 10th International Work-Conference on Artificial Neural Networks, IWANN 2009 - Salamanca, Spanien
Varighed: 10 jun. 200912 jun. 2009
Konferencens nummer: 10

Konference

KonferenceBio-Inspired Systems: Computational and Ambient Intelligence. 10th International Work-Conference on Artificial Neural Networks, IWANN 2009
Nummer10
LandSpanien
BySalamanca
Periode10/06/200912/06/2009

Bibliografisk note

Volumne: 5517

Emneord

  • formel lingvistik
  • grammatikker

Citer dette

@inproceedings{8792e170768d11de973f000ea68e967b,
title = "Adaptable Grammars for Non-Context-Free Languages",
abstract = "We consider, as an alternative to traditional approaches for describing non-context-free languages, the useof grammars in which application of grammar rules themselves control the creation or modification of grammar rules.This principle is shown to capture, in a concise way, standard example languages that areconsidered as prototype representatives of non-context-free phenomena in natural languages.We define a grammar formalism with these characteristics and show how it can be implemented in logic programmingin a surprisingly straightforward way, compared with the expressive power.It is also shown how such adaptable grammars can be applied for describing meta-level architectures that include their own explicit meta-languages for defining new syntax",
keywords = "formel lingvistik, grammatikker, formal linguistics, grammars",
author = "Henning Christiansen",
note = "Volumne: 5517",
year = "2009",
doi = "10.1007/978-3-642-02478-8",
language = "English",
pages = "488--503",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Physica-Verlag",
number = "5517",

}

Adaptable Grammars for Non-Context-Free Languages. / Christiansen, Henning.

I: Lecture Notes in Computer Science, Nr. 5517, 2009, s. 488-503.

Publikation: Bidrag til tidsskriftKonferenceartikelForskningpeer review

TY - GEN

T1 - Adaptable Grammars for Non-Context-Free Languages

AU - Christiansen, Henning

N1 - Volumne: 5517

PY - 2009

Y1 - 2009

N2 - We consider, as an alternative to traditional approaches for describing non-context-free languages, the useof grammars in which application of grammar rules themselves control the creation or modification of grammar rules.This principle is shown to capture, in a concise way, standard example languages that areconsidered as prototype representatives of non-context-free phenomena in natural languages.We define a grammar formalism with these characteristics and show how it can be implemented in logic programmingin a surprisingly straightforward way, compared with the expressive power.It is also shown how such adaptable grammars can be applied for describing meta-level architectures that include their own explicit meta-languages for defining new syntax

AB - We consider, as an alternative to traditional approaches for describing non-context-free languages, the useof grammars in which application of grammar rules themselves control the creation or modification of grammar rules.This principle is shown to capture, in a concise way, standard example languages that areconsidered as prototype representatives of non-context-free phenomena in natural languages.We define a grammar formalism with these characteristics and show how it can be implemented in logic programmingin a surprisingly straightforward way, compared with the expressive power.It is also shown how such adaptable grammars can be applied for describing meta-level architectures that include their own explicit meta-languages for defining new syntax

KW - formel lingvistik

KW - grammatikker

KW - formal linguistics

KW - grammars

U2 - 10.1007/978-3-642-02478-8

DO - 10.1007/978-3-642-02478-8

M3 - Conference article

SP - 488

EP - 503

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

IS - 5517

ER -