Sciweavers

612 search results - page 63 / 123
» A Computational Grammar for Georgian
Sort
View
CVPR
2006
IEEE
16 years 6 days ago
Recognition of Composite Human Activities through Context-Free Grammar Based Representation
This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context-free grammar (CFG) based representation scheme to ...
Michael S. Ryoo, J. K. Aggarwal
CONCUR
2004
Springer
15 years 11 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
LATA
2009
Springer
15 years 10 months ago
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
Dana Pardubská, Martin Plátek, Fried...
ACL
2006
15 years 7 months ago
FAST - An Automatic Generation System for Grammar Tests
This paper introduces a method for the semi-automatic generation of grammar test items by applying Natural Language Processing (NLP) techniques. Based on manually-designed pattern...
Chia-Yin Chen, Hsien-Chin Liou, Jason S. Chang
ACL
2006
15 years 7 months ago
Factoring Synchronous Grammars by Sorting
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
Daniel Gildea, Giorgio Satta, Hao Zhang