Name
Abstract | ||
|---|---|---|
There has recently been a revival of interest in Categorial Grammars (CG) among computational linguists. The various versions noted below which extend pure CG by including operations such as functional composition have been claimed to offer simple and uniform accounts of a wide range of natural language (NL) constructions involving bounded and unbounded "movement" and coordination "reduction" in a number of languages. Such grammars have obvious advantages for computational applications, provided that they can be parsed efficiently. However, many of the proposed extensions engender proliferating semantically equivalent surface syntactic analyses. These "spurious analyses" have been claimed to compromise their efficient parseability.The present paper describes a simple parsing algorithm for our own "combinatory" extension of CG. This algorithm offers a uniform treatment for "spurious" syntactic ambiguities and the "genuine" structural ambiguities which any processor must cope with, by exploiting the associativity of functional composition and the procedural neutrality of the combinatory rules of grammar in a bottom-up, left-to-right parser which delivers all semantically distinct analyses via a novel unification-based extension of chart-parsing. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.3115/981175.981187 | ACL |
Keywords | Field | DocType |
categorial grammars,semantically equivalent surface syntactic,combinatory rule,computational application,semantically distinct analysis,novel unification-based extension,proposed extension,simple parsing algorithm,pure cg,functional composition,computational linguist,bottom up,natural language,categorial grammar | Rule-based machine translation,Programming language,Computer science,Combinatory categorial grammar,Artificial intelligence,Natural language processing,Syntax,Unification,Grammar,Natural language,Categorial grammar,Parsing,Machine learning | Conference |
Volume | Citations | PageRank |
P87-1 | 30 | 16.80 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Remo Pareschi | 1 | 601 | 162.52 |
| Mark Steedman | 2 | 1795 | 238.27 |