Sciweavers

69 search results - page 5 / 14
» grammars 2002
Sort
View
PASTE
2010
ACM
13 years 9 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
FUIN
2002
90views more  FUIN 2002»
13 years 7 months ago
A Direct Construction of a Universal P System
We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of anothe...
Pierluigi Frisco, Hendrik Jan Hoogeboom, Paul Sant
COLING
2002
13 years 7 months ago
Lenient Default Unification for Robust Processing within Unification Based Grammar Formalisms
This paper describes new default unification, lenient default unification. It works efficiently, and gives more informative results because it maximizes the amount of information ...
Takashi Ninomiya, Yusuke Miyao, Jun-ichi Tsujii
COLING
2002
13 years 7 months ago
Linking Syntactic and Semantic Arguments in a Dependency-based Formalism
We propose a formal characterization of variation in the syntactic realization of semantic arguments, using hierarchies of syntactic relations and thematic roles, and a mechanism ...
Christian Korthals, Ralph Debusmann
MVA
2002
112views Computer Vision» more  MVA 2002»
13 years 7 months ago
Automatic Useful Shot Extraction for a Video Editing Support System
Video editing is a work to produce final videos with certain duration by finding and selecting appropriate shots from raw material videos and connecting them. In order to produce ...
Masahito Kumano, Yasuo Ariki