Sciweavers

270 search results - page 18 / 54
» Effective natural language parsing with probabilistic gramma...
Sort
View
IFL
2007
Springer
141views Formal Methods» more  IFL 2007»
15 years 3 months ago
Partial Parsing: Combining Choice with Commitment
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
Malcolm Wallace
ICTAI
2007
IEEE
15 years 3 months ago
Constructing VEGGIE: Machine Learning for Context-Sensitive Graph Grammars
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
Keven Ates, Kang Zhang
ACL
2009
14 years 7 months ago
Composite Kernels For Relation Extraction
The automatic extraction of relations between entities expressed in natural language text is an important problem for IR and text understanding. In this paper we show how differen...
Frank Reichartz, Hannes Korte, Gerhard Paass
NLP
2000
15 years 1 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
TBILLC
2007
Springer
15 years 3 months ago
A Computational Grammar for Georgian
In this paper, I give an overview of an ongoing project which aims at building a full-scale computational grammar for Georgian in the Lexical Functional Grammar framework and try t...
Paul Meurer