On the Learnability of Classes of Minimal Grammars With Respect to Some Linear Preordering Relations

Barbara Dziemidowicz-Gryz

doi:10.1515/slgr-2015-0029

.blurhash-client-img { display: none !important; }

On the Learnability of Classes of Minimal Grammars With Respect to Some Linear Preordering Relations

Studies in Logic, Grammar and Rhetoric

Volume 42 (2015): Issue 1 (September 2015)

By: Barbara Dziemidowicz-Gryz

Open Access

|Nov 2015

Abstract

In this paper we prove the learnability of the classes of minimal grammars with respect to some linear preorderings on the set of categorial grammars. We give some examples of the linear preordering relations on the set of categorial grammars satisfying necessary conditions.

References

Ajdukiewicz, K. (1935). Die syntaktische Konnexit¨at. Studia Philosophica, 1, 1-27.
Search in Google Scholar
Buszkowski, W. (1987). Solvable problems for classical categorial grammars. Bulletin of the Polish Academy of Sciences, Mathematics, 35, 373-382.
Search in Google Scholar
Buszkowski, W., & Dziemidowicz, B. (2000). Restricted optimal unification. In: Hamamatsu, Y., Kosicki, W., Polkowski, L., Toho, M., & Yonekura, T. (Eds.), Formal Methods and Intelligent Techniques in Control, Desicion Making, Multimedia and Robotics, 1-8.
Search in Google Scholar
Buszkowski,W., & Penn, G. (1990). Categorial grammars determined from linguistic data by unification. Studia Logica, 49, 431-454.10.1007/BF00370157
Search in Google Scholar
Doets, K. (1994). From Logic to Logic Programming, Cambridge,Mass.: MIT Press.
Search in Google Scholar
Dziemidowicz, B. (2002). Optimal unification and learning algorithms for categorial grammars. Fundamenta Informaticae, 49, 297-308.
Search in Google Scholar
Dziemidowicz, B. (2007). On learnability of restricted classes of categorial grammars. Studia Logica, 85, 153-169.10.1007/s11225-007-9036-y
Search in Google Scholar
Gold, E. M. (1967). Language identification in the limit. Information and Control, 10, 447-474.10.1016/S0019-9958(67)91165-5
Search in Google Scholar
Kanazawa, M. (1996). Identification in the limit of categorial grammars. Journal of Logic, Language and Information, 5, 115-155.10.1007/BF00173697
Search in Google Scholar
Kanazawa, M. (1998). Learnable classes of categorial grammars. Stanford: CSLI Publications FoLLI.
Search in Google Scholar
Kapur, S. (1991). Computational learning of languages. Ph. D. disseration, Available as technical raport, 91-1234, Cornel University.
Search in Google Scholar
Lloyd, J. W. (1987). Foundations of Logic Programming, Berlin: Springer.10.1007/978-3-642-83189-8
Search in Google Scholar
Marciniec, J. (1994). Learning categorial grammars by unification with negative constraints. Journal of Applied Non-Classical Logics, 4, 181-200.10.1080/11663081.1994.10510831
Search in Google Scholar
Marciniec, J. (1997). The method of unification in procedures of determining categorial grammars (in Polish). Investigationes Linguisticae, 2, 45-96.
Search in Google Scholar
Osheron, D., de Jongh, D., Martin, E., & Weinstein, S. (1997). Formal learning theory. In: van Benthen, J., & ter Meulen, A. ( Eds.), Handbook of Logic and Language, 737-775.
Search in Google Scholar

Articles in this issue

DOI: https://doi.org/10.1515/slgr-2015-0029 | Journal eISSN: 2199-6059 | Journal ISSN: 0860-150X

Journal RSS Feed

Language: English

Page range: 37 - 48

Published on: Nov 26, 2015

Published by: University of Białystok

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

Related subjects:

© 2015 Barbara Dziemidowicz-Gryz, published by University of Białystok
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Volume 42 (2015): Issue 1 (September 2015)