| http://dbpedia.org/ontology/abstract
|
In linguistics, the affix grammars over a … In linguistics, the affix grammars over a finite lattice (AGFL) formalism is a notation for context-free grammars with finite set-valued features, acceptable to linguists of many different schools. The AGFL-project aims at the development of a technology for Natural language processing available under the GNU GPL.ge processing available under the GNU GPL.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://www.cs.ru.nl/agfl/ +
|
| http://dbpedia.org/ontology/wikiPageID
|
2640437
|
| http://dbpedia.org/ontology/wikiPageLength
|
665
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1024449086
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Natural_language_processing +
, http://dbpedia.org/resource/Linguistics +
, http://dbpedia.org/resource/GNU +
, http://dbpedia.org/resource/Category:Free_linguistic_software +
, http://dbpedia.org/resource/Category:Grammar_frameworks +
, http://dbpedia.org/resource/Context-free_grammar +
, http://dbpedia.org/resource/GNU_General_Public_License +
, http://dbpedia.org/resource/Category:Natural_language_processing +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Syntax-stub +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Natural_language_processing +
, http://dbpedia.org/resource/Category:Grammar_frameworks +
, http://dbpedia.org/resource/Category:Free_linguistic_software +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Notation +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Affix_grammar_over_a_finite_lattice?oldid=1024449086&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Affix_grammar_over_a_finite_lattice +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.07tn7g +
, http://yago-knowledge.org/resource/Affix_grammar_over_a_finite_lattice +
, http://dbpedia.org/resource/Affix_grammar_over_a_finite_lattice +
, https://global.dbpedia.org/id/4M6TH +
, http://www.wikidata.org/entity/Q4689007 +
|
| rdf:type |
http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Idea105833840 +
, http://dbpedia.org/class/yago/Content105809192 +
, http://dbpedia.org/class/yago/Model105890249 +
, http://dbpedia.org/class/yago/WikicatGrammarFrameworks +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Hypothesis105888929 +
, http://dbpedia.org/class/yago/Concept105835747 +
, http://dbpedia.org/class/yago/Cognition100023271 +
, http://dbpedia.org/ontology/Software +
|
| rdfs:comment |
In linguistics, the affix grammars over a … In linguistics, the affix grammars over a finite lattice (AGFL) formalism is a notation for context-free grammars with finite set-valued features, acceptable to linguists of many different schools. The AGFL-project aims at the development of a technology for Natural language processing available under the GNU GPL.ge processing available under the GNU GPL.
|
| rdfs:label |
Affix grammar over a finite lattice
|
