Sciweavers

3695 search results - page 30 / 739
» Design patterns for parsing
Sort
View
ITNG
2007
IEEE
15 years 10 months ago
Super Iterator A design pattern for Algorithm and Data structure collections
The Super Iterator pattern, like the standard Iterator pattern, traverses an unknown data structure without exposing that structure. With the standard Iterator pattern, clients mu...
Andre Oboler, Charles Twardy, David W. Albrecht
ISSE
2006
15 years 3 months ago
Pattern Componentization: The Factory Example
Can Design Patterns be turned into reusable components? To help answer this question, we have performed a systematic study of the standard design patterns. One of the most ing is ...
Karine Arnout, Bertrand Meyer
LREC
2010
180views Education» more  LREC 2010»
15 years 5 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...
141
Voted
SOUPS
2006
ACM
15 years 9 months ago
An empirical study of natural language parsing of privacy policy rules using the SPARCLE policy workbench
Today organizations do not have good ways of linking their written privacy policies with the implementation of those policies. To assist organizations in addressing this issue, ou...
Carolyn Brodie, Clare-Marie Karat, John Karat
COLING
1996
15 years 5 months ago
Modularizing Codescriptive Grammars for Efficient Parsing
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the le...
Walter Kasper, Hans-Ulrich Krieger