Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard! (Q5111349)
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 7204471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard! |
scientific article; zbMATH DE number 7204471 |
Statements
27 May 2020
0 references
approximation
0 references
edit distance
0 references
dynamic programming
0 references
context-free grammar
0 references
hardness
0 references
Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard! (English)
0 references
0.8491336
0 references
0.83880776
0 references
0.83613265
0 references
0.8299808
0 references
0.8266119
0 references
0.8260994
0 references
0.82134974
0 references
0.82027674
0 references
0.82002294
0 references
