A Note on the Durda, Caron, and Buchanan Word Ambiguity Detection Algorithm

• Autorzy: Urban Roman , Anisimowicz Hubert

Identyfikatory

DOI

10.3233/FI-2019-1825

• Języki publikacji: EN

Abstrakty

EN

In 2010 Durda, Caron, and Buchanan published a paper in INFOR: Information systems and Operational Research, entitled: An application of operational research to computational linguistics: Word ambiguity. In this article the authors developed “a new measure of word ambiguity (e.g., homonymy and polysemy) for use in psycholinguistic research”. In our work we propose some modification of their algorithm.

Słowa kluczowe

EN

word ambiguity; homonymy; polysemy; clustering algorithms; Gomory-Hu algorithm; genetic algorithms

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2019
• Tom: Vol. 168, nr 1
• Strony: 79--88
• Opis fizyczny: Bibliogr. 16 poz., tab.

Twórcy

autor

Urban Roman

• Institute of Mathematics, Wroclaw University, Plac Grunwaldzki 2/4, 50-384 Wroclaw, Poland

autor

Anisimowicz Hubert

• Institute of Mathematics, Wroclaw University, Plac Grunwaldzki 2/4, 50-384 Wroclaw, Poland

Bibliografia

• [1] Hutchins J. Machine translation: a concise history. Journal of Translation Studies, 2010. 13(1-2):29-70. URL https://www.chineseupress.com/index.php?route=product/product&product_id=3055.
• [2] Urban R. Szkic historii lingwistyki matematycznej w Rosji i ZSRR, ze szczególnym uwzględnieniem tłumaczenia maszynowego. LingVaria, 2016. 21(1):249-267. doi:10.12797/LV.11.2016.21.21.
• [3] Lyons J. Semantics Vol. 1. Cambridge University Press, 1977. ISBN 978-0-521-29165-1.
• [4] Lyons J. Semantics Vol. 2. Cambridge University Press, 1977. ISBN 978-1-316-58219-0.
• [5] Koskela A, Murphy ML. Polysemy and homonymy. In: Brown K (ed.), Concise encyclopedia of philosophy of language and linguistics, pp. 577-580. Elsevier. ISBN 978-0-08-096500-0, 2010.
• [6] Durda K, Caron RJ, Buchanan L. An application of operational research to computational liguistics: Word ambiguity. INFOR: Information Systems and and Operational Research, 2010. 48(1):1-11. doi:10.3138/infor.48.1.001.
• [7] Shapiro LG, Haralick RM. Decomposition of two-dimensional shapes by graph-theoretic clustering. IEEE Trans Pattern Anal Mach Intell., 1979. 1:10-20. doi:10.1109/TPAMI.1979.4766871.
• [8] Flake GW, Tarjan RE, Tsioutsiouliklis K. Graph clustering and minimum cut trees. Internet Math., 2004. 1(4):385-408. URL http://projecteuclid.org/euclid.im/1109191029.
• [9] Schaeffer SE. Graph clustering. Computer Science Review, 2007. 1(1):27-64. doi:10.1016/j.cosrev.2007.05.001.
• [10] Diestel R. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer, Berlin, fifth edition, 2018. ISBN 978-3-662-57560-4; 978-3-662-53621-6. Paperback edition of [ MR3644391].
• [11] Harris JM, Hirst JL, Mossinghoff MJ. Combinatorics and graph theory. Undergraduate Texts in Mathematics. Springer, New York, second edition, 2008. ISBN 978-0-387-79710-6. doi:10.1007/978-0-387-79711-3.
• [12] Shannon CE. A mathematical theory of communication. Bell System Tech. J., 1948. 27:379-423, 623-656. doi:10.1002/j.1538-7305.1948.tb01338.x.
• [13] Eiben AE, Smith JE. Introduction to evolutionary computing. Natural Computing Series. Springer, Heidelberg, second edition, 2015. ISBN 978-3-662-44873-1; 978-3-662-44874-8. doi:10.1007/978-3-662-44874-8.
• [14] Holland JH. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, Mich., 1975. An introductory analysis with applications to biology, control, and artificial intelligence.
• [15] Thulasiraman K. Connectivity algorithms. In: Thulasiraman K (ed.), Handbook of graph theory, combinatorial optimization, and algorithms, Chapman & Hall/CRC Computer and Information Science Series, pp. xv+1195. CRC Press, Taylor & Francis Group, Boca Raton, FL, 2016. Oxford University Press, 2017.
• [16] Gomory RE, Hu TC. Multi-terminal network flows. J. Soc. Indust. Appl. Math., 1961. 9:551-570. URL https://www.jstor.org/stable/2098881.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).