Partial parsing via finite-state cascades

STEVEN ABNEY

doi:10.1017/S1351324997001599

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Finite state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finite state cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers do not necessarily involve trading off accuracy against speed — they may in fact be more accurate than exhaustive search stochastic context free parsers.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Buschbeck-Wolf, Bianka and Dorna, Michael 1998. Machine Translation and the Information Soup. Vol. 1529, Issue. , p. 62.

Klein, B. and Abecker, A. 1999. Distributed knowledge-based parsing for document analysis and understanding. p. 6.

Meyer, J. and Dale, R. 1999. Building hybrid knowledge representations from text. p. 158.

Vilain, Marc 1999. Information Extraction. Vol. 1714, Issue. , p. 95.

Pla, Ferran Molina, Antonio and Prieto, Natividad 2000. Text, Speech and Dialogue. Vol. 1902, Issue. , p. 15.

2000. 10.1162/153244302320884588. CrossRef Listing of Deleted DOIs, Vol. 1, Issue. ,

2000. 10.1162/153244302320884551. CrossRef Listing of Deleted DOIs, Vol. 1, Issue. ,

Kim, Sung-Dong Zhang, Byoung-Tak and Kim, Yung Taek 2001. Learning-based Intrasentence Segmentation for Efficient Translation of Long Sentences. Machine Translation, Vol. 16, Issue. 3, p. 151.

Andreasen, T. 2001. Improving query-answers from domain knowledge. Vol. 5, Issue. , p. 3269.

Zaiu Inkpen, Diana and Hirst, Graeme 2001. Computational Linguistics and Intelligent Text Processing. Vol. 2004, Issue. , p. 265.

Moonen, L. 2001. Generating robust parsers using island grammars. p. 13.

van Delden, Sebastian and Gomez, Fernando 2002. Natural Language Processing and Information Systems. Vol. 2553, Issue. , p. 150.

Light, Marc and Greiff, Warren 2002. Statistical models for the induction and use of selectional preferences. Cognitive Science, Vol. 26, Issue. 3, p. 269.

van Delden, S. and Gomez, F. 2002. Combining finite state automata and a greedy learning algorithm to determine the syntactic roles of commas. p. 293.

Andreasen, Troels Anker Jensen, Per Fischer Nilsson, Jørgen Paggio, Patrizia Sandford Pedersen, Bolette and Erdman Thomsen, Hanne 2002. Natural Language Processing and Information Systems. Vol. 2553, Issue. , p. 123.

Menzel, Wolfgang 2002. Parsing mit inkonsistenten Grammatiken. Kognitionswissenschaft, Vol. 9, Issue. 4, p. 175.

Hagège, Caroline Sándor, Ágnes and Schiller, Anne 2002. Advances in Natural Language Processing. Vol. 2389, Issue. , p. 197.

Yao, Tianfang Ding, Wei and Erbach, Gregor 2002. The Internet Challenge: Technology and Applications. p. 29.

Blache, Philippe and David-Olivier, Azulay 2002. Computational Linguistics and Intelligent Text Processing. Vol. 2276, Issue. , p. 220.

Leroy, Gondy Chen, Hsinchun and Martinez, Jesse D 2003. A shallow parser based on closed-class words to capture relations in biomedical text. Journal of Biomedical Informatics, Vol. 36, Issue. 3, p. 145.

Download full list

Article contents

Partial parsing via finite-state cascades

Abstract

Information

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests