Sciweavers

1294 search results - page 129 / 259
» FFT Compiler Techniques
Sort
View
106
Voted
AAAI
2010
15 years 5 months ago
A Novel Transition Based Encoding Scheme for Planning as Satisfiability
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from...
Ruoyun Huang, Yixin Chen, Weixiong Zhang
135
Voted
EACL
2006
ACL Anthology
15 years 5 months ago
XMG - An Expressive Formalism for Describing Tree-Based Grammars
In this paper1 we introduce eXtensible MetaGrammar, a system that facilitates the development of tree based grammars. This system includes both (1) a formal language adapted to th...
Yannick Parmentier, Joseph Le Roux, Benoît C...
130
Voted
ANLP
2000
85views more  ANLP 2000»
15 years 5 months ago
Improving Testsuites via Instrumentation
This paper explores the usefulness of a technique from software engineering, namely code instrumentation, for the development of large-scale natural language grammars. Information...
Norbert Bröker
137
Voted
COLING
1996
15 years 5 months ago
Top-Down Predictive Linking and Complex-Feature-Based Formalisms
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
James Kilbury
96
Voted
COLING
1994
15 years 5 months ago
An IBM-PC Environment For Chinese Corpus Analysis
This paper describes a set of computer programs for Chinese corpus analysis. These programs include (1) extraction of different characters, bigrams and words; (2) word segmentatio...
Robert Wing Pong Luk