Skip to main content

Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach

  • Conference paper
Implementation and Application of Automata (CIAA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6807))

Included in the following conference series:

Abstract

The paper presents a new method for extracting information from semi-structured resources, based on finite state transducers. The method has two clearly distinguished phases. The first phase - pre-processing phase - strongly relies upon the analysis of the document structure and it is used for locating records of data in the text. The second phase is based on the finite state transducers created for extracting information. The transducers can be modified so that preferred efficiency is achieved and can be reused for extracting information from other pre-processed documents. We conclude that even untagged text can be treated as a semi-structured one, providing its structure can be successfully pre-processed. As a result, we extracted data from free form encyclopedia text and created a fully structured database with genotype and phenotype characteristics of the organisms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carlson, A., Schafer, C.: Bootstrapping information extraction from semi-structured web pages. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol. 5211, pp. 195–210. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Liu, B., Grossman, R., Zhai, Y.: Mining data records in web pages. In: Proceedings of SIGKDD 2003, Washington, USA, pp. 601–606 (2003)

    Google Scholar 

  3. Friburger, N., Maurel, D.: Finite-state transducer cascades to extract named entities in texts. Theoretical Computer Science 313, 93–104 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hobbs, J.R., Appelt, D., Bear, J., Israel, D., Kameyama, M., Stickel, M., Tyson, M.: FASTUS: A Cascaded Finite-State Transducer for Extracting Information from Natural-Language Text. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing, pp. 383–406. The MIT Press, Washington (1997)

    Google Scholar 

  5. Feng, D., Burns, G., Hovy, E.: Extracting Data Records from Unstructured Biomedical Full Text. In: Proceedings of the EMNLP Conference, Prague, Czech Republic (2007)

    Google Scholar 

  6. Zhong, P., Chen, J., Cook, T.: Web Information Extraction Using Generalized Hidden Markov Model. In: 1st IEEE Workshop on Hot Topics in Web Systems and Technologies (HOTWEB 2006), pp. 1–8 (2007)

    Google Scholar 

  7. Garrity, G.M.: Systematic Bacteriology. In: The Proteobacteria, Part C: The Alpha-, Beta-, Delta-, and Epsilonproteobacteria, Bergey’s Manual Trust, Department of Microbiology and Molecular Genetics, 2nd edn. vol. 2. Michigan State University, USA (2005)

    Google Scholar 

  8. Jurafsky, D., Martin, J.H.: Speech and language processing. Prentice-Hall Inc. Englewood Cliffs (2000)

    Google Scholar 

  9. Gross, M., Perrin, D.: Electronic Dictionaries and Automata in Computational Linguistics. In: Proceedings of LITP Spring School on Theoretical Computer Science Saint-Pierre d’Oleron, France, May 25-29 (1987)

    Google Scholar 

  10. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison Wesley, Reading (1974)

    MATH  Google Scholar 

  11. Casacuberta, F., Vidal, E., Picó, D.: Inference of finite-state transducers from regular languages. Pattern Recognition 38(9), 1431–1443 (2005)

    Article  MATH  Google Scholar 

  12. Kornai, A.: Extended finite state models of language. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  13. Pajic, V.: Finite State Transducers in Web Monitoring, Master Thesys, Faculty of Mathematics, University of Belgrade, Republic of Serbia (2010)

    Google Scholar 

  14. Sastre, J.M., Forcada, M.: Efficient parsing using recursive transition networks with output, In: Vetulani, Z., Uszkoreit, H. (eds.) LTC 2007. LNCS, vol. 5603, pp. 280–284. Springer, Heidelberg (2009)

    Google Scholar 

  15. Olivier, B., Constant, M., Laporte, E.: Outilex, plate-forme logicielle de traitement de textes ecrits. In: Proceedings of TALN 2006. UCL Press, London (2006)

    Google Scholar 

  16. Paumier, S.: Unitex 1.2 User Manual, Universit´e de Marne-la-Vallée (2006), http://www-igm.univ-mlv.fr/~unitex/UnitexManual.pdf

  17. Silberztein, M.D.: Dictionnaires ´electroniques et analyse automatique de textes. Le systeme INTEX, Paris, Masson (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pajić, V., Lažetić, G.P., Pajić, M. (2011). Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2011. Lecture Notes in Computer Science, vol 6807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22256-6_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22256-6_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22255-9

  • Online ISBN: 978-3-642-22256-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics