Sciweavers

179 search results - page 35 / 36
» Lambek Grammars Are Context Free
Sort
View
ICDAR
2003
IEEE
14 years 25 days ago
On Machine Understanding of Online Handwritten Mathematical Expressions
This paper aims at automatic recognition of online handwritten mathematical expressions written on an electronic tablet. The proposed technique involves two major stages: symbol r...
Utpal Garain, B. B. Chaudhuri
NLPRS
2001
Springer
13 years 12 months ago
Incremental CFG Parsing with Statistical Lexical Dependencies
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...
Takahisa Murase, Shigeki Matsubara, Yoshihide Kato...
LREC
2008
97views Education» more  LREC 2008»
13 years 9 months ago
Enhancing an English-Polish Electronic Dictionary for Multiword Expression Research
This paper describes a project aimed at converting a legacy representation of English idioms into an XML-based format. The project is set in the context of a large electronic Engl...
Piotr Banski, Radoslaw Moszczynski
WWW
2005
ACM
14 years 8 months ago
Hybrid semantic tagging for information extraction
The semantic web is expected to have an impact at least as big as that of the existing HTML based web, if not greater. However, the challenge lays in creating this semantic web an...
Ronen Feldman, Binyamin Rosenfeld, Moshe Fresko, B...
NLP
2000
13 years 11 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