Abstract | ||
---|---|---|
A number of researchers have noted the similarities between LTAGs and CCGs.
Observing this resemblance, we felt that we could make use of the wide-coverage
grammar developed in the XTAG project to build a wide-coverage CCG. To our
knowledge there have been no attempts to construct a large-scale CCG parser
with the lexicon to support it. In this paper, we describe such a system, built
by adapting various XTAG components to CCG. We find that, despite the
similarities between the formalisms, certain parts of the grammatical workload
are distributed differently. In addition, the flexibility of CCG derivations
allows the translated grammar to handle a number of ``non-constituent''
constructions which the XTAG grammar cannot. |
Year | Venue | Field |
---|---|---|
1994 | arXiv: Computation and Language | Computer science,Workload,Bootstrapping,Grammar,Lexicon,Natural language processing,Artificial intelligence,Parsing,Rotation formalisms in three dimensions |
DocType | Volume | Citations |
Journal | abs/cmp-lg/9411009 | 2 |
PageRank | References | Authors |
0.39 | 1 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Christine Doran | 1 | 183 | 22.08 |
B. Srinivas | 2 | 152 | 17.90 |