Indexed languages are a class of formal languages discovered by Alfred Aho; they are described by indexed grammars and can be recognized by nested stack automatons. Indexed languages are a proper subset of context-sensitive languages. They qualify as an abstract family of languages and hence satisfy many closure properties. However, they are not closed under intersection or complement. Gerald Gazdar has characterized the mildly context-sensitive languages in terms of linear indexed grammars.
| Property | Value |
|---|
| dbpedia-owl:abstract
|
- Indexed languages are a class of formal languages discovered by Alfred Aho; they are described by indexed grammars and can be recognized by nested stack automatons. Indexed languages are a proper subset of context-sensitive languages. They qualify as an abstract family of languages and hence satisfy many closure properties. However, they are not closed under intersection or complement. Gerald Gazdar has characterized the mildly context-sensitive languages in terms of linear indexed grammars. The class of indexed languages has practical importance in natural language processing as a computationally affordable generalization of context-free languages, since indexed grammars can describe many of the nonlocal constraints occurring in natural languages.
- 附标语言是 Alfred Aho 发现的一类形式语言 ；它们用附标文法描述并由嵌套堆栈自动机识别 。 附标语言是上下文有关语言的真子集和适度上下文有关语言和上下文无关语言的真子集；它们在并集、串接(concatenation)和Kleene星号下闭合，但在交集和补集下不闭合。Gerald Gazdar 已经依据线性附标语法特征化了适度上下文有关语言。 附标语言在自然语言处理中作为上下文无关语言的计算可承受的一般化有着实践重要性，因为附标文法可以描述自然语言中出现的很多非局部约束。
|
| dbpedia-owl:wikiPageExternalLink
| |
| dcterms:subject
| |
| rdfs:comment
|
- 附标语言是 Alfred Aho 发现的一类形式语言 ；它们用附标文法描述并由嵌套堆栈自动机识别 。 附标语言是上下文有关语言的真子集和适度上下文有关语言和上下文无关语言的真子集；它们在并集、串接(concatenation)和Kleene星号下闭合，但在交集和补集下不闭合。Gerald Gazdar 已经依据线性附标语法特征化了适度上下文有关语言。 附标语言在自然语言处理中作为上下文无关语言的计算可承受的一般化有着实践重要性，因为附标文法可以描述自然语言中出现的很多非局部约束。
- Indexed languages are a class of formal languages discovered by Alfred Aho; they are described by indexed grammars and can be recognized by nested stack automatons. Indexed languages are a proper subset of context-sensitive languages. They qualify as an abstract family of languages and hence satisfy many closure properties. However, they are not closed under intersection or complement. Gerald Gazdar has characterized the mildly context-sensitive languages in terms of linear indexed grammars.
|
| rdfs:label
| |
| owl:sameAs
| |
| foaf:page
| |
| is owl:sameAs
of | |
| is foaf:primaryTopic
of | |
