翻訳と辞書 Words near each other ・ Generalized additive model for location, scale and shape ・ Generalized algebraic data type ・ Generalized anxiety disorder ・ Generalized Anxiety Disorder 7 ・ Generalized Appell polynomials ・ Generalized arithmetic progression ・ Generalized assignment problem ・ Generalized audit software ・ Generalized Automation Language ・ Generalized beta distribution ・ Generalized Büchi automaton ・ Generalized canonical correlation ・ Generalized chi-squared distribution ・ Generalized Clifford algebra ・ Generalized complex structure ・ Generalized context-free grammar ・ Generalized continued fraction ・ Generalized coordinates ・ Generalized dihedral group ・ Generalized Dirichlet distribution ・ Generalized distributive law ・ Generalized eigenvector ・ Generalized entropy index ・ Generalized Environmental Modeling System for Surfacewaters ・ Generalized epilepsy with febrile seizures plus ・ Generalized eruptive histiocytoma ・ Generalized erythema ・ Generalized essential telangiectasia ・ Generalized estimating equation ・ Generalized expected utility Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Generalized context-free grammar ： ウィキペディア英語版 Generalized context-free grammar Generalized Context-free Grammar (GCFG) is a grammar formalism that expands on context-free grammars by adding potentially non-context free composition functions to rewrite rules. Head grammar (and its weak equivalents) is an instance of such a GCFG which is known to be especially adept at handling a wide variety of non-CF properties of natural language. ==Description== A GCFG consists of two components: a set of composition functions that combine string tuples, and a set of rewrite rules. The composition functions all have the form $f(\backslash langle\; x\_1,\; ...,\; x\_m\; \backslash rangle,\; \backslash langle\; y\_1,\; ...,\; y\_n\; \backslash rangle,\; ...)\; =\; \backslash gamma$, where $\backslash gamma$ is either a single string tuple, or some use of a (potentially different) composition function which reduces to a string tuple. Rewrite rules look like $X\; \backslash to\; f(Y,\; Z,\; ...)$, where $Y$, $Z$, ... are string tuples or non-terminal symbols. The rewrite semantics of GCFGs is fairly straight forward. An occurrence of a non-terminal symbol is rewritten using rewrite rules as in a context-free grammar, eventually yielding just compositions (composition functions applied to string tuples or other compositions). The composition functions are then applied, successively reducing the tuples to a single tuple. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Generalized context-free grammar」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.