This paper investigates the application of a probabilistic parser for natural language on the list of the Nbest sentences produced by an off-line recognition system for cursive h...
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
Ezra Black, Frederick Jelinek, John D. Lafferty, D...
This paper describes an ongoing project "Japanese FrameNet (JFN)", a corpus-based lexicon of Japanese in the FrameNet style. This paper focuses on the set of software to...
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...