Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[KNIHA][B] Parsing beyond context-free grammars
L Kallmeyer - 2010 - books.google.com
Given that context-free grammars (CFG) cannot adequately describe natural languages,
grammar formalisms beyond CFG that are still computationally tractable are of central …
grammar formalisms beyond CFG that are still computationally tractable are of central …
Gf: A multilingual grammar formalism
A Ranta - Language and Linguistics Compass, 2009 - Wiley Online Library
GF (Grammatical Framework) is a grammar formalism designed for dealing with many
languages simultaneously. A multilingual GF grammar has a language‐independent …
languages simultaneously. A multilingual GF grammar has a language‐independent …
[KNIHA][B] The mechanics of the Grammatical Framework
K Angelov - 2011 - search.proquest.com
Grammatical Framework (GF) is a well known theoretical framework and a mature
programming language for the description of natural languages. The GF community is …
programming language for the description of natural languages. The GF community is …
[PDF][PDF] Incremental parsing with parallel multiple context-free grammars
K Angelov - Proceedings of the 12th Conference of the European …, 2009 - aclanthology.org
Abstract Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free
grammar for which the recognition problem is still solvable in polynomial time. We describe …
grammar for which the recognition problem is still solvable in polynomial time. We describe …
[PDF][PDF] Fast statistical parsing with parallel multiple context-free grammars
We present an algorithm for incremental statistical parsing with Parallel Multiple Context-
Free Grammars (PMCFG). This is an extension of the algorithm by Angelov (2009) to which …
Free Grammars (PMCFG). This is an extension of the algorithm by Angelov (2009) to which …
[PDF][PDF] Treebanks and mild context-sensitivity
Some treebanks, such as German TIGER/NeGra, represent discontinuous elements directly,
ie trees contain crossing edges, but the context-free grammars that are extracted from them …
ie trees contain crossing edges, but the context-free grammars that are extracted from them …
[PDF][PDF] Top-down recognizers for MCFGs and MGs
E Stabler - Proceedings of the 2nd workshop on cognitive …, 2011 - aclanthology.org
This paper defines a normal form for MCFGs that includes strongly equivalent
representations of many MG variants, and presents an incremental priority-queue-based TD …
representations of many MG variants, and presents an incremental priority-queue-based TD …
PGF: A portable run-time format for type-theoretical grammars
Abstract Portable Grammar Format (PGF) is a core language for type-theoretical grammars.
It is the target language to which grammars written in the high-level formalism Grammatical …
It is the target language to which grammars written in the high-level formalism Grammatical …
[PDF][PDF] Decomposing TAG algorithms using simple algebraizations
We review a number of different 'algebraic'perspectives on TAG and STAG in the framework
of interpreted regular tree grammars (IRTGs). We then use this framework to derive a new …
of interpreted regular tree grammars (IRTGs). We then use this framework to derive a new …
A declarative characterization of different types of multicomponent tree adjoining grammars
L Kallmeyer - Research on Language and Computation, 2009 - Springer
Abstract Multicomponent Tree Adjoining Grammars (MCTAGs) are a formalism that has
been shown to be useful for many natural language applications. The definition of non-local …
been shown to be useful for many natural language applications. The definition of non-local …