Sökning: id:"swepub:oai:gup.ub.gu.se/10789" >
A polynomial time e...
A polynomial time extension of parallel multiple context-free grammar
-
- Ljunglöf, Peter, 1971 (författare)
- Gothenburg University,Göteborgs universitet,Institutionen för lingvistik,Institutionen för data- och informationsteknik, datavetenskap (GU),Department of Linguistics,Department of Computer Science and Engineering, Computing Science (GU)
-
(creator_code:org_t)
- 2005
- 2005
- Engelska.
-
Ingår i: LACL-05, 5th Conference on Logical Aspects of Computational Linguistics.
- Relaterad länk:
-
https://gup.ub.gu.se... (primary) (free)
-
visa fler...
-
https://gup.ub.gu.se...
-
visa färre...
Abstract
Ämnesord
Stäng
- It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2, 3] and range concatenation grammar (RCG) [4, 5]. In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a corollary we get that PMCFG with intersection describe exactly the class of languages recognizable in polynomial time.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Språkteknologi (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Language Technology (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)