Sciweavers

455 search results - page 14 / 91
» Directed test generation using symbolic grammars
Sort
View
154
Voted
FSMNLP
2009
Springer
14 years 11 months ago
Minimizing Weighted Tree Grammars Using Simulation
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
Andreas Maletti
174
Voted
CPP
2011
107views more  CPP 2011»
14 years 1 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
AAAI
2007
15 years 4 months ago
Learning and Inference for Hierarchically Split PCFGs
Treebank parsing can be seen as the search for an optimally refined grammar consistent with a coarse training treebank. We describe a method in which a minimal grammar is hierarc...
Slav Petrov, Dan Klein
170
Voted
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 9 months ago
A Factorial Experiment on Scalability of Search Based Software Testing
Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to us...
Arash Mehrmand, Robert Feldt
127
Voted
ACL
2003
15 years 3 months ago
A Word-Order Database for Testing Computational Models of Language Acquisition
An investment of effort over the last two years has begun to produce a wealth of data concerning computational psycholinguistic models of syntax acquisition. The data is generated...
William Gregory Sakas