Sciweavers

59 search results - page 3 / 12
» Generation of Sentence Parse Trees Using Parts of Speech
Sort
View
ICDAR
2003
IEEE
14 years 1 months ago
Parsing N-Best Lists of Handwritten Sentences
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...
Matthias Zimmermann, Jean-Cédric Chappelier...
ACL
1993
13 years 9 months ago
Towards History-Based Grammars: Using Richer Models for Probabilistic Parsing
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...
LREC
2008
135views Education» more  LREC 2008»
13 years 9 months ago
The Japanese FrameNet Software Tools
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...
Hiroaki Saito, Shunta Kuboya, Takaaki Sone, Hayato...
NLP
2000
13 years 12 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
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...
Jean-Cédric Chappelier, Martin Rajman
FSMNLP
2009
Springer
13 years 6 months ago
Minimizing Weighted Tree Grammars Using Simulation
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...
Andreas Maletti