Растојање уређивања (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Растојање уређивања" in Serbian language version.

refsWebsite

Global rank Serbian rank

2^nd place

4^th place

low place

low place

6^th place

5^th place

207^th place

370^th place

1web.archive.org

1^st place

1^st place

1uni-leipzig.de

2,676^th place

5,369^th place

1,670^th place

1,693^rd place

archive.org (Global: 6^th place; Serbian: 5^th place)

Daniel Jurafsky; James H. Martin (2014). Speech and Language Processing. Pearson Education International. стр. 107–111.

calpoly.edu (Global: low place; Serbian: low place)

users.csc.calpoly.edu

Navarro, Gonzalo (1. 03. 2001). „A guided tour to approximate string matching” (PDF). ACM Computing Surveys. 33 (1): 31—88. doi:10.1145/375360.375365. Приступљено 19. 03. 2015.

doi.org (Global: 2^nd place; Serbian: 4^th place)

Navarro, Gonzalo (1. 03. 2001). „A guided tour to approximate string matching” (PDF). ACM Computing Surveys. 33 (1): 31—88. doi:10.1145/375360.375365. Приступљено 19. 03. 2015.
Schulz, Klaus U.; Mihov, Stoyan (2002). „Fast string correction with Levenshtein automata”. International Journal of Document Analysis and Recognition. 5 (1): 67—85. doi:10.1007/s10032-002-0082-8. CiteSeerX: 10.1.1.16.652.
Kukich, Karen (1992). „Techniques for Automatically Correcting Words in Text” (PDF). ACM Computing Surveys. 24 (4): 377—439. doi:10.1145/146370.146380. Архивирано из оригинала (PDF) 27. 09. 2016. г. Приступљено 29. 05. 2016.
R. Wagner; M. Fischer (1974). „The string-to-string correction problem”. J. ACM. 21: 168—178. doi:10.1145/321796.321811.
„Algorithms for approximate string matching” (PDF). Information and Control. 64 (1–3): 100—118. 1985. doi:10.1016/S0019-9958(85)80046-2.
Esko Ukkonen (1985). „Finding approximate patterns in strings”. J. Algorithms. 6: 132—137. doi:10.1016/0196-6774(85)90023-9.

helsinki.fi (Global: 1,670^th place; Serbian: 1,693^rd place)

cs.helsinki.fi

„Algorithms for approximate string matching” (PDF). Information and Control. 64 (1–3): 100—118. 1985. doi:10.1016/S0019-9958(85)80046-2.

psu.edu (Global: 207^th place; Serbian: 370^th place)

citeseerx.ist.psu.edu

Schulz, Klaus U.; Mihov, Stoyan (2002). „Fast string correction with Levenshtein automata”. International Journal of Document Analysis and Recognition. 5 (1): 67—85. doi:10.1007/s10032-002-0082-8. CiteSeerX: 10.1.1.16.652.

uni-leipzig.de (Global: 2,676^th place; Serbian: 5,369^th place)

dc-pubs.dbs.uni-leipzig.de

Kukich, Karen (1992). „Techniques for Automatically Correcting Words in Text” (PDF). ACM Computing Surveys. 24 (4): 377—439. doi:10.1145/146370.146380. Архивирано из оригинала (PDF) 27. 09. 2016. г. Приступљено 29. 05. 2016.

web.archive.org (Global: 1^st place; Serbian: 1^st place)

Kukich, Karen (1992). „Techniques for Automatically Correcting Words in Text” (PDF). ACM Computing Surveys. 24 (4): 377—439. doi:10.1145/146370.146380. Архивирано из оригинала (PDF) 27. 09. 2016. г. Приступљено 29. 05. 2016.