Sciweavers

573 search results - page 77 / 115
» Probabilistic Parsing Strategies
Sort
View
SARA
2009
Springer
14 years 2 months ago
Rewriting Constraint Models with Metamodels
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
Raphaël Chenouard, Laurent Granvilliers, Rica...
EMNLP
2006
13 years 11 months ago
Better Informed Training of Latent Syntactic Features
We study unsupervised methods for learning refinements of the nonterminals in a treebank. Following Matsuzaki et al. (2005) and Prescher (2005), we may for example split NP withou...
Markus Dreyer, Jason Eisner
COLING
1994
13 years 11 months ago
A "not-so-shallow" parser for collocational analysis
Collocational analysis is the basis of many studies on lexical acquisition. Collocations are extracted from corpora using more or less shallow processing techniques, that span from...
Roberto Basili, Maria Teresa Pazienza, Paola Velar...
COLING
1992
13 years 11 months ago
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilain...
LISP
2006
160views more  LISP 2006»
13 years 10 months ago
Formal compiler construction in a logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
Jason Hickey, Aleksey Nogin