Sciweavers

35 search results - page 4 / 7
» Parsing Turkish Using The Lexical Functional Grammar Formali...
Sort
View
ESSLLI
1999
Springer
15 years 1 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
CORR
1998
Springer
142views Education» more  CORR 1998»
14 years 9 months ago
How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the...
Norbert Bröker
76
Voted
PASTE
2010
ACM
14 years 11 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
CC
2002
Springer
100views System Software» more  CC 2002»
14 years 9 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...
ACMSE
1990
ACM
15 years 1 months ago
Computerizing a machine readable dictionary
Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexi...
Jan G. Wilms