Abstract
We describe Polish numerals in terms of finite state automata represented by graphs. As compared to French and English, the Polish system is more complicated due to the existence of a seven-case noun declension. It is shown how different numerals select specific cases of their nominal complement in a nominal phrase of the form Numeral+Noun and how the syntactic position of some cardinals in compound structures governs the choice of the appropriate case of the nominal regime.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bogacki, K. (2002). The Treatment of Numbers in Polish by Graphs. In: Ranchhod, E., Mamede, N.J. (eds) Advances in Natural Language Processing. PorTAL 2002. Lecture Notes in Computer Science(), vol 2389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45433-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-45433-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43829-8
Online ISBN: 978-3-540-45433-5
eBook Packages: Springer Book Archive