Skip to main content
SpringerLink
Log in

How to Split Recursive Automata

  • Conference paper
Grammatical Inference: Algorithms and Applications (ICGI 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5278))

Included in the following conference series:

Abstract

In this paper, we interpret in terms of operations applying on extended finite state automata some algorithms that have been specified on categorial grammars to learn subclasses of context-free languages. The algorithms considered implement specialization strategies. This new perspective also helps to understand how it is possible to control the combinatorial explosion that specialization techniques have to face, thanks to a typing approach.

This work was partly supported by the ANR MDCO “CroTal”.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.00
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. Angluin, D.: Inference of Reversible Languages. Journal of the ACM 3, 741–765 (1982)

    Article  MathSciNet  Google Scholar 

  2. Bar Hillel, Y., Gaifman, C., Shamir, E.: On Categorial and Phrase Structure Grammars. Bulletin of the Research Council of Israel 9F (1960)

    Google Scholar 

  3. Buszkowki, W., Penn, G.: Categorial grammars determined from linguistic data by unification, newblock. Studia Logica, 431–454 (1990)

    Google Scholar 

  4. Costa-Florencio, C.: Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 49–62. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Coste, F., Fredouille, D., Kermovant, C., de la Higuera, C.: Introducing domain and typing bias in automata inference. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 115–126. Springer, Heidelberg (2004)

    Google Scholar 

  6. Dowty, D., Wall, R.E., Peters, S.: Introduction to Montague Semantics. Linguistics and Philosophy, Reidel (1981)

    Google Scholar 

  7. Dudau-Sofronie, D.: Apprentissage de grammaires catégorielles pour simuler l’acquisition du langage naturel á l’aide d’informations sémantiques, thése d’informatique, université Lille3 (2004)

    Google Scholar 

  8. Dudau-Sofronie, D., Tellier, I., Tommasi, M.: Learning categorial grammars from semantic types. In: Proceedings of the 13th Amsterdam Colloquium, pp. 79–84 (2001)

    Google Scholar 

  9. Dudau-Sofronie, D., Tellier, I., Tommasi, M.: A Learnable Class of CCGs from Typed Examples. In: Proceedings of the 8th conference on Formal Grammars, pp. 77–88 (2003)

    Google Scholar 

  10. Dupont, P., Miclet, L., Vidal, E.: What is the search space of the regular inference. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 25–37. Springer, Heidelberg (1994)

    Google Scholar 

  11. Fredouille, D., Miclet, L.: Experiences sur l’inference de langage par specialisation. In: Proceedings of CAP 2000, pp. 117–130 (2000)

    Google Scholar 

  12. Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  13. Kanazawa, M.: Identification in the limit of categorial grammars. Journal of Logic, Language and Information 5(2), 115–155 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kanazawa, M.: Learnable Classes of Categorial Grammars. CSLI Publications (1998)

    Google Scholar 

  15. Kermovant, C., de la Higuera, C.: Learning language with help. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 161–173. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Moreau, E.: Apprentissage partiel de grammaires lexicalisées. TAL 45(3), 71–102 (2004)

    Google Scholar 

  17. Tellier, I.: When categorial grammars meet regular grammatical inference. In: Blache, P., Stabler, E.P., Busquets, J.V., Moot, R. (eds.) LACL 2005. LNCS (LNAI), vol. 3492, pp. 301–316. Springer, Heidelberg (2005)

    Google Scholar 

  18. Tellier, I.: Learning recursive automata from positive examples. In: Revue d’Intelligence Artificielle. New Methods in Machine Learning(20/2006), pp. 775–804 (2006)

    Google Scholar 

  19. Tellier, I.: Grammatical inference by specialization as a state splitting strategy. In: Proceedings of the 16th Amsterdam Colloquium, pp. 223–228 (2007)

    Google Scholar 

  20. Woods, W.A.: Transition Network Grammars of Natural Language Analysis. Communication of the ACM 13, 591–606 (1970)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFL - Inria Lille Nord Europe, university of Lille,  

    Isabelle Tellier

Authors
  1. Isabelle Tellier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alexander Clark François Coste Laurent Miclet

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tellier, I. (2008). How to Split Recursive Automata. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88009-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88008-0

  • Online ISBN: 978-3-540-88009-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation