Sciweavers

103 search results - page 11 / 21
» Practical Earley Parsing
Sort
View
DLT
2003
13 years 9 months ago
Boolean Grammars
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Alexander Okhotin
COLING
1992
13 years 9 months ago
Interactive Speech Understanding
This paper introduces at robust interactive method for speech understatnding. The generatlized LR patrsing is enhanced ill this approach. Patrsing proceeds fl'om left to righ...
Hiroaki Saito
AIIA
1995
Springer
13 years 12 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung
IS
2012
12 years 4 months ago
On the refactoring of activity labels in business process models
Large corporations increasingly utilize business process models for documenting and redesigning their operations. The extent of such modeling initiatives with several hundred mode...
Henrik Leopold, Sergey Smirnov 0002, Jan Mendling
ACL
2012
11 years 10 months ago
A Comparison of Chinese Parsers for Stanford Dependencies
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
Wanxiang Che, Valentin I. Spitkovsky, Ting Liu