BLLDB - Title Entry - Angelov, Krasimir: PGF: a portable run-time format for type-theoretical grammars

Guest (Restricted Access)

Selected titles: 0

Export:
Text | Dublin Core | RIS

Journal article

Bibliographic description

Author		Angelov, Krasimir; Bringert, Björn; Ranta, Aarne
Title		PGF: a portable run-time format for type-theoretical grammars

Written in		English
Source		Journal of logic, language and information. - Dordrecht [u.a.] : Kluwer
Volume		19
Year		2010
Issue		2
Page		201-228

Classification
Domains / Computational linguistics / Individual aspects (computational linguistics) / Generation (computational linguistics)

Domains / Computational linguistics / Parsing

Domains / Computational linguistics / Parsing / Grammar types (computational linguistics)

Domains / Methodology / Formalization (method.)

Domains / Linguistic logic


Redirected from
Generation (computational linguistics) ; Automatische Sprachanalyse (synt.) ; Formale Grammatiken; Chomsky-Hierarchie; Unrestricted rewriting system; Context-sensitive grammar; Context-free grammar; Finite state grammar; Polychrome tree grammar; Tectogrammatical tree structure; TGTS; Grammar types (computational linguistics) ; Formalization (method.) ; Logic of language; Linguistic logic