Tree-Adjoining Language Parsing in $O(n^6 )$ Time (Q4895833)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tree-Adjoining Language Parsing in O(n^6 ) Time |
scientific article; zbMATH DE number 936219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tree-Adjoining Language Parsing in $O(n^6 )$ Time |
scientific article; zbMATH DE number 936219 |
Statements
Tree-Adjoining Language Parsing in $O(n^6 )$ Time (English)
0 references
9 December 1996
0 references
parsing
0 references
tree-adjoining languages
0 references
context-free languages
0 references
0.9111509919166564
0 references
0.9103804230690002
0 references
0.874534547328949
0 references
