## Recognition can be Harder than Parsing (1992)

Venue: | Computational Intelligence |

Citations: | 40 - 0 self |

### BibTeX

@ARTICLE{Lang92recognitioncan,

author = {Bernard Lang},

title = {Recognition can be Harder than Parsing},

journal = {Computational Intelligence},

year = {1992},

volume = {10},

pages = {486--494}

}

### Years of Citing Articles

### OpenURL

### Abstract

this paper is to discuss the scope and limitations of this approach, and to examine the suitability of several syntactic formalisms on the criterion of their ability to handle it. 2 Parsing as intersection

### Citations

700 | An e cient context-free parsing algorithm
- Earley
- 1970
(Show Context)
Citation Context ...cture that represents all possible parses with sharing of common subparts. In the case of CF languages, this was introduced with some of the early dynamic programming parsing algorithm (e.g. Earley's =-=[Ear-68]-=-) which, in cubic time and space, could produce as result a shared structure, called shared forest, from which any specific parse can be extracted in linear time. The object of this paper is to discus... |

167 | Recognition and parsing of context-free languages in time n3 - Younger - 1967 |

126 | The structure of shared forests in ambiguous parsing
- Billot, Lang
- 1989
(Show Context)
Citation Context ...plexity result. Hence we believe it is better to do so explicitly so as to better control the shape of the shared forest and the amount of sharing in that forest (cf. the discussion on the CF case in =-=[BilL-89]-=-). 4 Limitations of the approach This approach extends nicely to such formalisms as Modified Head Grammars, Linear Indexed Grammars [VijW-90, VijW-90], and more generally to Linear Context-Free Rewrit... |

126 | An efficient recognition and syntax-analysis algorithm for context-free languages. Scientific report AFCRL-65-758, Air Force Cambridge Research Lab - Kasami - 1965 |

123 |
On Formal Properties of Simple Phrase Structure Grammars. Hebrew University Students
- Bar-Hillel, Perles, et al.
- 1964
(Show Context)
Citation Context ...ider a regular language L(A) defined by a finite state device A and a CF language L(G) generated by a CF grammar G. There is a well known construction, apparently due to Bar-Hillel, Perles and Shamir =-=[BarPS-61]-=- (referred to as BPS in this paper), that produces a CF grammar for the intersection of these two languages, with precisely the same parse trees as G (though this was not established by BPS). Hence th... |

85 | Deterministic techniques for efficient non-deterministic parsers - Lang - 1974 |

74 |
Some computational properties of Tree Adjoining Grammars
- Vijay-Shankar, Joshi
- 1985
(Show Context)
Citation Context ...eral others), there are also situations where the generation structure is distinct from the syntactic structure that is projected as the given string, as is the case for tree-adjoining grammars (TAG) =-=[VijJ-85]-=-. The fact that a string is a projection raises the issue of ambiguity when the same string may be the projection of several distinct syntactic structures. A parsing algorithm can then produce any of ... |

71 | An Efficient AugmentedContext-Free Parsing Algorithm - Tomita - 1987 |

63 |
Indexed grammars, an extension of contextfree grammars
- Aho
- 1968
(Show Context)
Citation Context ...are not adequate as syntactic backbone, and though it is possible in theory to use our approach for CS grammars, it is in practice meaningless. The case of Indexed Grammars (IG), as defined by Aho in =-=[Aho-68]-=-, is more interesting. IGs do associate a syntactic structure with the sentences of their language. Furthermore they are closed under intersection with regular set, and the corresponding construction ... |

48 | Towards a Uniform Formal Framework for Parsing
- Lang
- 1991
(Show Context)
Citation Context ...ary, all parses can be trivially enumerated from the shared forest in exactly the same way one generates all possible sentences of a langage in the formalism under consideration. It was also shown in =-=[Lan-91]-=- that, more generally, it is possible to build a grammar F that generates with the same parse-trees (up to non-terminal renaming) as a CF grammar G, the sentences produced by a finite state device (a ... |

44 | Programming languages and their compilers - COCKE, SCHWARTZ - 1969 |

27 | Polynomial time and space shift-reduce parsing of arbitrary context-free grammars - Schabes - 1991 |

16 | Context-free error analysis by evaluation of algebraic power series - Teitelbaum - 1973 |

9 | A generative view of ill-formed input processing - Lang - 1989 |

4 |
Polynomial time parsing of combinatory categorial grammars
- Weir
- 1990
(Show Context)
Citation Context ... trees as the original grammar G of the language, up to a renaming of the non terminals. This understanding, introduced in [Lan-74, BilL-89] was extended to other formalisms by Vijay-Shanker and Weir =-=[VijW-90]-=-. As a corollary, all parses can be trivially enumerated from the shared forest in exactly the same way one generates all possible sentences of a langage in the formalism under consideration. It was a... |

1 |
Parsing Constrained Grammar Formalisms. Personal Communication
- Vijay-Shankar, Weir
- 1990
(Show Context)
Citation Context ... trees as the original grammar G of the language, up to a renaming of the non terminals. This understanding, introduced in [Lan-74, BilL-89] was extended to other formalisms by Vijay-Shanker and Weir =-=[VijW-90]-=-. As a corollary, all parses can be trivially enumerated from the shared forest in exactly the same way one generates all possible sentences of a langage in the formalism under consideration. It was a... |