1942 search results - page 30 / 389 » Parse |
NLE
2008
13 years 11 months ago
2008
This paper presents a robust parsing algorithm and semantic formalism for the interpretation of utterances in spoken negotiative dialogue with databases. The algorithm works in tw...
JACM
2002
13 years 10 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 9 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...
CPP
2011
12 years 10 months ago
2011
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...
NAACL
2003
14 years 10 days ago
2003
