Sciweavers

877 search results - page 34 / 176
» How to Cover a Grammar
Sort
View
61
Voted
ACL
1998
15 years 1 months ago
Know When to Hold 'Em: Shuffling Deterministically in a Parser for Nonconcatenative Grammars
Nonconcatenative constraints, such as the shuffle relation, are frequently employed in grammatical analyses of languages that have more flexible ordering of constituents than Engl...
Robert T. Kasper, Mike Calcagno, Paul C. Davis
105
Voted
ECAI
2010
Springer
15 years 1 months ago
Acquisition of Grammar in Autonomous Artificial Systems
Over the past several decades, psycholinguists have gained countless insights into the process of child language acquisition. Can these findings be used for the development of lang...
Kateryna Gerasymova, Michael Spranger
96
Voted
ACL
2009
14 years 10 months ago
Parsing Speech Repair without Specialized Grammar Symbols
This paper describes a parsing model for speech with repairs that makes a clear separation between linguistically meaningful symbols in the grammar and operations specific to spee...
Tim Miller, Luan Nguyen, William Schuler
100
Voted
ACL
2009
14 years 10 months ago
Improving data-driven dependency parsing using large-scale LFG grammars
This paper presents experiments which combine a grammar-driven and a datadriven parser. We show how the conversion of LFG output to dependency representation allows for a techniqu...
Lilja Øvrelid, Jonas Kuhn, Kathrin Spreyer
107
Voted
JOT
2007
193views more  JOT 2007»
15 years 14 days ago
Applying Triple Graph Grammars For Pattern-Based Workflow Model Transformations
Workflow and business process modeling approaches have become essential for designing service collaborations when developing SOA-based systems. To derive actual executable busines...
Carsten Lohmann, Joel Greenyer, Juanjuan Jiang, Ta...