Skip to main content

A Learnable Representation for Syntax Using Residuated Lattices

  • Conference paper

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

Abstract

We propose a representation for natural language syntax based on the theory of residuated lattices: in particular on the Galois lattice between contexts and substrings, which we call the syntactic concept lattice. The natural representation derived from this is a richly structured context sensitive formalism that can be learned using a generalisation of distributional learning. In this paper we define the basic algebraic properties of the syntactic concept lattice, together with a representation derived from this lattice and discuss the generative power of the formalism. We establish some basic results which show that these representations, because they are defined language theoretically, can be inferred from information about the set of grammatical strings of the language. We also discuss the relation to other grammatical formalisms notably categorial grammar and context free grammars. We claim that this lattice based formalism is plausibly both learnable from evidence about the grammatical strings of a language and may be powerful enough to represent natural languages, and thus presents a potential solution to the central problem of theoretical linguistics.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D., Kharitonov, M.: When won’t membership queries help? J. Comput. Syst. Sci. 50, 336–355 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research 8, 1725–1745 (2007)

    MathSciNet  MATH  Google Scholar 

  3. Clark, A., Eyraud, R., Habrard, A.: A polynomial algorithm for the inference of context free languages. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 29–42. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Harris, Z.: Distributional structure. In: Fodor, J.A., Katz, J.J. (eds.) The Structure of Language, pp. 33–49. Prentice-Hall, Englewood Cliffs (1954)

    Google Scholar 

  5. Sestier, A.: Contribution à une théorie ensembliste des classifications linguistiques. In: Premier Congrès de l’Association Française de Calcul, Grenoble, pp. 293–305 (1960)

    Google Scholar 

  6. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  7. Popa-Burca, L.: On algebraic distributional analysis of romanian lexical units. In: Kay, M. (ed.) Abstracts of the 1976 International Conference on Computational Linguistics COLING, p. 54 (1979)

    Google Scholar 

  8. Basili, R., Pazienza, M., Vindigni, M.: Corpus-driven unsupervised learning of verb subcategorization frames. In: Lenzerini, M. (ed.) AI*IA 1997. LNCS, vol. 1321, pp. 159–170. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  9. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  10. Jipsen, P., Tsinakis, C.: A survey of residuated lattices. Ordered Algebraic Structures, 19–56 (2002)

    Google Scholar 

  11. Choi, V.: Faster algorithms for constructing a galois/concept lattice. In: SIAM Conference on Discrete Mathematics 2006. University of Victoria, Canada (2006)

    Google Scholar 

  12. Boullier, P.: Chinese Numbers, MIX, Scrambling, and Range Concatenation Grammars. In: Proceedings of the 9th Conference of the European Chapter of the Association for Computational Linguistics (EACL 1999), pp. 8–12 (1999)

    Google Scholar 

  13. Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics 6(4), 519–535 (2001)

    MathSciNet  MATH  Google Scholar 

  14. Moortgat, M.: Multimodal linguistic inference. Journal of Logic, Language and Information 5(3), 349–385 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ono, H., Komori, Y.: Logics Without the Contraction Rule. The Journal of Symbolic Logic 50(1), 169–201 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  16. van Helden, W.: Case and gender: Concept formation between morphology and syntax (II volumes). Studies in Slavic and General Linguistics, Rodopi, Amsterdam-Atlanta (1993)

    Google Scholar 

  17. Gazdar, G., Klein, E., Pullum, G., Sag, I.: Generalised Phrase Structure Grammar. Basil Blackwell, London (1985)

    Google Scholar 

  18. Huddleston, R., Pullum, G., Bauer, L.: The Cambridge grammar of the English language. Cambridge University Press, New York (2002)

    Book  Google Scholar 

  19. Jackendoff, R.: Alternative minimalist visions of language. In: Proceedings of Chicago Linguistics Society, vol. (41) (2008)

    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

Clark, A. (2011). A Learnable Representation for Syntax Using Residuated Lattices. In: de Groote, P., Egg, M., Kallmeyer, L. (eds) Formal Grammar. FG 2009. Lecture Notes in Computer Science(), vol 5591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20169-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20169-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20168-4

  • Online ISBN: 978-3-642-20169-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics