Sciweavers

675 search results - page 10 / 135
» On Compression of Parse Trees
Sort
View
DCC
2001
IEEE
14 years 7 months ago
Parsing Strategies for BWT Compression
R. Yugo Kartono Isal, Alistair Moffat
TOOLS
1992
IEEE
13 years 11 months ago
Automating the Development of Syntax Tree Generators for an Evolving Language
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...
Per Grape, Kim Walden
ACL
1990
13 years 8 months ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker
EMNLP
2007
13 years 9 months ago
Tree Kernel-Based Relation Extraction with Context-Sensitive Structured Parse Tree Information
This paper proposes a tree kernel with contextsensitive structured parse tree information for relation extraction. It resolves two critical problems in previous tree kernels for r...
Guodong Zhou, Min Zhang, Dong-Hong Ji, Qiaoming Zh...
AMTA
1998
Springer
13 years 11 months ago
Making Semantic Interpretation Parser-Independent
Abstract. We present an approach to semantic interpretation of syntactically parsed Japanese sentences that works largely parser-independent. The approach relies on a standardized ...
Ulrich Germann