Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Extended_Affix_Grammar> ?p ?o }
Showing triples 1 to 53 of
53
with 100 triples per page.
- Extended_Affix_Grammar abstract "In computer science, Extended Affix Grammars (EAG) are a formal grammar formalism for describing the context free and context sensitive syntax of language, both natural language and programming languages.EAGs are a member of the family of two-level grammars; more specifically, a restriction of Van Wijngaarden grammars with the specific purpose of making parsing feasible.Like Van Wijngaarden grammars, EAGs have hyperrules that form a context-free grammar except in that their nonterminals may have arguments, known as affixes, the possible values of which are supplied by another context-free grammar, the metarules.EAGs were introduced and studied by D.A. Watt in 1974; recognizers were developed at the University of Nijmegen between 1985 and 1995. The EAG compiler developed there will generate either a recogniser, a transducer, a translator, or a syntax directed editor for a language described in the EAG formalism. The formalism is quite similar to Prolog, to the extent that it borrowed its cut operator.EAGs have been used to write grammars of natural languages such as English, Spanish, and Hungarian. The aim was to verify the grammars by making them parse corpora of text (corpus linguistics); hence, parsing had to be sufficiently practical. However, the parse tree explosion problem that ambiguities in natural language tend to produce in this type of approach is worsened for EAGs because each choice of affix value may produce a separate parse, even when several different values are equivalent. The remedy proposed was to switch to the much simpler Affix Grammar over a Finite Lattice (AGFL) instead, in which metagrammars can only produce simple finite languages.".
- Extended_Affix_Grammar wikiPageExternalLink summary?doi=10.1.1.39.1859.
- Extended_Affix_Grammar wikiPageExternalLink 93-09-060.
- Extended_Affix_Grammar wikiPageExternalLink eag.
- Extended_Affix_Grammar wikiPageID "1968551".
- Extended_Affix_Grammar wikiPageLength "2821".
- Extended_Affix_Grammar wikiPageOutDegree "26".
- Extended_Affix_Grammar wikiPageRevisionID "676481274".
- Extended_Affix_Grammar wikiPageWikiLink Affix.
- Extended_Affix_Grammar wikiPageWikiLink Affix_grammar.
- Extended_Affix_Grammar wikiPageWikiLink Affix_grammar_over_a_finite_lattice.
- Extended_Affix_Grammar wikiPageWikiLink Category:Corpus_linguistics.
- Extended_Affix_Grammar wikiPageWikiLink Category:Formal_languages.
- Extended_Affix_Grammar wikiPageWikiLink Category:Grammar_frameworks.
- Extended_Affix_Grammar wikiPageWikiLink Category:Parsing.
- Extended_Affix_Grammar wikiPageWikiLink Category:Syntax.
- Extended_Affix_Grammar wikiPageWikiLink Computer_science.
- Extended_Affix_Grammar wikiPageWikiLink Context-free_grammar.
- Extended_Affix_Grammar wikiPageWikiLink Context-sensitive_grammar.
- Extended_Affix_Grammar wikiPageWikiLink Corpus_linguistics.
- Extended_Affix_Grammar wikiPageWikiLink Cut_operator.
- Extended_Affix_Grammar wikiPageWikiLink David_Watt_(computer_scientist).
- Extended_Affix_Grammar wikiPageWikiLink Formal_grammar.
- Extended_Affix_Grammar wikiPageWikiLink Natural_language.
- Extended_Affix_Grammar wikiPageWikiLink Parse_tree_explosion.
- Extended_Affix_Grammar wikiPageWikiLink Parsing.
- Extended_Affix_Grammar wikiPageWikiLink Programming_language.
- Extended_Affix_Grammar wikiPageWikiLink Prolog.
- Extended_Affix_Grammar wikiPageWikiLink Syntax.
- Extended_Affix_Grammar wikiPageWikiLink Two-level_grammar.
- Extended_Affix_Grammar wikiPageWikiLink Van_Wijngaarden_grammar.
- Extended_Affix_Grammar wikiPageWikiLinkText "EAG".
- Extended_Affix_Grammar wikiPageWikiLinkText "Extended Affix Grammar".
- Extended_Affix_Grammar wikiPageUsesTemplate Template:FOLDOC.
- Extended_Affix_Grammar subject Category:Corpus_linguistics.
- Extended_Affix_Grammar subject Category:Formal_languages.
- Extended_Affix_Grammar subject Category:Grammar_frameworks.
- Extended_Affix_Grammar subject Category:Parsing.
- Extended_Affix_Grammar subject Category:Syntax.
- Extended_Affix_Grammar hypernym Formalism.
- Extended_Affix_Grammar type Language.
- Extended_Affix_Grammar type ProgrammingLanguage.
- Extended_Affix_Grammar type Combinatoric.
- Extended_Affix_Grammar type Framework.
- Extended_Affix_Grammar type Language.
- Extended_Affix_Grammar comment "In computer science, Extended Affix Grammars (EAG) are a formal grammar formalism for describing the context free and context sensitive syntax of language, both natural language and programming languages.EAGs are a member of the family of two-level grammars; more specifically, a restriction of Van Wijngaarden grammars with the specific purpose of making parsing feasible.Like Van Wijngaarden grammars, EAGs have hyperrules that form a context-free grammar except in that their nonterminals may have arguments, known as affixes, the possible values of which are supplied by another context-free grammar, the metarules.EAGs were introduced and studied by D.A. ".
- Extended_Affix_Grammar label "Extended Affix Grammar".
- Extended_Affix_Grammar sameAs Q5421802.
- Extended_Affix_Grammar sameAs Gramática_Afixa_Estendida.
- Extended_Affix_Grammar sameAs m.069sdm.
- Extended_Affix_Grammar sameAs Q5421802.
- Extended_Affix_Grammar wasDerivedFrom Extended_Affix_Grammar?oldid=676481274.
- Extended_Affix_Grammar isPrimaryTopicOf Extended_Affix_Grammar.