{"id":477894,"date":"2023-08-09T09:22:01","date_gmt":"2023-08-09T09:22:01","guid":{"rendered":""},"modified":"2023-09-05T11:15:37","modified_gmt":"2023-09-05T11:15:37","slug":"lossless-compression","status":"publish","type":"wiki","link":"https:\/\/oneproxy.pro\/tr\/wiki\/lossless-compression\/","title":{"rendered":"Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma"},"content":{"rendered":"

girii\u015f<\/h2>\n

Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma, veri s\u0131k\u0131\u015ft\u0131rma alan\u0131nda temel bir kavramd\u0131r ve s\u0131k\u0131\u015ft\u0131rma i\u015flemi s\u0131ras\u0131nda hi\u00e7bir bilgi kayb\u0131 olmadan dosyalar\u0131n ve verilerin boyutunu azaltmam\u0131za olanak tan\u0131r. Bu teknoloji, veri depolama, dosya aktar\u0131m\u0131, multimedya i\u015fleme ve web'de gezinme dahil olmak \u00fczere \u00e7e\u015fitli alanlarda \u00f6nemli bir rol oynamaktad\u0131r. \u00d6nde gelen bir proxy sunucu sa\u011flay\u0131c\u0131s\u0131 olan OneProxy, veri iletimini geli\u015ftirmede ve hizmetlerini optimize etmede kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rman\u0131n \u00f6neminin fark\u0131ndad\u0131r. Bu makalede, proxy sunucularla sinerjisini ke\u015ffederken, kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rman\u0131n tarihini, i\u015fleyi\u015fini, t\u00fcrlerini ve gelecekteki beklentilerini inceleyece\u011fiz.<\/p>\n

K\u00f6keni ve \u0130lk S\u00f6z\u00fc<\/h2>\n

Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rman\u0131n k\u00f6kleri hesaplaman\u0131n ilk g\u00fcnlerine kadar uzanabilir. Veri b\u00fct\u00fcnl\u00fc\u011f\u00fcnden \u00f6d\u00fcn vermeden dosya boyutlar\u0131n\u0131 azaltma kavram\u0131, ilk bilgisayar bilimcileri ve m\u00fchendislerinin \u00e7\u00f6zmeye \u00e7al\u0131\u015ft\u0131\u011f\u0131 bir zorluktu. Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rman\u0131n ilk s\u00f6zlerinden biri, \u00fcnl\u00fc bilgisayar bilimcisi Claude Shannon'\u0131n bilgi teorisini tan\u0131tt\u0131\u011f\u0131 1940'lara kadar uzan\u0131r. Shannon'\u0131n \u00e7al\u0131\u015fmas\u0131, veri s\u0131k\u0131\u015ft\u0131rman\u0131n teorik temelini olu\u015fturdu ve kay\u0131ps\u0131z veri s\u0131k\u0131\u015ft\u0131rman\u0131n s\u0131n\u0131rlar\u0131na ili\u015fkin i\u00e7g\u00f6r\u00fcler sa\u011flad\u0131.<\/p>\n

Kay\u0131ps\u0131z S\u0131k\u0131\u015ft\u0131rmay\u0131 Anlamak<\/h2>\n

Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma, verileri herhangi bir veri kayb\u0131 olmadan daha verimli bir \u015fekilde kodlamak i\u00e7in \u00e7e\u015fitli algoritmalar kullan\u0131r. Daha y\u00fcksek s\u0131k\u0131\u015ft\u0131rma oranlar\u0131 elde etmek i\u00e7in baz\u0131 bilgileri feda eden kay\u0131pl\u0131 s\u0131k\u0131\u015ft\u0131rman\u0131n aksine, kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma, s\u0131k\u0131\u015ft\u0131rman\u0131n a\u00e7\u0131lmas\u0131ndan sonra verilerin tam olarak yeniden yap\u0131land\u0131r\u0131lmas\u0131n\u0131 sa\u011flar. Bu, \u00f6zellikle veri b\u00fct\u00fcnl\u00fc\u011f\u00fcn\u00fcn ve do\u011frulu\u011funun \u00e7ok \u00f6nemli oldu\u011fu uygulamalar i\u00e7in \u00e7ok \u00f6nemlidir.<\/p>\n

\u0130\u00e7 Yap\u0131 ve \u0130\u015fleyi\u015f<\/h2>\n

Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma algoritmalar\u0131, s\u0131k\u0131\u015ft\u0131rmay\u0131 ger\u00e7ekle\u015ftirmek i\u00e7in veriler i\u00e7indeki kal\u0131plar\u0131 ve fazlal\u0131klar\u0131 kullan\u0131r. Temel prensip, tekrarlayan veya \u00f6ng\u00f6r\u00fclebilir dizilerin daha k\u0131sa g\u00f6sterimlerle de\u011fi\u015ftirilmesini ve b\u00f6ylece genel dosya boyutunun azalt\u0131lmas\u0131n\u0131 i\u00e7erir. S\u0131k\u0131\u015ft\u0131rma s\u0131ras\u0131nda veriler kompakt bir forma d\u00f6n\u00fc\u015ft\u00fcr\u00fcl\u00fcr ve s\u0131k\u0131\u015ft\u0131rman\u0131n a\u00e7\u0131lmas\u0131yla orijinal durumuna geri y\u00fcklenir. S\u00fcre\u00e7 iki ana a\u015famadan olu\u015fur: kodlama ve kod \u00e7\u00f6zme.<\/p>\n

Kodlama:<\/h3>\n
    \n
  1. Tekrarlanan kal\u0131plar\u0131n veya veri dizilerinin tan\u0131mlanmas\u0131.<\/li>\n
  2. Bu kal\u0131plar\u0131 verimli bir \u015fekilde saklamak i\u00e7in bir kod kitab\u0131 veya s\u00f6zl\u00fck olu\u015fturulmas\u0131.<\/li>\n
  3. Tekrarlanan kal\u0131plar\u0131 kod kitab\u0131na referanslarla de\u011fi\u015ftirmek.<\/li>\n<\/ol>\n

    Kod \u00e7\u00f6zme:<\/h3>\n
      \n
    1. Orijinal verileri yeniden olu\u015fturmak i\u00e7in kod kitab\u0131na ba\u015fvurmak.<\/li>\n
    2. Kodlama i\u015fleminin ters i\u015flemlerinin uygulanmas\u0131.<\/li>\n<\/ol>\n

      Kay\u0131ps\u0131z S\u0131k\u0131\u015ft\u0131rman\u0131n Temel \u00d6zellikleri<\/h2>\n

      Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma tekniklerinin etkinli\u011fi belirli temel \u00f6zelliklere ba\u011fl\u0131d\u0131r:<\/p>\n

        \n
      1. \n

        S\u0131k\u0131\u015ft\u0131rma oran\u0131:<\/strong> S\u0131k\u0131\u015ft\u0131rma oran\u0131, verinin boyutunun ne kadar k\u00fc\u00e7\u00fclt\u00fcld\u00fc\u011f\u00fcn\u00fc g\u00f6sterir. Genellikle y\u00fczde veya oran olarak ifade edilir.<\/p>\n<\/li>\n

      2. \n

        H\u0131z:<\/strong> S\u0131k\u0131\u015ft\u0131rma ve a\u00e7ma h\u0131z\u0131, \u00f6zellikle b\u00fcy\u00fck veri k\u00fcmeleriyle u\u011fra\u015f\u0131rken \u00e7ok \u00f6nemlidir. Baz\u0131 algoritmalar daha h\u0131zl\u0131 s\u0131k\u0131\u015ft\u0131rma sunarken di\u011ferleri daha h\u0131zl\u0131 s\u0131k\u0131\u015ft\u0131rmay\u0131 a\u00e7maya \u00f6ncelik verir.<\/p>\n<\/li>\n

      3. \n

        Benzersizli\u011fin Korunmas\u0131:<\/strong> Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma, her benzersiz veri par\u00e7as\u0131n\u0131n s\u0131k\u0131\u015ft\u0131rma s\u0131ras\u0131nda benzersiz bir \u015fekilde temsil edilmesini ve s\u0131k\u0131\u015ft\u0131rman\u0131n a\u00e7\u0131lmas\u0131ndan sonra tamamen geri y\u00fcklenmesini sa\u011flar.<\/p>\n<\/li>\n

      4. \n

        Veri Kayb\u0131 Yok:<\/strong> Ad\u0131ndan da anla\u015f\u0131laca\u011f\u0131 gibi, kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma, s\u0131k\u0131\u015ft\u0131rma i\u015flemi s\u0131ras\u0131nda hi\u00e7bir verinin kaybolmamas\u0131n\u0131 veya de\u011fi\u015ftirilmemesini garanti ederek onu kritik uygulamalar i\u00e7in uygun hale getirir.<\/p>\n<\/li>\n

      5. \n

        Uygulanabilirlik:<\/strong> Metin, resim, ses veya video gibi belirli veri t\u00fcrleri i\u00e7in farkl\u0131 s\u0131k\u0131\u015ft\u0131rma algoritmalar\u0131 daha uygun olabilir.<\/p>\n<\/li>\n<\/ol>\n

        Kay\u0131ps\u0131z S\u0131k\u0131\u015ft\u0131rma T\u00fcrleri<\/h2>\n\n\n\n\n\n\n\n\n\n
        S\u0131k\u0131\u015ft\u0131rma T\u00fcr\u00fc<\/strong><\/th>\nTan\u0131m<\/strong><\/th>\n\u00d6rnekler<\/strong><\/th>\n<\/tr>\n<\/thead>\n
        \u00c7al\u0131\u015fma Uzunlu\u011fu Kodlamas\u0131<\/strong><\/td>\nArd\u0131\u015f\u0131k tekrarlanan verileri tek bir de\u011fer olarak kodlar.<\/td>\nAAABBBBCCCC -> 4A4B4C<\/td>\n<\/tr>\n
        Huffman Kodlamas\u0131<\/strong><\/td>\nVeri \u00f6\u011feleri i\u00e7in de\u011fi\u015fken uzunluklu kodlar olu\u015fturur.<\/td>\nA:00, B:01, C:10, D:110, E:111<\/td>\n<\/tr>\n
        Lempel-Ziv-Welch (LZW)<\/strong><\/td>\nS\u0131kl\u0131kla meydana gelen verilerden olu\u015fan bir s\u00f6zl\u00fck olu\u015fturur.<\/td>\nABABCABAB -> AB, A, C, ABAB, AB<\/td>\n<\/tr>\n
        Burrows-Wheeler D\u00f6n\u00fc\u015f\u00fcm\u00fc (BWT)<\/strong><\/td>\nArt\u0131kl\u0131\u011f\u0131 ortaya \u00e7\u0131karmak i\u00e7in verileri yeniden d\u00fczenler.<\/td>\n\u201cmuz\u201d -> \u201cannb#a#a\u201d<\/td>\n<\/tr>\n
        S\u00f6nd\u00fcr<\/strong><\/td>\nLZ77 ve Huffman kodlamas\u0131n\u0131 ZIP format\u0131nda birle\u015ftirir.<\/td>\n\u2013<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

        Uygulamalar, Zorluklar ve \u00c7\u00f6z\u00fcmler<\/h2>\n

        Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma, \u00e7e\u015fitli alanlardaki uygulamalar\u0131 bulur:<\/p>\n

          \n
        1. \n

          Veri depolama:<\/strong> Dosya boyutlar\u0131n\u0131n k\u00fc\u00e7\u00fclt\u00fclmesi, depolama alan\u0131n\u0131n verimli kullan\u0131lmas\u0131n\u0131 sa\u011flayarak veri ar\u015fivleme ve yedekleme kapasitesini art\u0131r\u0131r.<\/p>\n<\/li>\n

        2. \n

          Veri aktar\u0131m\u0131:<\/strong> Verilerin iletimden \u00f6nce s\u0131k\u0131\u015ft\u0131r\u0131lmas\u0131 bant geni\u015fli\u011fi kullan\u0131m\u0131n\u0131 azaltarak daha h\u0131zl\u0131 ve daha uygun maliyetli veri aktar\u0131mlar\u0131na olanak sa\u011flar.<\/p>\n<\/li>\n

        3. \n

          Multimedya \u0130\u015fleme:<\/strong> Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma, multimedya d\u00fczenleme ve ar\u015fivlemede g\u00f6r\u00fcnt\u00fclerin, sesin ve videolar\u0131n kalitesini korumak i\u00e7in gereklidir.<\/p>\n<\/li>\n<\/ol>\n

          Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rmayla ilgili zorluklar \u015funlar\u0131 i\u00e7erir:<\/p>\n

            \n
          1. \n

            S\u0131k\u0131\u015ft\u0131rma Ek Y\u00fck\u00fc:<\/strong> Baz\u0131 s\u0131k\u0131\u015ft\u0131rma algoritmalar\u0131 ek meta veriler ekleyerek dosya boyutunda k\u00fc\u00e7\u00fck bir art\u0131\u015fa neden olur.<\/p>\n<\/li>\n

          2. \n

            S\u0131n\u0131rl\u0131 S\u0131k\u0131\u015ft\u0131rma Oranlar\u0131:<\/strong> Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma genellikle kay\u0131pl\u0131 s\u0131k\u0131\u015ft\u0131rma y\u00f6ntemlerine g\u00f6re daha d\u00fc\u015f\u00fck s\u0131k\u0131\u015ft\u0131rma oranlar\u0131na ula\u015f\u0131r.<\/p>\n<\/li>\n

          3. \n

            \u0130\u015fleme Karma\u015f\u0131kl\u0131\u011f\u0131:<\/strong> Baz\u0131 geli\u015fmi\u015f s\u0131k\u0131\u015ft\u0131rma algoritmalar\u0131, kodlama ve kod \u00e7\u00f6zme i\u00e7in \u00f6nemli miktarda hesaplama kayna\u011f\u0131 gerektirebilir.<\/p>\n<\/li>\n<\/ol>\n

            Bu zorluklar\u0131n \u00e7\u00f6z\u00fcm\u00fc, daha verimli algoritmalar\u0131n ve donan\u0131m optimizasyonlar\u0131n\u0131n geli\u015ftirilmesini i\u00e7erir.<\/p>\n

            Perspektifler ve Gelece\u011fin Teknolojileri<\/h2>\n

            Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rman\u0131n gelece\u011fi, devam eden ara\u015ft\u0131rmalar ve bilgi i\u015flem teknolojilerindeki ilerlemeler sayesinde umut vericidir. Gelece\u011fe y\u00f6nelik beklentiler \u015funlar\u0131 i\u00e7erir:<\/p>\n

              \n
            1. \n

              Geli\u015ftirilmi\u015f Algoritmalar:<\/strong> Ara\u015ft\u0131rmac\u0131lar h\u0131z ve veri b\u00fct\u00fcnl\u00fc\u011f\u00fcnden \u00f6d\u00fcn vermeden daha y\u00fcksek oranlar sunan yeni s\u0131k\u0131\u015ft\u0131rma tekniklerini ke\u015ffetmeye devam ediyor.<\/p>\n<\/li>\n

            2. \n

              Yapay Zeka ile Geli\u015ftirilmi\u015f S\u0131k\u0131\u015ft\u0131rma:<\/strong> Makine \u00f6\u011frenimi ve yapay zeka, karma\u015f\u0131k kal\u0131plar\u0131n ve fazlal\u0131klar\u0131n belirlenmesine yard\u0131mc\u0131 olarak daha verimli s\u0131k\u0131\u015ft\u0131rma y\u00f6ntemlerine yol a\u00e7abilir.<\/p>\n<\/li>\n

            3. \n

              Donan\u0131m ivmesi:<\/strong> \u00d6zel s\u0131k\u0131\u015ft\u0131rma donan\u0131m\u0131, s\u0131k\u0131\u015ft\u0131rma ve s\u0131k\u0131\u015ft\u0131rmay\u0131 a\u00e7ma i\u015flemlerinin h\u0131z\u0131n\u0131 \u00f6nemli \u00f6l\u00e7\u00fcde art\u0131rabilir.<\/p>\n<\/li>\n<\/ol>\n

              Proxy Sunucularla Sinerji<\/h2>\n

              OneProxy taraf\u0131ndan sa\u011flananlar gibi proxy sunucular, kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rmadan \u00e7e\u015fitli \u015fekillerde yararlanabilir:<\/p>\n

                \n
              1. \n

                Bant Geni\u015fli\u011fi Optimizasyonu:<\/strong> Verilerin proxy sunucular arac\u0131l\u0131\u011f\u0131yla iletilmeden \u00f6nce s\u0131k\u0131\u015ft\u0131r\u0131lmas\u0131, bant geni\u015fli\u011fi t\u00fcketimini azaltarak kullan\u0131c\u0131lar i\u00e7in daha h\u0131zl\u0131 ve daha duyarl\u0131 ba\u011flant\u0131lara olanak tan\u0131r.<\/p>\n<\/li>\n

              2. \n

                Azalt\u0131lm\u0131\u015f Gecikme:<\/strong> Daha k\u00fc\u00e7\u00fck veri boyutlar\u0131 daha d\u00fc\u015f\u00fck gecikmelere yol a\u00e7arak web'de gezinme ve di\u011fer internet etkinlikleri s\u0131ras\u0131nda kullan\u0131c\u0131 deneyimlerini geli\u015ftirir.<\/p>\n<\/li>\n

              3. \n

                Gizlilik ve g\u00fcvenlik:<\/strong> Proxy'ler arac\u0131l\u0131\u011f\u0131yla g\u00fcvenli veri aktar\u0131m\u0131nda kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rmadan yararlan\u0131labilir ve aktar\u0131mlar s\u0131ras\u0131nda veri b\u00fct\u00fcnl\u00fc\u011f\u00fc sa\u011flan\u0131r.<\/p>\n<\/li>\n<\/ol>\n

                \u0130lgili Ba\u011flant\u0131lar<\/h2>\n

                Kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma hakk\u0131nda daha fazla bilgi i\u00e7in a\u015fa\u011f\u0131daki kaynaklar\u0131 inceleyebilirsiniz:<\/p>\n

                  \n
                1. Veri S\u0131k\u0131\u015ft\u0131rman\u0131n A\u00e7\u0131klamas\u0131<\/a><\/li>\n
                2. Kay\u0131ps\u0131z S\u0131k\u0131\u015ft\u0131rma Teknikleri<\/a><\/li>\n
                3. Huffman Kodlamas\u0131na Giri\u015f<\/a><\/li>\n
                4. Lempel-Ziv-Welch (LZW) S\u0131k\u0131\u015ft\u0131rma<\/a><\/li>\n<\/ol>\n

                  Sonu\u00e7 olarak, kay\u0131ps\u0131z s\u0131k\u0131\u015ft\u0131rma veri y\u00f6netiminin hayati bir y\u00f6n\u00fcd\u00fcr ve b\u00fct\u00fcnl\u00fc\u011f\u00fcnden \u00f6d\u00fcn vermeden bilgiyi depolamak ve iletmek i\u00e7in etkili yollar sunar. S\u0131k\u0131\u015ft\u0131rma teknolojilerinin s\u00fcrekli geli\u015fimi ve bunlar\u0131n OneProxy gibi proxy sunucularla entegrasyonu, geli\u015fmi\u015f kullan\u0131c\u0131 deneyimleri ve optimize edilmi\u015f internet kullan\u0131m\u0131 sa\u011flar.<\/p>","protected":false},"featured_media":468812,"menu_order":0,"template":"","meta":{"_acf_changed":false,"content-type":"","inline_featured_image":false,"footnotes":""},"class_list":["post-477894","wiki","type-wiki","status-publish","has-post-thumbnail","hentry"],"acf":{"faq_title":"Frequently Asked Questions about Lossless Compression: Preserving Data with Efficiency<\/mark>","faq_items":[{"question":"What is lossless compression?","answer":"

                  Lossless compression is a data compression technique that reduces the size of files without losing any information. Unlike lossy compression, which sacrifices data to achieve higher compression ratios, lossless compression ensures data integrity is maintained during the compression and decompression process.<\/p>"},{"question":"How does lossless compression work?","answer":"

                  Lossless compression algorithms identify repetitive patterns or data sequences and create a codebook or dictionary to store them efficiently. These algorithms then replace recurring patterns with references to the codebook. During decompression, the original data is reconstructed using the codebook.<\/p>"},{"question":"What are the key features of lossless compression?","answer":"

                  The key features of lossless compression include:<\/p>

                  • High data integrity with no loss of information<\/li>
                  • Different compression ratios depending on the algorithm<\/li>
                  • Varying compression and decompression speeds<\/li>
                  • Uniqueness preservation, ensuring each unique piece of data is represented uniquely<\/li><\/ul>"},{"question":"What types of lossless compression exist?","answer":"

                    There are several types of lossless compression, including:<\/p>

                    1. Run-Length Encoding: Encodes consecutive repeated data as a single value.<\/li>
                    2. Huffman Coding: Creates variable-length codes for data elements.<\/li>
                    3. Lempel-Ziv-Welch (LZW): Builds a dictionary of frequently occurring data.<\/li>
                    4. Burrows-Wheeler Transform (BWT): Rearranges data to expose redundancy.<\/li>
                    5. Deflate: Combines LZ77 and Huffman coding in the ZIP format.<\/li><\/ol>"},{"question":"How is lossless compression used?","answer":"

                      Lossless compression finds applications in various domains, including:<\/p>

                      • Data storage to efficiently utilize storage space.<\/li>
                      • Data transmission to reduce bandwidth usage during transfers.<\/li>
                      • Multimedia processing to maintain image, audio, and video quality.<\/li><\/ul>"},{"question":"What are the challenges of lossless compression?","answer":"

                        Challenges associated with lossless compression include:<\/p>

                        • Compression overhead due to additional metadata.<\/li>
                        • Limited compression ratios compared to lossy compression.<\/li>
                        • Processing complexity for some advanced algorithms.<\/li><\/ul>"},{"question":"What does the future hold for lossless compression?","answer":"

                          The future of lossless compression is promising, with ongoing research and advancements in computing technologies. Expectations include improved algorithms, AI-enhanced compression, and hardware acceleration.<\/p>"},{"question":"How do proxy servers benefit from lossless compression?","answer":"

                          Proxy servers, like OneProxy, benefit from lossless compression through:<\/p>

                          • Bandwidth optimization for faster and more responsive connections.<\/li>
                          • Reduced latency for improved user experiences.<\/li>
                          • Enhanced privacy and security during secure data transmission.<\/li><\/ul>"}]},"_links":{"self":[{"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/wiki\/477894","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/wiki"}],"about":[{"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/types\/wiki"}],"version-history":[{"count":0,"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/wiki\/477894\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/media\/468812"}],"wp:attachment":[{"href":"https:\/\/oneproxy.pro\/tr\/wp-json\/wp\/v2\/media?parent=477894"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}