whatlanguage 1.0.5 → 2.0.0

data/copyright-en

@@ -1,243 +0,0 @@
-The english word list in `wordlists/english` is compiled from a preexisting word list
-(public domain) in this repository and the word list from SCOWL 7.0. To comply with the
-license of Kevin Atkinson's work, his copyright file is attached below.
-
-------------------------------------------------------------------------
-
-This English word list is comes directly from SCOWL 7.0 (up to level 60,
-using the speller/make-aspell-dict script, http://wordlist.sourceforge.net/) 
-and is thus under the same copyright of SCOWL.  The affix file (only
-included in the aspell6 package) is based on the Ispell one which is
-under the same copyright of Ispell.  Part of SCOWL is also based on
-Ispell thus the Ispell copyright is included with the SCOWL copyright.
-
-The collective work is Copyright 2000-2011 by Kevin Atkinson as well
-as any of the copyrights mentioned below:
-
-  Copyright 2000-2011 by Kevin Atkinson
-
-  Permission to use, copy, modify, distribute and sell these word
-  lists, the associated scripts, the output created from the scripts,
-  and its documentation for any purpose is hereby granted without fee,
-  provided that the above copyright notice appears in all copies and
-  that both that copyright notice and this permission notice appear in
-  supporting documentation. Kevin Atkinson makes no representations
-  about the suitability of this array for any purpose. It is provided
-  "as is" without express or implied warranty.
-
-Alan Beale <biljir@pobox.com> also deserves special credit as he has,
-in addition to providing the 12Dicts package and being a major
-contributor to the ENABLE word list, given me an incredible amount of
-feedback and created a number of special lists (those found in the
-Supplement) in order to help improve the overall quality of SCOWL.
-
-The 10 level includes the 1000 most common English words (according to
-the Moby (TM) Words II [MWords] package), a subset of the 1000 most
-common words on the Internet (again, according to Moby Words II), and
-frequently class 16 from Brian Kelk's "UK English Wordlist
-with Frequency Classification".
-
-The MWords package was explicitly placed in the public domain:
-
-    The Moby lexicon project is complete and has
-    been place into the public domain. Use, sell,
-    rework, excerpt and use in any way on any platform.
-
-    Placing this material on internal or public servers is
-    also encouraged. The compiler is not aware of any
-    export restrictions so freely distribute world-wide.
-
-    You can verify the public domain status by contacting
-
-    Grady Ward
-    3449 Martha Ct.
-    Arcata, CA  95521-4884
-
-    grady@netcom.com
-    grady@northcoast.com
-
-The "UK English Wordlist With Frequency Classification" is also in the
-Public Domain:
-
-  Date: Sat, 08 Jul 2000 20:27:21 +0100
-  From: Brian Kelk <Brian.Kelk@cl.cam.ac.uk>
-
-  > I was wondering what the copyright status of your "UK English
-  > Wordlist With Frequency Classification" word list as it seems to
-  > be lacking any copyright notice.
-
-  There were many many sources in total, but any text marked
-  "copyright" was avoided. Locally-written documentation was one
-  source. An earlier version of the list resided in a filespace called
-  PUBLIC on the University mainframe, because it was considered public
-  domain.
-
-  Date: Tue, 11 Jul 2000 19:31:34 +0100
-
-  > So are you saying your word list is also in the public domain?
-
-  That is the intention.
-
-The 20 level includes frequency classes 7-15 from Brian's word list.
-
-The 35 level includes frequency classes 2-6 and words appearing in at
-least 11 of 12 dictionaries as indicated in the 12Dicts package.  All
-words from the 12Dicts package have had likely inflections added via
-my inflection database.
-
-The 12Dicts package and Supplement is in the Public Domain.
-
-The WordNet database, which was used in the creation of the
-Inflections database, is under the following copyright:
-
-  This software and database is being provided to you, the LICENSEE,
-  by Princeton University under the following license.  By obtaining,
-  using and/or copying this software and database, you agree that you
-  have read, understood, and will comply with these terms and
-  conditions.:
-
-  Permission to use, copy, modify and distribute this software and
-  database and its documentation for any purpose and without fee or
-  royalty is hereby granted, provided that you agree to comply with
-  the following copyright notice and statements, including the
-  disclaimer, and that the same appear on ALL copies of the software,
-  database and documentation, including modifications that you make
-  for internal use or for distribution.
-
-  WordNet 1.6 Copyright 1997 by Princeton University.  All rights
-  reserved.
-
-  THIS SOFTWARE AND DATABASE IS PROVIDED "AS IS" AND PRINCETON
-  UNIVERSITY MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR
-  IMPLIED.  BY WAY OF EXAMPLE, BUT NOT LIMITATION, PRINCETON
-  UNIVERSITY MAKES NO REPRESENTATIONS OR WARRANTIES OF MERCHANT-
-  ABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE
-  LICENSED SOFTWARE, DATABASE OR DOCUMENTATION WILL NOT INFRINGE ANY
-  THIRD PARTY PATENTS, COPYRIGHTS, TRADEMARKS OR OTHER RIGHTS.
-
-  The name of Princeton University or Princeton may not be used in
-  advertising or publicity pertaining to distribution of the software
-  and/or database.  Title to copyright in this software, database and
-  any associated documentation shall at all times remain with
-  Princeton University and LICENSEE agrees to preserve same.
-
-The 40 level includes words from Alan's 3esl list found in version 4.0
-of his 12dicts package.  Like his other stuff the 3esl list is also in the
-public domain.
-
-The 50 level includes Brian's frequency class 1, words words appearing
-in at least 5 of 12 of the dictionaries as indicated in the 12Dicts
-package, and uppercase words in at least 4 of the previous 12
-dictionaries.  A decent number of proper names is also included: The
-top 1000 male, female, and Last names from the 1990 Census report; a
-list of names sent to me by Alan Beale; and a few names that I added
-myself.  Finally a small list of abbreviations not commonly found in
-other word lists is included.
-
-The name files form the Census report is a government document which I
-don't think can be copyrighted.
-
-The file special-jargon.50 uses common.lst and word.lst from the
-"Unofficial Jargon File Word Lists" which is derived from "The Jargon
-File".  All of which is in the Public Domain.  This file also contain
-a few extra UNIX terms which are found in the file "unix-terms" in the
-special/ directory.
-
-The 55 level includes words from Alan's 2of4brif list found in version
-4.0 of his 12dicts package.  Like his other stuff the 2of4brif is also
-in the public domain.
-
-The 60 level includes all words appearing in at least 2 of the 12
-dictionaries as indicated by the 12Dicts package.
-
-The 70 level includes Brian's frequency class 0 and the 74,550 common
-dictionary words from the MWords package.  The common dictionary words,
-like those from the 12Dicts package, have had all likely inflections
-added.  The 70 level also included the 5desk list from version 4.0 of
-the 12Dics package which is the public domain.
-
-The 80 level includes the ENABLE word list, all the lists in the
-ENABLE supplement package (except for ABLE), the "UK Advanced Cryptics
-Dictionary" (UKACD), the list of signature words in from YAWL package,
-and the 10,196 places list from the MWords package.
-
-The ENABLE package, mainted by M\Cooper <thegrendel@theriver.com>,
-is in the Public Domain:
-
-  The ENABLE master word list, WORD.LST, is herewith formally released
-  into the Public Domain. Anyone is free to use it or distribute it in
-  any manner they see fit. No fee or registration is required for its
-  use nor are "contributions" solicited (if you feel you absolutely
-  must contribute something for your own peace of mind, the authors of
-  the ENABLE list ask that you make a donation on their behalf to your
-  favorite charity). This word list is our gift to the Scrabble
-  community, as an alternate to "official" word lists. Game designers
-  may feel free to incorporate the WORD.LST into their games. Please
-  mention the source and credit us as originators of the list. Note
-  that if you, as a game designer, use the WORD.LST in your product,
-  you may still copyright and protect your product, but you may *not*
-  legally copyright or in any way restrict redistribution of the
-  WORD.LST portion of your product. This *may* under law restrict your
-  rights to restrict your users' rights, but that is only fair.
-
-UKACD, by J Ross Beresford <ross@bryson.demon.co.uk>, is under the
-following copyright:
-
-  Copyright (c) J Ross Beresford 1993-1999. All Rights Reserved.
-
-  The following restriction is placed on the use of this publication:
-  if The UK Advanced Cryptics Dictionary is used in a software package
-  or redistributed in any form, the copyright notice must be
-  prominently displayed and the text of this document must be included
-  verbatim.
-
-  There are no other restrictions: I would like to see the list
-  distributed as widely as possible.
-
-The 95 level includes the 354,984 single words, 256,772 compound
-words, 4,946 female names and the 3,897 male names, and 21,986 names
-from the MWords package, ABLE.LST from the ENABLE Supplement, and some
-additional words found in my part-of-speech database that were not
-found anywhere else.
-
-Accent information was taken from UKACD.
-
-My VARCON package was used to create the American, British, and
-Canadian word list. 
-
-Since the original word lists used used in the VARCON package came
-from the Ispell distribution they are under the Ispell copyright:
-
-  Copyright 1993, Geoff Kuenning, Granada Hills, CA
-  All rights reserved.
-
-  Redistribution and use in source and binary forms, with or without
-  modification, are permitted provided that the following conditions
-  are met:
-
-  1. Redistributions of source code must retain the above copyright
-     notice, this list of conditions and the following disclaimer.
-  2. Redistributions in binary form must reproduce the above copyright
-     notice, this list of conditions and the following disclaimer in the
-     documentation and/or other materials provided with the distribution.
-  3. All modifications to the source code must be clearly marked as
-     such.  Binary redistributions based on modified source code
-     must be clearly marked as modified versions in the documentation
-     and/or other materials provided with the distribution.
-  (clause 4 removed with permission from Geoff Kuenning)
-  5. The name of Geoff Kuenning may not be used to endorse or promote
-     products derived from this software without specific prior
-     written permission.
-
-  THIS SOFTWARE IS PROVIDED BY GEOFF KUENNING AND CONTRIBUTORS ``AS
-  IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
-  FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL GEOFF
-  KUENNING OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
-  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
-  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
-  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-  POSSIBILITY OF SUCH DAMAGE.

data/example.rb

@@ -1,51 +0,0 @@
-require 'lib/whatlanguage'
-require 'benchmark'
-
-texts = []
-
-texts << %q{Deux autres personnes ont été arrêtées durant la nuit. "Induite par le quinquennat, la modernisation de nos institutions (...) est un facteur de modernité et d'efficacité", a déclaré François Fillon. "Devant cet exécutif plus resserré et plus efficace, les pouvoirs du Parlement doivent être renforcés", a-t-il ajouté, en évoquant par exemple le contrôle parlementaire des nominations à "certains postes publics."
-
-Le premier ministre, indiquant que le président Nicolas Sarkozy entendait "réunir une commission réunissant des personnalités incontestables pour leurs compétences et représentatives de notre diversité politique qui sera chargée d'éclairer ses choix" en matière de modernisation des institutions.
-
-"Faut-il faire élire quelques députés au scrutin proportionnel? (...) Aucun sujet ne doit être tabou", a-t-il lâché. "Enfin nous devrons engager, comme le demande le Conseil constitutionnel, une révision de la carte des circonscriptions législatives. Ce travail sera engagé dans la transparence et en y associant l'opposition".}
-
-texts << %q{The links between the attempted car bombings in Glasgow and London are becoming clearer. Seven are believed to be doctors or medical students, while one formerly worked as a laboratory technician.
-
-Australian media have identified a man arrested at Brisbane airport as Dr Mohammed Haneef, 27.
-
-Two men have been arrested in Blackburn under terror laws but police have not confirmed a link with the car bombs.
-
-The pair were detained on an industrial estate and are being held at a police station in Lancashire on suspicion of offences under the Terrorism Act 2000.
-
-Thousands of passengers travelling from Heathrow Airport's Terminal 4 face major delays after a suspect bag sparked a security alert.
-
-BAA said the departure lounge was partially evacuated and departing passengers were being re-screened, causing some cancellations and delays.}
-
-texts << %q{En estado de máxima alertaen su nivel de crítico. Cinco detenciones hasta el momento parecen indicar que los coches bomba de Londres y Glasgow fueron obra de una misma célula de terroristas islámicos con residencia en el Reino Unido, posiblemente con alguna conexión con otros grupos previamente desarticulados. La relación con éstos, singularmente con el núcleo de Dhiren Barot (condenado a 30 años por sus planes de llenar limusinas con bombonas de gas para provocar una masiva explosión), podría haber llevado a su detención tiempo atrás y su puesta en libertad al no existir suficientes pruebas contra ellos.}
-
-texts << %q{Fern- und Regionalzüge, aber auch die S-Bahnen in den Großstädten stehen still. Gerade hat die Kanzlerin die Ergebnisse des Energiegipfels mit der Wirtschaft, den Energieerzeugern und Verbraucherschützern referiert, die "sachliche Atmosphäre" gelobt. Da wird der Umweltminister von einem Journalisten an seinen Ausspruch vom "Wirtschaftsstalinisten" erinnert, mit dem er jüngst den BASF-Vorstandschef Jürgen Hambrecht belegt hat im Streit um die ehrgeizigen Ziele der deutschen Klimapolitik. Wie haben denn seine Beiträge in der Runde für eine sachliche Atmosphäre ausgesehen? Gabriel überlegt, aber die Kanzlerin ist schneller.}
-
-#texts << %q{Deux autres personnes ont été arrêtées durant la nuit}
-#texts << %q{The links between the attempted car bombings in Glasgow and London are becoming clearer}
-#texts << %q{En estado de máxima alertaen su nivel de crítico}
-#texts << %q{Returns the object in enum with the maximum value.}
-#texts << %q{Propose des données au sujet de la langue espagnole.}
-#texts << %q{La palabra "mezquita" se usa en español para referirse a todo tipo de edificios dedicados.}
-#texts << %q{Fern- und Regionalzüge, aber auch die S-Bahnen in den Großstädten stehen still.}
-
-#texts.collect! { |t| (t + " ") * 5 }
-
-@wl = WhatLanguage.new(:all)
-
-puts Benchmark.measure {
-
-100.times do  
-texts.each { |text| 
-  lang = text.language.to_s.capitalize
-#  puts "#{text[0..18]}... is in #{lang}"
-#  puts @wl.process_text(text).sort_by{|a,b| b }.reverse.inspect
-#  puts "---"
-}
-end
-
-}

data/lib/whatlanguage/bitfield.rb

@@ -1,64 +0,0 @@
-#        NAME: BitField
-#      AUTHOR: Peter Cooper
-#     LICENSE: MIT ( http://www.opensource.org/licenses/mit-license.php )
-#   COPYRIGHT: (c) 2007 Peter Cooper (http://www.petercooper.co.uk/)
-#     VERSION: v4
-#     HISTORY: v4 (better support for loading and dumping fields)
-#              v3 (supports dynamic bitwidths for array elements.. now doing 32 bit widths default)
-#              v2 (now uses 1 << y, rather than 2 ** y .. it's 21.8 times faster!)
-#              v1 (first release)
-#
-# DESCRIPTION: Basic, pure Ruby bit field. Pretty fast (for what it is) and memory efficient.
-#              I've written a pretty intensive test suite for it and it passes great. 
-#              Works well for Bloom filters (the reason I wrote it).
-#
-#              Create a bit field 1000 bits wide
-#                bf = BitField.new(1000)
-#
-#              Setting and reading bits
-#                bf[100] = 1
-#                bf[100]    .. => 1
-#                bf[100] = 0
-#
-#              More
-#                bf.to_s = "10101000101010101"  (example)
-#                bf.total_set         .. => 10  (example - 10 bits are set to "1")
-
-class BitField
-  attr_reader :size
-  attr_accessor :field
-  include Enumerable
-  
-  ELEMENT_WIDTH = 32
-  
-  def initialize(size)
-    @size = size
-    @field = Array.new(((size - 1) / ELEMENT_WIDTH) + 1, 0)
-  end
-  
-  # Set a bit (1/0)
-  def []=(position, value)
-    value == 1 ? @field[position / ELEMENT_WIDTH] |= 1 << (position % ELEMENT_WIDTH) : @field[position / ELEMENT_WIDTH] ^= 1 << (position % ELEMENT_WIDTH)
-  end
-  
-  # Read a bit (1/0)
-  def [](position)
-    @field[position / ELEMENT_WIDTH] & 1 << (position % ELEMENT_WIDTH) > 0 ? 1 : 0
-  end
-  
-  # Iterate over each bit
-  def each(&block)
-    @size.times { |position| yield self[position] }
-  end
-  
-  # Returns the field as a string like "0101010100111100," etc.
-  def to_s
-    inject("") { |a, b| a + b.to_s }
-  end
-  
-  # Returns the total number of bits that are set
-  # (The technique used here is about 6 times faster than using each or inject direct on the bitfield)
-  def total_set
-    @field.inject(0) { |a, byte| a += byte & 1 and byte >>= 1 until byte == 0; a }
-  end
-end

data/lib/whatlanguage/bloominsimple.rb

@@ -1,88 +0,0 @@
-#        NAME: BloominSimple
-#      AUTHOR: Peter Cooper
-#     LICENSE: MIT ( http://www.opensource.org/licenses/mit-license.php )
-#   COPYRIGHT: (c) 2007 Peter Cooper
-# DESCRIPTION: Very basic, pure Ruby Bloom filter. Uses my BitField, pure Ruby
-#              bit field library (http://snippets.dzone.com/posts/show/4234).
-#              Supports custom hashing (default is 3).
-#
-#              Create a Bloom filter that uses default hashing with 1Mbit wide bitfield
-#                bf = BloominSimple.new(1_000_000)
-#              
-#              Add items to it
-#                File.open('/usr/share/dict/words').each { |a| bf.add(a) }
-#
-#              Check for existence of items in the filter
-#                bf.includes?("people")     # => true
-#                bf.includes?("kwyjibo")    # => false
-#
-#              Add better hashing (c'est easy!)
-#                require 'digest/sha1'
-#                b = BloominSimple.new(1_000_000) do |item|
-#                  Digest::SHA1.digest(item.downcase.strip).unpack("VVVV")
-#                end
-#
-#              More
-#                %w{wonderful ball stereo jester flag shshshshsh nooooooo newyorkcity}.each do |a|
-#                  puts "#{sprintf("%15s", a)}: #{b.includes?(a)}"
-#                end
-#
-#                 #  =>   wonderful: true
-#                 #  =>        ball: true
-#                 #  =>      stereo: true
-#                 #  =>      jester: true
-#                 #  =>        flag: true
-#                 #  =>  shshshshsh: false
-#                 #  =>    nooooooo: false
-#                 #  => newyorkcity: false
-
-require 'whatlanguage/bitfield'
-
-class BloominSimple
-  attr_accessor :bitfield, :hasher
-  
-  def initialize(bitsize, &block)
-    @bitfield = BitField.new(bitsize)
-    @size = bitsize
-    @hasher = block || lambda do |word|
-      word = word.downcase.strip
-      [h1 = word.sum, h2 = word.hash, h2 + h1 ** 3]
-    end
-  end
-  
-  # Add item to the filter
-  def add(item)
-    @hasher[item].each { |hi| @bitfield[hi % @size] = 1 }
-  end
-  
-  # Find out if the filter possibly contains the supplied item
-  def includes?(item)
-    @hasher[item].each { |hi| return false unless @bitfield[hi % @size] == 1 } and true
-  end
-  
-  # Allows comparison between two filters. Returns number of same bits.
-  def &(other)
-    raise "Wrong sizes" if self.bitfield.size != other.bitfield.size
-    same = 0
-    #self.bitfield.size.times do |pos|
-    #  same += 1 if self.bitfield[pos] & other.bitfield[pos] == 1
-    #end
-    self.bitfield.total_set.to_s + "--" + other.bitfield.total_set.to_s
-  end
-
-  # Dumps the bitfield for a bloom filter for storage
-  def dump
-    [@size, *@bitfield.field].pack("I*")
-    #Marshal.dump([@size, @bitfield])
-  end
-  
-  # Creates a new bloom filter object from a stored dump (hasher has to be resent though for additions)
-  def self.from_dump(data, &block)
-    data = data.unpack("I*")
-    #data = Marshal.load(data)
-    temp = new(data[0], &block)
-    temp.bitfield.field = data[1..-1]
-    temp
-  end
-end
-

data/test/test_whatlanguage.rb

@@ -1,113 +0,0 @@
-# encoding: utf-8
-require "test/unit"
-
-require 'whatlanguage'
-
-class TestWhatLanguage < Test::Unit::TestCase
-  def setup
-    @wl = WhatLanguage.new(:all)
-  end
-  
-  def test_string_method
-    assert_equal :english, "This is a test".language
-  end
-
-  def test_arabic
-    assert_equal :arabic, @wl.language("اللغة التي هي هذه؟")
-  end
-
-  def test_dutch
-    assert_equal :dutch, @wl.language("Als hadden geweest is, is hebben te laat.")
-  end
-
-  def test_farsi
-    assert_equal :farsi, @wl.language("وقتی مادرم به من آموخت که به آواز خواندن.")
-  end
-
-  def test_finnish
-    assert_equal :finnish, @wl.language("Mitä kieltä tämä on?")
-  end
-
-  def test_french
-    assert_equal :french, @wl.language("Bonjour, je m'appelle Sandrine. Voila ma chatte.")
-  end
-  
-  def test_german
-    assert_equal :german, @wl.language("Welche Sprache ist das?")
-  end
-
-  def test_greek
-    assert_equal :greek, @wl.language("Ποια γλώσσα είναι αυτή;")
-  end
-
-  def test_hebrew
-    assert_equal :hebrew, @wl.language("באיזו שפה זה?")
-  end
-
-  def test_hungarian
-    assert_equal :hungarian, @wl.language("Milyen nyelv ez?")
-  end
-
-  def test_italian
-    assert_equal :italian, @wl.language("Roma, capitale dell'impero romano, è stata per secoli il centro politico e culturale della civiltà occidentale.")
-  end
-
-  def test_korean
-    assert_equal :korean, @wl.language("이 어떤 언어인가?")
-  end
-
-  def test_norwegian
-    assert_equal :norwegian, @wl.language("Hvilket språk er dette?")
-  end
-
-  def test_polish
-    assert_equal :polish, @wl.language("W jakim języku to jest?")
-  end
-
-  def test_portuguese
-    assert_equal :portuguese, @wl.language("Que linguagem é essa?")
-  end
-
-  def test_russian
-    assert_equal :russian, @wl.language("Все новости в хронологическом порядке")
-  end
-
-  def test_spanish
-    assert_equal :spanish, @wl.language("La palabra mezquita se usa en español para referirse a todo tipo de edificios dedicados.")
-  end
-
-  def test_swedish
-    assert_equal :swedish, @wl.language("Vilket språk är detta?")
-  end
-  
-  def test_nothing
-    assert_nil @wl.language("")
-  end
-  
-  def test_something
-    assert_not_nil @wl.language("test")
-  end
-  
-  def test_processor
-    assert_kind_of Hash, @wl.process_text("this is a test")
-  end
-
-  def test_italian
-    assert_equal :italian, @wl.language("Roma, capitale dell'impero romano, è stata per secoli il centro politico e culturale della civiltà occidentale.")
-  end
-
-  def test_language_selection
-    selective_wl = WhatLanguage.new(:german, :english)
-    assert_equal :german, selective_wl.language("der die das")
-  end
-
-  def test_language_selection_empty
-    selective_wl = WhatLanguage.new()
-    assert_equal :russian, selective_wl.language("Все новости в хронологическом порядке")
-  end
-
-  def test_language_selection_mixed
-    selective_wl = WhatLanguage.new(:german, :all, :english)
-    assert_equal :russian, selective_wl.language("Все новости в хронологическом порядке")
-  end
-end