Polynomially parsable unification grammars (Q3450205)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6503563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomially parsable unification grammars |
scientific article; zbMATH DE number 6503563 |
Statements
Polynomially parsable unification grammars (English)
0 references
3 November 2015
0 references
unification grammars
0 references
range concatenation grammar
0 references
universal recognition problem
0 references
parsing
0 references
0.8946408629417419
0 references
0.8241181969642639
0 references
0.8194753527641296
0 references
0.8039763569831848
0 references
