30 search results - page 4 / 6 » Efficiently building a parse tree from a regular expression |
EMNLP
2007
13 years 8 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...
CISIS
2007
IEEE
13 years 7 months ago
2007
IEEE
Problem determination in today's computing environments consumes between 30 and 70% of an organization’s IT resources and represents from one third to one half of their tot...
POPL
1993
ACM
13 years 11 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
ISMB
1994
13 years 8 months ago
1994
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
VLDB
1987
ACM
13 years 10 months ago
1987
ACM
Beginning to create the New Oxford English Dictionary database has resulted in the realization that databases for reference texts are unlike those for conventional enterprises. Wh...