Claire Gardent
ABSTRACT
Parsing with categorial grammars often leads to problems such as proliferating lexical ambiguity, spurious parses and overgeneration. This paper presents a parser for French developed on an unification based categorial grammar (FG) which avoids these problems. This parser is a bottom-up chart parser augmented with a heuristic eliminating spurious parses. The unicity and completeness of parsing are proved.
- Bès, G. G. and C. Gardent (1989) French Order without Order. To appear in the Proceedings of the Fourth European ACL Conference (UMIST, Manchester, 10--12 April 1989), 249--255. Google Scholar
Digital Library
- Calder, J. (1987) PIMPLE; A PROLOG Implementation of the PATR-II Linguistic Environment. Edinburgh, Centre for Cognitive Science.Google Scholar
- Gazdar, G., Klein, E., Pullum, G., and Sag., I. (1985) Generalized Phrase Structure Grammar. London: Basil Blackwell.Google Scholar
- Kamp, H. (1981) A Theory of Truth and Semantic Representation. In Groenendijk, J. A. G., Janssen, T. M. V. and Stokhof, M. B. J. (eds.) Formal Methods in the Study of Language, Volume 136, 277--322. Amsterdam : Mathematical Centre Tracts.Google Scholar
- Karttunen, L. (1986) Radical Lexicalism. Report No. CSLI-86--68, Center for the Study of Language and Information, Paper presented at the Conference on Alternative Conceptions of Phrase Structure, July 1986, New York.Google Scholar
- Morrill, G. (1988) Extraction and Coordination in Phrase Structure Grammar and Categorial Grammar. PhD Thesis, Centre for Cognitive Science, University of Edinburgh.Google Scholar
- Pareschi, R. (1987) Combinatory Grammar, Logic Programming, and Natural Language. In Haddock, N. J., Klein, E. and Morill, G. (eds.) Edinburgh Working Papers in Cognitive Science, Volume I; Categorial Grammar, Unification Grammar and Parsing.Google Scholar
- Pareschi, R. and Steedman, M. J. (1987) A Lazy Way to Chart-Parse with Extended Categorial Grammars. In Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, Stanford University, Stanford, Ca., 6--9 July, 1987. Google ScholarDigital Library
- Pollard, C. J. (1984) Generalized Phrase Structure Grammars, Head Grammars, and Natural Languages. PhD Thesis, Stanford University.Google Scholar
- Pollard, C. J. and Sag, I. (1988) An Information-Based Approach to Syntax and Semantics : Volume 1 Fundamentals. Stanford, Ca.: Center for the Study of Language and Information. Google ScholarDigital Library
- Steedman, M. (1985) Dependency and Coordination in the Grammar of Dutch and English. Language, 61, 523--568.Google ScholarCross Ref
- Steedman, M. (1988) Combinators and Grammars. In Oehrle, R., Bach, E. and Wheeler, D. (eds.) Categorial Grammars and Natural Language Structures, Dordrecht, 1988.Google Scholar
- Uszkoreit, H. (1987) Word Order and Constituent Structure in German. Stanford, CSLI.Google Scholar
- Wittenburg, K. (1987) Predictive Combinators: a Method for Efficient Processing of Combinatory Categorial Grammar. In Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, Stanford University, Stanford, Ca., 6--9 July, 1987. Google ScholarDigital Library
- Zeevat, H. (1986) A Specification of InL. Internal ACORD Report. Edinburgh, Centre for Cognitive Science.Google Scholar
- Zeevat, H. (1988) Combining Categorial Grammar and Unification. In Reyle, U. and Rohrer, C. (eds.) Natural Language Parsing and Linguistic Theories, 202--229. Dordrecht: D. Reidel.Google Scholar
- Zeevat, H., Klein, E. and Calder, J. (1987) An Introduction to Unification Categorial Grammar. In Haddock, N. J., Klein, E. and Morrill, G. (eds.) Edinburgh Working Papers in Cognitive Science, Volume 1: Categorial Grammar, Unification Grammar and ParsingGoogle Scholar
- Efficient parsing for French
Recommendations
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingThe idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...
An efficient augmented-context-free parsing algorithm
An efficient parsing algorithm for augmented context-free grammars is introduced, and its application to on-line natural language interfaces discussed. The algorithm is a generalized LR parsing algorithm, which precomputes an LR shift-reduce parsing ...
Comments