Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Tree-adjoining_grammar> ?p ?o. }
Showing items 1 to 42 of
42
with 100 items per page.
- Tree-adjoining_grammar abstract "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 of other symbols, tree-adjoining grammars have rules for rewriting the nodes of trees as other trees (see tree (graph theory) and tree (data structure)).".
- Tree-adjoining_grammar wikiPageExternalLink mgkit.gforge.inria.fr.
- Tree-adjoining_grammar wikiPageExternalLink tulipa.
- Tree-adjoining_grammar wikiPageExternalLink Background.
- Tree-adjoining_grammar wikiPageExternalLink ~xtag.
- Tree-adjoining_grammar wikiPageExternalLink TAG.pdf.
- Tree-adjoining_grammar wikiPageExternalLink node59.html.
- Tree-adjoining_grammar wikiPageExternalLink index.html.
- Tree-adjoining_grammar wikiPageID "567555".
- Tree-adjoining_grammar wikiPageRevisionID "599893382".
- Tree-adjoining_grammar hasPhotoCollection Tree-adjoining_grammar.
- Tree-adjoining_grammar subject Category:Generative_linguistics.
- Tree-adjoining_grammar subject Category:Grammar_frameworks.
- Tree-adjoining_grammar type Abstraction100002137.
- Tree-adjoining_grammar type Cognition100023271.
- Tree-adjoining_grammar type Concept105835747.
- Tree-adjoining_grammar type Content105809192.
- Tree-adjoining_grammar type GrammarFrameworks.
- Tree-adjoining_grammar type Hypothesis105888929.
- Tree-adjoining_grammar type Idea105833840.
- Tree-adjoining_grammar type Model105890249.
- Tree-adjoining_grammar type PsychologicalFeature100023100.
- Tree-adjoining_grammar comment "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 of other symbols, tree-adjoining grammars have rules for rewriting the nodes of trees as other trees (see tree (graph theory) and tree (data structure)).".
- Tree-adjoining_grammar label "Grammaire d'arbres adjoints".
- Tree-adjoining_grammar label "Gramática árvore-adjacente".
- Tree-adjoining_grammar label "Gramáticas de adjunción de árboles".
- Tree-adjoining_grammar label "Tree Adjoining Grammar".
- Tree-adjoining_grammar label "Tree-adjoining grammar".
- Tree-adjoining_grammar label "Грамматика сложения деревьев".
- Tree-adjoining_grammar label "木接合文法".
- Tree-adjoining_grammar label "树-邻接文法".
- Tree-adjoining_grammar sameAs Tree_Adjoining_Grammar.
- Tree-adjoining_grammar sameAs Gramáticas_de_adjunción_de_árboles.
- Tree-adjoining_grammar sameAs Grammaire_d'arbres_adjoints.
- Tree-adjoining_grammar sameAs 木接合文法.
- Tree-adjoining_grammar sameAs Gramática_árvore-adjacente.
- Tree-adjoining_grammar sameAs m.02qv0k.
- Tree-adjoining_grammar sameAs Q1754022.
- Tree-adjoining_grammar sameAs Q1754022.
- Tree-adjoining_grammar sameAs Tree-adjoining_grammar.
- Tree-adjoining_grammar wasDerivedFrom Tree-adjoining_grammar?oldid=599893382.
- Tree-adjoining_grammar isPrimaryTopicOf Tree-adjoining_grammar.