1996 FASTUS

From GM-RKB
Jump to navigation Jump to search

Subject Headings: FASTUS Project, Relation Detection from Text Algorithm, Finite-State Automata

Notes

Cited By

Quotes

Abstract

FASTUS is a system for extracting information from natural language text for entry into a database and for other applications. It works essentially as a cascaded, nondeterministic finite-state automaton. There are five stages in the operation of FASTUS. In Stage 1, names and other fixed form expressions are recognized. In Stage 2, basic noun groups, verb groups, and prepositions and some other particles are recognized. In Stage 3, certain complex noun groups and verb groups are constructed. Patterns for events of interest are identified in Stage 4 and corresponding “event structures are built. In Stage 5, distinct event structures that describe the same event are identified and merged, and these are used in generating database entries. This decomposition of language processing enables the system to do exactly the right amount of domain-independent syntax, so that domain-dependent semantic and pragmatic processing can be applied to the right larger-scale structures. FASTUS is very efficient and effective, and has been used successfully in a number of applications.


References

  • Appelt, Douglas E., Jerry R. Hobbs, John Bear, David Israel, Megumi Kameyama, and Mabry Tyson, 1993a. “The SRI MUC-5 JV-FASTUS Information Extraction System, Proceedings, Fifth Message Understanding Conference (MUC-5), Baltimore, Maryland, August 1993.
  • Appelt, Douglas E., Jerry R. Hobbs, John Bear, David Israel, and Mabry Tyson, 1993b. “FASTUS: A Finite-State Processor for Information Extraction from Real-World Text, Proceedings. IJCAI-93, Chambery, France, August 1993.
  • Black, Alan W., 1989. “Finite State Machines from Feature Grammars, in Tomita, ed., International Workshop on Parsing Technologies, pp. 277--285.
  • Church, Ken W., 1980. On Memory Limitations in Natural Language Processing, MIT Laboratory of Computer Science Technical Report MIT/LCS/TR-245.
  • Croft, William, 1991. Syntactic Categories and Grammatical Relations: The Cognitive Organization of Information, University of Chicago Press, Chicago, Illinois.
  • Hobbs, Jerry R., Douglas E. Appelt, John Bear, Mabry Tyson, and David Magerman, 1992a. “Robust Processing of Real-World Natural-Language Texts, in Text-Based Intelligent Systems: Current Research and Practice in Information Extraction and Retrieval, P. Jacobs, editor, Lawrence Erlbaum Associates, Hillsdale, New Jersey, pp. 13-33.
  • Hobbs, Jerry R., Douglas E. Appelt, John Bear, David Israel, and Mabry Tyson, 1992. “FASTUS: A System for Extracting Information from Natural-Language Text, SRI Technical Note 519, SRI International, Menlo Park, California, November 1992.
  • Hobbs, Jerry R., Douglas E. Appelt, John Bear, David Israel, Megumi Kameyama, and Mabry Tyson, 1992. “FASTUS: A System for Extracting Information from Text, Proceedings, Human Language Technology, Princeton, New Jersey, pp. 133-137, March 1993.
  • Hobbs, Jerry R., Mark Stickel, Douglas Appelt, and Paul Martin, 1993. “Interpretation as Abduction, Artificial Intelligence, Vol. 63, Nos. 1-2, pp. 69-142. Also published as SRI International Artificial Intelligence Center Technical Note 499, December 1990.
  • Kameyama, Megumi, Goh Kawai, and Isao Arima, 1995. “A Real-Time System for Summarizing Human-Human Spontaneous Spoken Dialogues, submitted to ICASSP-96.
  • Karp, Peter D., John D. Lowrance, Thomas M. Strat, David E. Wilkins, 1993. “The Grasper-CL Graph Management System, Technical Note No. 521, Artificial Intelligence Center, SRI International, January 1993.
  • Lehnert, Wendy, Claire Cardie, David Fisher, Ellen Riloff, and Robert Williams, 1991. “Description of the CIRCUS System as Used for MUC-3, Proceedings, Third Message Understanding Conference (MUC-3), San Diego, California, pp. 223-233.
  • Magerman, D., and C. Weir, “Probabilistic Prediction and Picky Chart Parsing, Proceedings of the Fifth DARPA Workshop on Speech and Natural Language, February, 1992.
  • Pereira, Fernando, 1990. “Finite-State Approximations of Grammars, Proceedings, DARPA Speech and Natural Language Workshop, Hidden Valley, Pennsylvania, pp. 20-25.
  • Pereira, Fernando, and R. Wright, 1991. “Finite-State Approximation of Phrase Structure Grammars, Proceedings, 29th Meeting of the Association for Computational Linguistics, Berkeley, California, pp. 246--255.
  • Sundheim, Beth, ed., 1991. Proceedings, Third Message Understanding Conference (MUC-3), San Diego, California, May 1991. Distributed by Morgan Kaufmann Publishers, Inc., San Mateo, California.
  • Sundheim, Beth, ed., 1992. Proceedings, Fourth Message Understanding Conference (MUC-4), McLean, Virginia, June 1992. Distributed by Morgan Kaufmann Publishers, Inc., San Mateo, California.
  • Sundheim, Beth, ed., 1993. Proceedings, Fifth Message Understanding Conference (MUC-5), Baltimore, Maryland, August 1993. Distributed by Morgan Kaufmann Publishers, Inc., San Mateo, California.
  • Tipster Text Program (Phase I), 1993. Proceedings, Advanced Research Projects Agency, September 1993.
  • Tyson, W. Mabry, Douglas Appelt, Jerry R. Hobbs, John Bear, David Israel, and Megumi Kameyama, to appear. “Recognizing and Interpreting Tables.
  • Weischedel, Ralph, et al., 1993. “BBN PLUM: MUC-5 System Description, in Sundheim, ed., Proceedings, Fifth Message Understanding Conference (MUC-5), Baltimore, Maryland, August 1993.

,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
1996 FASTUSDouglas E. Appelt
Jerry R. Hobbs
John Bear
Mabry Tyson
Mark Stickel
David Israel
Megumi Kameyama
FASTUS: A Cascaded Finite-State Transducer for Extracting Information from Natural-Language Texthttp://www.ai.sri.com/~appelt/fastus-schabes.pdf