Jarak Levenshtein (Indonesian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Jarak Levenshtein" in Indonesian language version.

refsWebsite

Global rank Indonesian rank

2^nd place

4^th place

18^th place

44^th place

1^st place

low place

383^rd place

715^th place

2,951^st place

low place

3^rd place

6^th place

low place

bitbucket.org

"Clearer / Iosifovich: Blazingly fast levenshtein distance function". Diarsipkan dari versi asli tanggal June 12, 2018. It gets it's [sic] speed from using very little memory, often keeping the buffer entirely in cache, and reducing the amount of work by skipping any prefix and postfix that won't add to the cost. [...] The point is, you only really need to know the three values when you want to update a cell in the matrix and you can keep two of them in a buffer, while keeping the third value in a fixed location. Live descendent code.
"Clearer / Iosifovich: Blazingly fast levenshtein distance function". Diarsipkan dari versi asli tanggal June 12, 2018. It gets it's [sic] speed from using very little memory, often keeping the buffer entirely in cache, and reducing the amount of work by skipping any prefix and postfix that won't add to the cost. [...] The point is, you only really need to know the three values when you want to update a cell in the matrix and you can keep two of them in a buffer, while keeping the third value in a fixed location. Live descendent code.

Jan D. ten Thije; Ludger Zeevaert (2007-01-01), Receptive multilingualism: linguistic analyses, language policies, and didactic concepts, John Benjamins Publishing Company, 2007, ISBN 978-90-272-1926-8, ... Assuming that intelligibility is inversely related to linguistic distance ... the content words the percentage of cognates (related directly or via a synonym) ... lexical relatedness ... grammatical relatedness ...

Navarro, Gonzalo (2001). "A guided tour to approximate string matching" (PDF). ACM Computing Surveys. 33 (1): 31–88. doi:10.1145/375360.375365.
Wagner, Robert A.; Fischer, Michael J. (1974), "The String-to-String Correction Problem", Journal of the ACM, 21 (1): 168–173, doi:10.1145/321796.321811
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.

"Clearer / Iosifovich: Blazingly fast levenshtein distance function". Diarsipkan dari versi asli tanggal June 12, 2018. It gets it's [sic] speed from using very little memory, often keeping the buffer entirely in cache, and reducing the amount of work by skipping any prefix and postfix that won't add to the cost. [...] The point is, you only really need to know the three values when you want to update a cell in the matrix and you can keep two of them in a buffer, while keeping the third value in a fixed location. Live descendent code.
"Clearer / Iosifovich: Blazingly fast levenshtein distance function". Diarsipkan dari versi asli tanggal June 12, 2018. It gets it's [sic] speed from using very little memory, often keeping the buffer entirely in cache, and reducing the amount of work by skipping any prefix and postfix that won't add to the cost. [...] The point is, you only really need to know the three values when you want to update a cell in the matrix and you can keep two of them in a buffer, while keeping the third value in a fixed location. Live descendent code.

Andoni, Alexandr; Krauthgamer, Robert; Onak, Krzysztof (2010-05). "Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity". arXiv e-prints (dalam bahasa Inggris): arXiv:1005.4033.
Backurs, Arturs; Indyk, Piotr (2014-11). "Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)". arXiv e-prints (dalam bahasa Inggris): arXiv:1412.0348.

Влади́мир И. Левенштейн (1965). Двоичные коды с исправлением выпадений, вставок и замещений символов [Binary codes capable of correcting deletions, insertions, and reversals]. Доклады Академий Наук СССР (dalam bahasa Rusia). 163 (4): 845–8. Appeared in English as: Levenshtein, Vladimir I. (February 1966). "Binary codes capable of correcting deletions, insertions, and reversals". Soviet Physics Doklady. 10: 707–710. Bibcode:1966SPhD...10..707L.

Navarro, Gonzalo (2001). "A guided tour to approximate string matching" (PDF). ACM Computing Surveys. 33 (1): 31–88. doi:10.1145/375360.375365.

"Clearer / Iosifovich: Blazingly fast levenshtein distance function". Diarsipkan dari versi asli tanggal June 12, 2018. It gets it's [sic] speed from using very little memory, often keeping the buffer entirely in cache, and reducing the amount of work by skipping any prefix and postfix that won't add to the cost. [...] The point is, you only really need to know the three values when you want to update a cell in the matrix and you can keep two of them in a buffer, while keeping the third value in a fixed location. Live descendent code.
"Clearer / Iosifovich: Blazingly fast levenshtein distance function". Diarsipkan dari versi asli tanggal June 12, 2018. It gets it's [sic] speed from using very little memory, often keeping the buffer entirely in cache, and reducing the amount of work by skipping any prefix and postfix that won't add to the cost. [...] The point is, you only really need to know the three values when you want to update a cell in the matrix and you can keep two of them in a buffer, while keeping the third value in a fixed location. Live descendent code.