Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi. Tree-adjoining grammars are somewhat similar to context-free grammars, but the elementary unit of rewriting is the tree rather than the symbol. Whereas context-free grammars have rules for rewriting symbols as strings ...
网络树链接语法 网络释义 1. 树链接语法 ... Functional Grammar)句法分析,树链接语法(Tree-Adjoining-Grammar)句法分析、范畴语法(Categorial Grammar)句… www.haogongju.net|基于 1 个网页 释义: 全部,树链接语法 更多例句筛选 1. Autoextractingforlexicalizedtreeadjoininggrammar ...
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and state some of the recent results about TAGs. The work on TAGs is motivated by linguistic...doi:10.1007/978-3-642-59126-6_2Aravind K. Joshi...
摘要: In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and state some of the recent results about TAGs. The work on TAGs is motivated by linguistic...关键词: natural-language generation tactical generation ...
This software is being used to perform an evaluation of the SemFRAG (semantic French TAG grammar) of [33] in terms of semantic coverage of the Test Suite for NLP. Version: 1.2 License: CeCILL Web si...Large scale semantic construction for tree adjoining grammar - Gardent, Parmentier - ...
this paper, we will ex- plore the adequacy of the Tree Adjoining Grammar (TAG) formalism for dealing with long-distance scrambling I in German. We will show that TAGs cannot capture the full range of constructions derived by scrambling. However, Multi-Component TAGs (MC-TAG), an extension ...
The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is defined and basic algorithms for SLTAG are designed. The parameters of a SLTAG corre... Y Schabes - Mathematics of Language John Benjamins 被引量: 729发表: 1987年 Tree Adjoining Grammars, Language Bias, and Genetic Programm...
Context-Free Parsing of a Tree Adjoining Grammar Using Finite-State Machines 陇First, we believe that the phrase structure used by many (if not most) linguistic theories is useful only in deriving the syntactic behavior of lexical heads (or classes of lexical heads) from more general principles...
In this paper, we introduce grammar formalisms called multi-bracketed contextual and multi-bracketed contextual rewriting grammars. These formalisms possess an induced Dyck-structure to control the derivation process and to provide phrase-structure trees. The generative capacity of these classes is compar...
JohnsonCognitiveWileyComputational IntelligenceLogical embedded push-down automata in tree-adjoining grammar parsing - Johnson - 1994Johnson, Mark. 1994. Logical embedded push-down automata in tree-adjoining grammar parsing. Com- putational Intelligence, 10(4):495-505....