Sciweavers

382 search results - page 32 / 77
» Generalized Multitext Grammars
Sort
View
PASTE
2010
ACM
13 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
FOSSACS
2004
Springer
14 years 3 months ago
On Term Rewriting Systems Having a Rational Derivation
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
Antoine Meyer
IMCSIT
2010
13 years 7 months ago
Semi-Automatic Extension of Morphological Lexica
Abstract--We present a tool that facilitates the efficient extension of morphological lexica. The tool exploits information from a morphological lexicon, a morphological grammar an...
Tobias Kaufmann, Beat Pfister
AAAI
1994
13 years 11 months ago
L* Parsing: A General Framework for Syntactic Analysis of Natural Language
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...
Eric K. Jones, Linton M. Miller
SAS
1999
Springer
14 years 2 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller