2750 search results - page 15 / 550 » Learning Efficient Parsing |
JACM
2002
13 years 9 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
ACL
2010
13 years 7 months ago
2010
We show that using confidence-weighted classification in transition-based parsing gives results comparable to using SVMs with faster training and parsing time. We also compare wit...
COLING
1990
13 years 11 months ago
1990
We have designed and implemented a text processing system that can extract important information from hundreds of paragraphs per hour and can be transported within weeks to a new ...
ACL
2001
13 years 11 months ago
2001
Considering the difficulties inherent in the manual construction of natural language parsers, we have designed and implemented our system GRIND which is capable of learning a sequ...
ICML
2002
IEEE
14 years 10 months ago
2002
IEEE
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...