|
Volumn , Issue , 2008, Pages 604-612
|
Optimal k-arization of synchronous tree-adjoining grammar
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPILE-TIME ALGORITHMS;
ELEMENTARY STRUCTURE;
MACHINE TRANSLATIONS;
NON-TERMINAL SYMBOLS;
NP-HARD;
PARSING ALGORITHM;
POLYNOMIAL DEGREE;
ALGORITHMS;
COMPUTATIONAL LINGUISTICS;
CONTEXT SENSITIVE GRAMMARS;
FORESTRY;
FORMAL LANGUAGES;
SEMANTICS;
TREES (MATHEMATICS);
|
EID: 77958071366
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (12)
|
References (16)
|