| J85-4001 | . The practical irrelevance of | polynomial-time parsing | for a fixed grammar sheds some |
| J12-3008 | language of the MBOT , this implies | polynomial-time parsing | , where the degree of the polynomial |
| J91-3002 | recognizable , we can say nothing about | polynomial-time parsing | for this language , as this would |
| A00-2036 | Fisher , 1971 ) , while allowing | polynomial-time parsing | , it seem unlikely that this |
| J11-3004 | use the framework to define new | polynomial-time parsing | algorithms for various mildly |
| P96-1020 | namely : • The existence of a | polynomial-time parsing | algorithm • A capability |
| P09-1112 | 2007TJN - ZRE 002 . <title> A | Polynomial-Time Parsing | Algorithm for TT-MCTAG </title> |
