Sciweavers

667 search results - page 11 / 134
» Total parser combinators
Sort
View
CC
2002
Springer
100views System Software» more  CC 2002»
13 years 8 months ago
Disambiguation Filters for Scannerless Generalized LR Parsers
In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax definitions in which all aspects (lexical and context-free) ...
Mark van den Brand, Jeroen Scheerder, Jurgen J. Vi...
ACL
1998
13 years 10 months ago
Improving Automatic Indexing through Concept Combination and Term Enrichment
Although indexes may overlap, the output of an automatic indexer is generally presented as a fiat and unstructured list of terms. Our purpose is to exploit term overlap and embedd...
Christian Jacquemin
ESOP
2011
Springer
13 years 9 days ago
A New Method for Dependent Parsing
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
Trevor Jim, Yitzhak Mandelbaum
TCS
2002
13 years 8 months ago
Strictness, totality, and non-standard-type inference
In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness ...
Mario Coppo, Ferruccio Damiani, Paola Giannini
ANLP
1997
98views more  ANLP 1997»
13 years 10 months ago
Developing a hybrid NP parser
We describe the use of energy function optimisation in very shallow syntactic parsing. The approach can use linguistic rules and corpus-based statistics, so the strengths of both ...
Atro Voutilainen, Lluís Padró