Fred Karlsson
- Church, K. 1988. "A Stochastic Parts Program and Noun Phrase Parser for Running Text." Second Conference on Applied Natural Language Processing, Proceedings of the Conference, ACL 1988, pp. 136--143. Google Scholar
Digital Library
- Garside, Roger, Leech, Geoffrey, and Sampson, Geoffrey 1987 (eds.), The Computational Analysis of English. Longman, London and New York.Google Scholar
- Karlsson, Fred 1989. "Parsing and Constraint Grammar". Manuscript, Research Unit for Computational Linguistics, University of Helsinki.Google Scholar
- Koskenniemi, Kimmo 1983. Two-Level Morphology. A General Computational Model for Word-Form Recognition and Production. Department of General Linguistics, University of helsinki, Publications No. 13.Google Scholar
- Constraint grammar as a framework for parsing running text
Recommendations
Parsing Ill-Formed Text Using an Error Grammar
This paper presents a robust parsing approach which is designed to address the issue of syntactic errors in text. The approach is based on the concept of an error grammar which is a grammar of ungrammatical sentences. An error grammar is derived from a ...
Parsing Arabic using induced probabilistic context free grammar
The importance of the parsing task for NLP applications is well understood. However developing parsers remains difficult because of the complexity of the Arabic language. Most parsers are based on syntactic grammars that describe the syntactic ...
Minimalist Grammar Transition-Based Parsing
Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)AbstractCurrent chart-based parsers of Minimalist Grammars exhibit prohibitively high polynomial complexity that makes them unusable in practice. This paper presents a transition-based parser for Minimalist Grammars that approximately searches through the ...
Comments