67 search results - page 13 / 14 » A Domain-Specific Language for Regular Sets of Strings and T... |
MFCS
2009
Springer
14 years 24 days ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...
NIPS
2004
13 years 7 months ago
2004
Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by...
PLDI
2011
ACM
12 years 9 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular�...
EMNLP
2007
13 years 7 months ago
2007
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
EMNLP
2010
13 years 4 months ago
2010
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...